blt-gp/include/blt/gp/fwdecl.h

370 lines
12 KiB
C
Raw Normal View History

2024-06-02 21:27:00 -04:00
#pragma once
/*
* Copyright (C) 2024 Brett Terpstra
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#ifndef BLT_GP_FWDECL_H
#define BLT_GP_FWDECL_H
2024-06-26 20:24:58 -04:00
#include <functional>
#include <blt/std/logging.h>
2024-06-29 14:03:57 -04:00
#include <blt/std/types.h>
#include <blt/gp/stats.h>
#include <ostream>
#include <cstdlib>
2024-09-04 02:42:31 -04:00
#include <mutex>
#include <atomic>
#include <blt/std/mmap.h>
2024-06-21 22:04:57 -04:00
2024-06-02 21:27:00 -04:00
namespace blt::gp
{
2024-09-01 22:15:32 -04:00
#ifdef BLT_TRACK_ALLOCATIONS
inline allocation_tracker_t tracker;
2024-09-02 15:41:20 -04:00
// population gen specifics
2024-08-31 23:15:16 -04:00
inline call_tracker_t crossover_calls;
inline call_tracker_t mutation_calls;
inline call_tracker_t reproduction_calls;
inline call_tracker_t crossover_allocations;
inline call_tracker_t mutation_allocations;
inline call_tracker_t reproduction_allocations;
2024-09-02 15:41:20 -04:00
// for evaluating fitness
inline call_tracker_t evaluation_calls;
inline call_tracker_t evaluation_allocations;
2024-09-01 22:15:32 -04:00
#endif
2024-06-21 22:04:57 -04:00
class gp_program;
2024-06-24 14:00:08 -04:00
2024-06-21 22:04:57 -04:00
class type;
2024-06-24 14:00:08 -04:00
struct operator_id;
struct type_id;
2024-06-29 10:47:27 -04:00
class type_provider;
2024-06-21 22:04:57 -04:00
2024-06-25 22:21:41 -04:00
struct op_container_t;
class evaluation_context;
2024-06-24 21:56:51 -04:00
class tree_t;
struct individual_t;
2024-06-24 21:56:51 -04:00
class population_t;
2024-06-21 22:04:57 -04:00
class tree_generator_t;
2024-06-24 14:00:08 -04:00
2024-06-21 22:04:57 -04:00
class grow_generator_t;
2024-06-24 14:00:08 -04:00
2024-06-21 22:04:57 -04:00
class full_generator_t;
2024-06-26 20:24:58 -04:00
class stack_allocator;
template<typename T>
class tracked_allocator_t;
2024-09-01 22:15:32 -04:00
#ifdef BLT_TRACK_ALLOCATIONS
template<typename T>
using tracked_vector = std::vector<T, tracked_allocator_t<T>>;
2024-09-01 22:15:32 -04:00
#else
template<typename T>
using tracked_vector = std::vector<T>;
#endif
2024-09-02 01:55:15 -04:00
// using operation_vector_t = tracked_vector<op_container_t>;
// using individual_vector_t = tracked_vector<individual_t, tracked_allocator_t<individual_t>>;
// using tree_vector_t = tracked_vector<tree_t>;
class aligned_allocator
{
public:
void* allocate(blt::size_t bytes) // NOLINT
{
#ifdef BLT_TRACK_ALLOCATIONS
tracker.allocate(bytes);
2024-09-03 22:38:45 -04:00
// std::cout << "Hey our aligned allocator allocated " << bytes << " bytes!\n";
#endif
return std::aligned_alloc(8, bytes);
}
void deallocate(void* ptr, blt::size_t bytes) // NOLINT
{
if (ptr == nullptr)
return;
#ifdef BLT_TRACK_ALLOCATIONS
tracker.deallocate(bytes);
2024-09-03 22:38:45 -04:00
// std::cout << "[Hey our aligned allocator deallocated " << bytes << " bytes!]\n";
#else
(void) bytes;
#endif
std::free(ptr);
}
};
2024-09-04 16:05:35 -04:00
template<typename Alloc = blt::aligned_huge_allocator>
2024-09-04 02:42:31 -04:00
class variable_bump_allocator
{
public:
explicit variable_bump_allocator(blt::size_t default_block_size = BLT_2MB_SIZE): default_block_size(default_block_size)
{}
void* allocate(blt::size_t bytes)
{
#ifdef BLT_TRACK_ALLOCATIONS
tracker.allocate(bytes);
#endif
std::scoped_lock lock(mutex);
if (head == nullptr || head->remaining_bytes_in_block() < static_cast<blt::ptrdiff_t>(bytes))
{
push_block(bytes);
}
auto ptr = head->metadata.offset;
head->metadata.offset += bytes;
++head->metadata.allocated_objects;
return ptr;
}
void deallocate(void* ptr, blt::size_t bytes)
{
if (ptr == nullptr)
return;
#ifdef BLT_TRACK_ALLOCATIONS
tracker.deallocate(bytes);
#else
(void) bytes;
#endif
std::scoped_lock lock(mutex);
block_t* blk = to_block(ptr);
2024-09-04 02:42:31 -04:00
--blk->metadata.allocated_objects;
if (blk->metadata.allocated_objects == 0)
{
if (blk->metadata.has_deallocated)
alloc.deallocate(blk, blk->metadata.size);
2024-09-04 02:42:31 -04:00
else
{
if (head == blk)
head = head->metadata.next;
else
2024-09-04 02:42:31 -04:00
{
auto prev = head;
auto next = head->metadata.next;
while (next != blk)
{
prev = next;
next = next->metadata.next;
}
prev->metadata.next = next->metadata.next;
2024-09-04 02:42:31 -04:00
}
deallocated_blocks.push_back(blk);
2024-09-04 02:42:31 -04:00
}
}
}
~variable_bump_allocator()
{
std::scoped_lock lock(mutex);
for (auto* blk : deallocated_blocks)
{
2024-09-04 02:42:31 -04:00
alloc.deallocate(blk, blk->metadata.size);
}
2024-09-04 02:42:31 -04:00
auto cur = head;
while (cur != nullptr)
{
auto* ptr = cur;
ptr->metadata.has_deallocated = true;
2024-09-04 02:42:31 -04:00
cur = cur->metadata.next;
}
head = nullptr;
}
private:
struct block_t
{
struct block_metadata_t
{
blt::size_t size;
blt::size_t allocated_objects : 63;
bool has_deallocated : 1;
block_t* next;
blt::u8* offset;
2024-09-04 02:42:31 -04:00
} metadata;
blt::u8 buffer[8]{};
explicit block_t(blt::size_t size): metadata{size, 0, false, nullptr, nullptr}
2024-09-04 02:42:31 -04:00
{
reset();
}
void reset()
{
metadata.offset = buffer;
metadata.allocated_objects = 0;
metadata.next = nullptr;
2024-09-04 02:42:31 -04:00
}
[[nodiscard]] blt::ptrdiff_t storage_size() const noexcept
{
return static_cast<blt::ptrdiff_t>(metadata.size - sizeof(typename block_t::block_metadata_t));
}
[[nodiscard]] blt::ptrdiff_t used_bytes_in_block() const noexcept
{
return static_cast<blt::ptrdiff_t>(metadata.offset - buffer);
}
[[nodiscard]] blt::ptrdiff_t remaining_bytes_in_block() const noexcept
{
return storage_size() - used_bytes_in_block();
}
};
static inline block_t* to_block(void* p)
{
return reinterpret_cast<block_t*>(reinterpret_cast<std::uintptr_t>(p) & static_cast<std::uintptr_t>(~(BLT_2MB_SIZE - 1)));
}
void push_block(blt::size_t bytes)
{
auto blk = allocate_block(bytes);
BLT_TRACE("Allocated block %p", blk);
2024-09-04 02:42:31 -04:00
blk->metadata.next = head;
head = blk;
}
inline block_t* allocate_block(blt::size_t bytes)
{
if (!deallocated_blocks.empty())
{
block_t* blk = deallocated_blocks.back();
2024-09-04 02:42:31 -04:00
deallocated_blocks.pop_back();
blk->reset();
2024-09-04 02:42:31 -04:00
return blk;
}
auto size = align_size_to(bytes + sizeof(typename block_t::block_metadata_t), default_block_size);
2024-09-04 16:05:35 -04:00
auto* ptr = static_cast<block_t*>(alloc.allocate(size));
2024-09-04 02:42:31 -04:00
new(ptr) block_t{size};
return ptr;
}
private:
block_t* head = nullptr;
std::mutex mutex;
std::vector<block_t*> deallocated_blocks;
blt::size_t default_block_size;
Alloc alloc;
2024-09-04 02:42:31 -04:00
};
template<typename T>
class tracked_allocator_t
{
public:
using value_type = T;
using reference = T&;
using const_reference = const T&;
using pointer = T*;
using const_pointer = const T*;
using void_pointer = void*;
using const_void_pointer = const void*;
using difference_type = blt::ptrdiff_t;
using size_type = blt::size_t;
template<class U>
struct rebind
{
typedef tracked_allocator_t<U> other;
};
pointer allocate(size_type n)
{
#ifdef BLT_TRACK_ALLOCATIONS
tracker.allocate(n * sizeof(T));
2024-09-03 17:51:54 -04:00
// std::cout << "Hey our tracked allocator allocated " << (n * sizeof(T)) << " bytes!\n";
#endif
return static_cast<pointer>(std::malloc(n * sizeof(T)));
}
pointer allocate(size_type n, const_void_pointer)
{
return allocate(n);
}
void deallocate(pointer p, size_type n)
{
#ifdef BLT_TRACK_ALLOCATIONS
tracker.deallocate(n * sizeof(T));
2024-09-03 17:51:54 -04:00
// std::cout << "[Hey our tracked allocator deallocated " << (n * sizeof(T)) << " bytes!]\n";
#else
(void) n;
#endif
std::free(p);
}
template<class U, class... Args>
void construct(U* p, Args&& ... args)
{
2024-08-31 22:44:34 -04:00
new(p) T(std::forward<Args>(args)...);
}
template<class U>
void destroy(U* p)
{
p->~T();
}
[[nodiscard]] size_type max_size() const noexcept
{
return std::numeric_limits<size_type>::max();
}
};
template<class T1, class T2>
inline static bool operator==(const tracked_allocator_t<T1>& lhs, const tracked_allocator_t<T2>& rhs) noexcept
{
return &lhs == &rhs;
}
template<class T1, class T2>
inline static bool operator!=(const tracked_allocator_t<T1>& lhs, const tracked_allocator_t<T2>& rhs) noexcept
{
return &lhs != &rhs;
}
2024-06-24 14:00:08 -04:00
namespace detail
{
class operator_storage_test;
2024-06-26 20:24:58 -04:00
// context*, read stack, write stack
2024-08-20 13:52:06 -04:00
using operator_func_t = std::function<void(void*, stack_allocator&, stack_allocator&)>;
2024-08-22 02:10:55 -04:00
using eval_func_t = std::function<evaluation_context&(const tree_t& tree, void* context)>;
// debug function,
using print_func_t = std::function<void(std::ostream&, stack_allocator&)>;
2024-08-12 13:48:06 -04:00
enum class destroy_t
{
ARGS,
RETURN
};
2024-08-21 20:40:42 -04:00
using destroy_func_t = std::function<void(destroy_t, stack_allocator&)>;
using const_op_iter_t = tracked_vector<op_container_t>::const_iterator;
using op_iter_t = tracked_vector<op_container_t>::iterator;
2024-06-24 14:00:08 -04:00
}
2024-06-02 21:27:00 -04:00
}
#endif //BLT_GP_FWDECL_H