#pragma once
#include "BExport.h"
#include <cstddef>
#include <cstdint>
namespace bmalloc {
struct FreeCell {
static uintptr_t scramble(FreeCell* cell, uintptr_t secret)
{
return reinterpret_cast<uintptr_t>(cell) ^ secret;
}
static FreeCell* descramble(uintptr_t cell, uintptr_t secret)
{
return reinterpret_cast<FreeCell*>(cell ^ secret);
}
void setNext(FreeCell* next, uintptr_t secret)
{
scrambledNext = scramble(next, secret);
}
FreeCell* next(uintptr_t secret) const
{
return descramble(scrambledNext, secret);
}
uintptr_t scrambledNext;
};
class FreeList {
public:
BEXPORT FreeList();
BEXPORT ~FreeList();
BEXPORT void clear();
BEXPORT void initializeList(FreeCell* head, uintptr_t secret, unsigned bytes);
BEXPORT void initializeBump(char* payloadEnd, unsigned remaining);
bool allocationWillFail() const { return !head() && !m_remaining; }
bool allocationWillSucceed() const { return !allocationWillFail(); }
template<typename Config, typename Func>
void* allocate(const Func& slowPath);
bool contains(void*) const;
template<typename Config, typename Func>
void forEach(const Func&) const;
unsigned originalSize() const { return m_originalSize; }
private:
FreeCell* head() const { return FreeCell::descramble(m_scrambledHead, m_secret); }
uintptr_t m_scrambledHead { 0 };
uintptr_t m_secret { 0 };
char* m_payloadEnd { nullptr };
unsigned m_remaining { 0 };
unsigned m_originalSize { 0 };
};
}