Knoodle
Knoodle is a Free Open-Source alternative for graph-based texture designers. It is a tool for creating procedural textures using a node-based graph editor. It is designed to be easy to use, to be able to create complex textures with a minimum of effort, and to be pluggable to any game engine and front-end.
 
Loading...
Searching...
No Matches
heap_allocator.hpp
1/**************************************************************************/
2/* heap_allocator.hpp */
3/**************************************************************************/
4/* This file is part of: */
5/* Knoodle */
6/* https://knoodlegraph.org */
7/**************************************************************************/
8/* Copyright (c) 2025 Knoodle contributors (vide AUTHORS.md) */
9/* */
10/* Permission is hereby granted, free of charge, to any person obtaining */
11/* a copy of this software and associated documentation files (the */
12/* "Software"), to deal in the Software without restriction, including */
13/* without limitation the rights to use, copy, modify, merge, publish, */
14/* distribute, sublicense, and/or sell copies of the Software, and to */
15/* permit persons to whom the Software is furnished to do so, subject to */
16/* the following conditions: */
17/* */
18/* The above copyright notice and this permission notice shall be */
19/* included in all copies or substantial portions of the Software. */
20/* */
21/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
22/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
23/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */
24/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
25/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
26/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
27/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
28/**************************************************************************/
29
30#pragma once
31
32#include <stdlib.h>
33#include <memory>
34#include <new>
35#include "core_api.hpp"
36#include "kn_assert.hpp"
37
38namespace kn {
39class KN_CORE_API HeapAllocator {
40 public:
41 HeapAllocator(const HeapAllocator&) = delete;
42 HeapAllocator& operator=(const HeapAllocator&) = delete;
43
44 HeapAllocator() = default;
45 ~HeapAllocator() = default;
46
47 [[nodiscard]] inline size_t get_allocated_size() const { return _allocated_size; }
48 [[nodiscard]] inline size_t get_deallocated_size() const { return _deallocated_size; }
49 [[nodiscard]] inline size_t get_total_size() const { return _allocated_size - _deallocated_size; }
50
51 static HeapAllocator* get_instance();
52
53 template <typename T>
54 T* allocate(size_t count = 1, size_t alignment = 1) {
55 size_t desired_size = count * sizeof(T);
56 _allocated_size += desired_size;
57
58 T* obj = nullptr;
59
60 void* ptr = nullptr;
61#if defined(_MSC_VER)
62 ptr = _aligned_malloc(desired_size, alignment);
63#else
64 posix_memalign(&ptr, alignment, desired_size);
65#endif
66
67 if (ensure(ptr)) {
68 obj = reinterpret_cast<T*>(ptr);
69 for (uint32_t i = 0; i < count; ++i) {
70 new (reinterpret_cast<T*>(ptr) + i) T;
71 }
72 return obj;
73 }
74
75 return nullptr;
76 }
77
78 template <typename T>
79 void deallocate(T* ptr, size_t count = 1) {
80 if (ensure(ptr)) {
81 size_t desired_size = count * sizeof(T);
82 _deallocated_size += desired_size;
83 for (uint32_t i = 0; i < count; ++i) {
84 ptr[i].~T();
85 }
86 }
87 }
88
89 private:
90 static std::unique_ptr<HeapAllocator> instance;
91
92 size_t _allocated_size = 0;
93 size_t _deallocated_size = 0;
94};
95} // namespace kn
Definition heap_allocator.hpp:39
#define ensure(condition)
Definition kn_assert.hpp:43