#ifndef PKE_MEMORY_HPP
#define PKE_MEMORY_HPP

#include "macros.hpp"

#include <cstring>
#include <cstdint>
#include <cstdlib>
#include <cstdio>
#include <cassert>
#include <type_traits>
#include <new>

// 256MB
#define DEFAULT_BUCKET_SIZE 1UL << 27

struct MemBucket;

template<typename T, typename CT>
struct BucketContainer {
	uint64_t incrementer = 2;
	CT bucketCounter{0};
	CT itemCounter{0};
	T *buckets = nullptr;
};

void *Pke_New(std::size_t sz);
void *Pke_New(std::size_t sz, MemBucket *bkt);
void Pke_Delete(const void *ptr, std::size_t sz);
void Pke_Delete(const void *ptr, std::size_t sz, MemBucket *bkt);
void Pke_DebugPrint();

MemBucket *Pke_BeginTransientBucket(int64_t sz = DEFAULT_BUCKET_SIZE);
void Pke_EndTransientBucket(MemBucket *bkt);
void Pke_MemoryFlush();

template <typename T>
inline T *Pke_New(MemBucket *bucket = nullptr) {
	void *ptr = nullptr;
	if (bucket) {
		ptr = Pke_New(sizeof(T), bucket);
	} else {
		ptr = Pke_New(sizeof(T));
	}
	if IS_CONSTRUCTIBLE(T) {
		return new (ptr) T{};
	}
	return reinterpret_cast<T *>(ptr);
}
template <typename T>
inline T *Pke_New(long count, MemBucket *bucket = nullptr) {
	char *ptr = nullptr;
	if (bucket) {
		ptr = static_cast<char *>(Pke_New(sizeof(T) * count, bucket));
	} else {
		ptr = static_cast<char *>(Pke_New(sizeof(T) * count));
	}
	if IS_CONSTRUCTIBLE(T) {
		for (long i = 0; i < count; ++i) {
			new (ptr + (i * sizeof(T))) T{};
		}
	}
	return reinterpret_cast<T *>(ptr);
}
template <typename T>
inline void Pke_Delete(const void *ptr, MemBucket *bucket = nullptr) {
	if IS_DESTRUCTIBLE(T) {
		reinterpret_cast<const T *>(ptr)->~T();
	}
	if (bucket) {
		return Pke_Delete(ptr, sizeof(T), bucket);
	} else {
		return Pke_Delete(ptr, sizeof(T));
	}
}
template <typename T>
inline void Pke_Delete(const void *ptr, long count, MemBucket *bucket = nullptr) {
	if IS_DESTRUCTIBLE(T) {
		for (long i = 0; i < count; ++i) {
			reinterpret_cast<const T *>(reinterpret_cast<const char *>(ptr) + (i * sizeof(T)))->~T();
		}
	}
	if (bucket) {
		return Pke_Delete(ptr, sizeof(T) * count, bucket);
	} else {
		return Pke_Delete(ptr, sizeof(T) * count);
	}
}


template <typename T, typename CT>
void Buckets_Init(BucketContainer<T, CT> &bktContainer) {
	assert(bktContainer.buckets == nullptr && "bucket container already initialized");
	bktContainer.buckets = Pke_New<T>(bktContainer.incrementer);
}

uint64_t Buckets_NewHandle(std::size_t bucketBytes, uint64_t bucketItemCount, uint64_t &bucketIncrementer, uint64_t &bucketCounter, uint64_t &itemCounter, void*& buckets);

template <typename T> inline uint64_t Buckets_NewHandle(uint64_t bucketItemCount, uint64_t &bucketIncrementer, uint64_t &bucketCounter, uint64_t &itemCounter, T*& buckets) {
	void *ptr = reinterpret_cast<void *>(buckets);
	uint64_t handle = Buckets_NewHandle(sizeof(T), bucketItemCount, bucketIncrementer, bucketCounter, itemCounter, ptr);
	buckets = reinterpret_cast<T *>(ptr);
	return handle;
}

template <typename T, typename CT>
inline CT Buckets_NewHandle(uint64_t maxBucketItemCount, BucketContainer<T, CT> &bktContainer) {
	return Buckets_NewHandle(maxBucketItemCount, bktContainer.incrementer, bktContainer.bucketCounter, bktContainer.itemCounter, bktContainer.buckets);
}

static inline constexpr uint64_t Buckets_GetBucketIndex(uint64_t handle) {
	return handle & 0x00000000FFFFFFFF;
}

static inline constexpr uint64_t Buckets_GetItemIndex(uint64_t handle) {
	return handle >> 32;
}

template <typename T, typename CT>
static inline constexpr void Buckets_Destroy(BucketContainer<T, CT> &bktContainer) {
	if (bktContainer.buckets == nullptr || bktContainer.buckets == CAFE_BABE(T)) return;
	Pke_Delete<T>(bktContainer.buckets, bktContainer.bucketCounter);
	bktContainer.buckets = CAFE_BABE(T);
}

#endif /* PKE_MEMORY_HPP */