paged_allocator.h 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148
  1. /**************************************************************************/
  2. /* paged_allocator.h */
  3. /**************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /**************************************************************************/
  8. /* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */
  9. /* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
  10. /* */
  11. /* Permission is hereby granted, free of charge, to any person obtaining */
  12. /* a copy of this software and associated documentation files (the */
  13. /* "Software"), to deal in the Software without restriction, including */
  14. /* without limitation the rights to use, copy, modify, merge, publish, */
  15. /* distribute, sublicense, and/or sell copies of the Software, and to */
  16. /* permit persons to whom the Software is furnished to do so, subject to */
  17. /* the following conditions: */
  18. /* */
  19. /* The above copyright notice and this permission notice shall be */
  20. /* included in all copies or substantial portions of the Software. */
  21. /* */
  22. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  23. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  24. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */
  25. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  26. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  27. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  28. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  29. /**************************************************************************/
  30. #ifndef PAGED_ALLOCATOR_H
  31. #define PAGED_ALLOCATOR_H
  32. #include "core/core_globals.h"
  33. #include "core/os/memory.h"
  34. #include "core/os/spin_lock.h"
  35. #include "core/string/ustring.h"
  36. #include "core/typedefs.h"
  37. #include <type_traits>
  38. #include <typeinfo>
  39. template <class T, bool thread_safe = false>
  40. class PagedAllocator {
  41. T **page_pool = nullptr;
  42. T ***available_pool = nullptr;
  43. uint32_t pages_allocated = 0;
  44. uint32_t allocs_available = 0;
  45. uint32_t page_shift = 0;
  46. uint32_t page_mask = 0;
  47. uint32_t page_size = 0;
  48. SpinLock spin_lock;
  49. public:
  50. enum {
  51. DEFAULT_PAGE_SIZE = 4096
  52. };
  53. template <class... Args>
  54. T *alloc(const Args &&...p_args) {
  55. if (thread_safe) {
  56. spin_lock.lock();
  57. }
  58. if (unlikely(allocs_available == 0)) {
  59. uint32_t pages_used = pages_allocated;
  60. pages_allocated++;
  61. page_pool = (T **)memrealloc(page_pool, sizeof(T *) * pages_allocated);
  62. available_pool = (T ***)memrealloc(available_pool, sizeof(T **) * pages_allocated);
  63. page_pool[pages_used] = (T *)memalloc(sizeof(T) * page_size);
  64. available_pool[pages_used] = (T **)memalloc(sizeof(T *) * page_size);
  65. for (uint32_t i = 0; i < page_size; i++) {
  66. available_pool[0][i] = &page_pool[pages_used][i];
  67. }
  68. allocs_available += page_size;
  69. }
  70. allocs_available--;
  71. T *alloc = available_pool[allocs_available >> page_shift][allocs_available & page_mask];
  72. if (thread_safe) {
  73. spin_lock.unlock();
  74. }
  75. memnew_placement(alloc, T(p_args...));
  76. return alloc;
  77. }
  78. void free(T *p_mem) {
  79. if (thread_safe) {
  80. spin_lock.lock();
  81. }
  82. p_mem->~T();
  83. available_pool[allocs_available >> page_shift][allocs_available & page_mask] = p_mem;
  84. allocs_available++;
  85. if (thread_safe) {
  86. spin_lock.unlock();
  87. }
  88. }
  89. void reset(bool p_allow_unfreed = false) {
  90. if (!p_allow_unfreed || !std::is_trivially_destructible<T>::value) {
  91. ERR_FAIL_COND(allocs_available < pages_allocated * page_size);
  92. }
  93. if (pages_allocated) {
  94. for (uint32_t i = 0; i < pages_allocated; i++) {
  95. memfree(page_pool[i]);
  96. memfree(available_pool[i]);
  97. }
  98. memfree(page_pool);
  99. memfree(available_pool);
  100. page_pool = nullptr;
  101. available_pool = nullptr;
  102. pages_allocated = 0;
  103. allocs_available = 0;
  104. }
  105. }
  106. bool is_configured() const {
  107. return page_size > 0;
  108. }
  109. void configure(uint32_t p_page_size) {
  110. ERR_FAIL_COND(page_pool != nullptr); //sanity check
  111. ERR_FAIL_COND(p_page_size == 0);
  112. page_size = nearest_power_of_2_templated(p_page_size);
  113. page_mask = page_size - 1;
  114. page_shift = get_shift_from_power_of_2(page_size);
  115. }
  116. // Power of 2 recommended because of alignment with OS page sizes.
  117. // Even if element is bigger, it's still a multiple and gets rounded to amount of pages.
  118. PagedAllocator(uint32_t p_page_size = DEFAULT_PAGE_SIZE) {
  119. configure(p_page_size);
  120. }
  121. ~PagedAllocator() {
  122. if (allocs_available < pages_allocated * page_size) {
  123. if (CoreGlobals::leak_reporting_enabled) {
  124. ERR_FAIL_COND_MSG(allocs_available < pages_allocated * page_size, String("Pages in use exist at exit in PagedAllocator: ") + String(typeid(T).name()));
  125. }
  126. return;
  127. }
  128. reset();
  129. }
  130. };
  131. #endif // PAGED_ALLOCATOR_H