paged_allocator.h 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129
  1. /*************************************************************************/
  2. /* paged_allocator.h */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2021 Juan Linietsky, Ariel Manzur. */
  9. /* Copyright (c) 2014-2021 Godot Engine contributors (cf. AUTHORS.md). */
  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/os/memory.h"
  33. #include "core/os/spin_lock.h"
  34. #include "core/typedefs.h"
  35. template <class T, bool thread_safe = false>
  36. class PagedAllocator {
  37. T **page_pool = nullptr;
  38. T ***available_pool = nullptr;
  39. uint32_t pages_allocated = 0;
  40. uint32_t allocs_available = 0;
  41. uint32_t page_shift = 0;
  42. uint32_t page_mask = 0;
  43. uint32_t page_size = 0;
  44. SpinLock spin_lock;
  45. public:
  46. T *alloc() {
  47. if (thread_safe) {
  48. spin_lock.lock();
  49. }
  50. if (unlikely(allocs_available == 0)) {
  51. uint32_t pages_used = pages_allocated;
  52. pages_allocated++;
  53. page_pool = (T **)memrealloc(page_pool, sizeof(T *) * pages_allocated);
  54. available_pool = (T ***)memrealloc(available_pool, sizeof(T **) * pages_allocated);
  55. page_pool[pages_used] = (T *)memalloc(sizeof(T) * page_size);
  56. available_pool[pages_used] = (T **)memalloc(sizeof(T *) * page_size);
  57. for (uint32_t i = 0; i < page_size; i++) {
  58. available_pool[0][i] = &page_pool[pages_used][i];
  59. }
  60. allocs_available += page_size;
  61. }
  62. allocs_available--;
  63. T *alloc = available_pool[allocs_available >> page_shift][allocs_available & page_mask];
  64. if (thread_safe) {
  65. spin_lock.unlock();
  66. }
  67. memnew_placement(alloc, T);
  68. return alloc;
  69. }
  70. void free(T *p_mem) {
  71. if (thread_safe) {
  72. spin_lock.lock();
  73. }
  74. p_mem->~T();
  75. available_pool[allocs_available >> page_shift][allocs_available & page_mask] = p_mem;
  76. if (thread_safe) {
  77. spin_lock.unlock();
  78. }
  79. allocs_available++;
  80. }
  81. void reset() {
  82. ERR_FAIL_COND(allocs_available < pages_allocated * page_size);
  83. if (pages_allocated) {
  84. for (uint32_t i = 0; i < pages_allocated; i++) {
  85. memfree(page_pool[i]);
  86. memfree(available_pool[i]);
  87. }
  88. memfree(page_pool);
  89. memfree(available_pool);
  90. page_pool = nullptr;
  91. available_pool = nullptr;
  92. pages_allocated = 0;
  93. allocs_available = 0;
  94. }
  95. }
  96. bool is_configured() const {
  97. return page_size > 0;
  98. }
  99. void configure(uint32_t p_page_size) {
  100. ERR_FAIL_COND(page_pool != nullptr); //sanity check
  101. ERR_FAIL_COND(p_page_size == 0);
  102. page_size = nearest_power_of_2_templated(p_page_size);
  103. page_mask = page_size - 1;
  104. page_shift = get_shift_from_power_of_2(page_size);
  105. }
  106. PagedAllocator(uint32_t p_page_size = 4096) { // power of 2 recommended because of alignment with OS page sizes. Even if element is bigger, its still a multiple and get rounded amount of pages
  107. configure(p_page_size);
  108. }
  109. ~PagedAllocator() {
  110. ERR_FAIL_COND_MSG(allocs_available < pages_allocated * page_size, "Pages in use exist at exit in PagedAllocator");
  111. reset();
  112. }
  113. };
  114. #endif // PAGED_ALLOCATOR_H