memory.cpp 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231
  1. /**************************************************************************/
  2. /* memory.cpp */
  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. #include "memory.h"
  31. #include "core/templates/safe_refcount.h"
  32. #include <stdlib.h>
  33. #include <string.h>
  34. void *operator new(size_t p_size, const char *p_description) {
  35. return Memory::alloc_static(p_size, false);
  36. }
  37. void *operator new(size_t p_size, void *(*p_allocfunc)(size_t p_size)) {
  38. return p_allocfunc(p_size);
  39. }
  40. #ifdef _MSC_VER
  41. void operator delete(void *p_mem, const char *p_description) {
  42. CRASH_NOW_MSG("Call to placement delete should not happen.");
  43. }
  44. void operator delete(void *p_mem, void *(*p_allocfunc)(size_t p_size)) {
  45. CRASH_NOW_MSG("Call to placement delete should not happen.");
  46. }
  47. void operator delete(void *p_mem, void *p_pointer, size_t check, const char *p_description) {
  48. CRASH_NOW_MSG("Call to placement delete should not happen.");
  49. }
  50. #endif
  51. #ifdef DEBUG_ENABLED
  52. SafeNumeric<uint64_t> Memory::mem_usage;
  53. SafeNumeric<uint64_t> Memory::max_usage;
  54. #endif
  55. SafeNumeric<uint64_t> Memory::alloc_count;
  56. inline bool is_power_of_2(size_t x) { return x && ((x & (x - 1U)) == 0U); }
  57. void *Memory::alloc_aligned_static(size_t p_bytes, size_t p_alignment) {
  58. DEV_ASSERT(is_power_of_2(p_alignment));
  59. void *p1, *p2;
  60. if ((p1 = (void *)malloc(p_bytes + p_alignment - 1 + sizeof(uint32_t))) == nullptr) {
  61. return nullptr;
  62. }
  63. p2 = (void *)(((uintptr_t)p1 + sizeof(uint32_t) + p_alignment - 1) & ~((p_alignment)-1));
  64. *((uint32_t *)p2 - 1) = (uint32_t)((uintptr_t)p2 - (uintptr_t)p1);
  65. return p2;
  66. }
  67. void *Memory::realloc_aligned_static(void *p_memory, size_t p_bytes, size_t p_prev_bytes, size_t p_alignment) {
  68. if (p_memory == nullptr) {
  69. return alloc_aligned_static(p_bytes, p_alignment);
  70. }
  71. void *ret = alloc_aligned_static(p_bytes, p_alignment);
  72. memcpy(ret, p_memory, p_prev_bytes);
  73. free_aligned_static(p_memory);
  74. return ret;
  75. }
  76. void Memory::free_aligned_static(void *p_memory) {
  77. uint32_t offset = *((uint32_t *)p_memory - 1);
  78. void *p = (void *)((uint8_t *)p_memory - offset);
  79. free(p);
  80. }
  81. void *Memory::alloc_static(size_t p_bytes, bool p_pad_align) {
  82. #ifdef DEBUG_ENABLED
  83. bool prepad = true;
  84. #else
  85. bool prepad = p_pad_align;
  86. #endif
  87. void *mem = malloc(p_bytes + (prepad ? DATA_OFFSET : 0));
  88. ERR_FAIL_NULL_V(mem, nullptr);
  89. alloc_count.increment();
  90. if (prepad) {
  91. uint8_t *s8 = (uint8_t *)mem;
  92. uint64_t *s = (uint64_t *)(s8 + SIZE_OFFSET);
  93. *s = p_bytes;
  94. #ifdef DEBUG_ENABLED
  95. uint64_t new_mem_usage = mem_usage.add(p_bytes);
  96. max_usage.exchange_if_greater(new_mem_usage);
  97. #endif
  98. return s8 + DATA_OFFSET;
  99. } else {
  100. return mem;
  101. }
  102. }
  103. void *Memory::realloc_static(void *p_memory, size_t p_bytes, bool p_pad_align) {
  104. if (p_memory == nullptr) {
  105. return alloc_static(p_bytes, p_pad_align);
  106. }
  107. uint8_t *mem = (uint8_t *)p_memory;
  108. #ifdef DEBUG_ENABLED
  109. bool prepad = true;
  110. #else
  111. bool prepad = p_pad_align;
  112. #endif
  113. if (prepad) {
  114. mem -= DATA_OFFSET;
  115. uint64_t *s = (uint64_t *)(mem + SIZE_OFFSET);
  116. #ifdef DEBUG_ENABLED
  117. if (p_bytes > *s) {
  118. uint64_t new_mem_usage = mem_usage.add(p_bytes - *s);
  119. max_usage.exchange_if_greater(new_mem_usage);
  120. } else {
  121. mem_usage.sub(*s - p_bytes);
  122. }
  123. #endif
  124. if (p_bytes == 0) {
  125. free(mem);
  126. return nullptr;
  127. } else {
  128. *s = p_bytes;
  129. mem = (uint8_t *)realloc(mem, p_bytes + DATA_OFFSET);
  130. ERR_FAIL_NULL_V(mem, nullptr);
  131. s = (uint64_t *)(mem + SIZE_OFFSET);
  132. *s = p_bytes;
  133. return mem + DATA_OFFSET;
  134. }
  135. } else {
  136. mem = (uint8_t *)realloc(mem, p_bytes);
  137. ERR_FAIL_COND_V(mem == nullptr && p_bytes > 0, nullptr);
  138. return mem;
  139. }
  140. }
  141. void Memory::free_static(void *p_ptr, bool p_pad_align) {
  142. ERR_FAIL_NULL(p_ptr);
  143. uint8_t *mem = (uint8_t *)p_ptr;
  144. #ifdef DEBUG_ENABLED
  145. bool prepad = true;
  146. #else
  147. bool prepad = p_pad_align;
  148. #endif
  149. alloc_count.decrement();
  150. if (prepad) {
  151. mem -= DATA_OFFSET;
  152. #ifdef DEBUG_ENABLED
  153. uint64_t *s = (uint64_t *)(mem + SIZE_OFFSET);
  154. mem_usage.sub(*s);
  155. #endif
  156. free(mem);
  157. } else {
  158. free(mem);
  159. }
  160. }
  161. uint64_t Memory::get_mem_available() {
  162. return -1; // 0xFFFF...
  163. }
  164. uint64_t Memory::get_mem_usage() {
  165. #ifdef DEBUG_ENABLED
  166. return mem_usage.get();
  167. #else
  168. return 0;
  169. #endif
  170. }
  171. uint64_t Memory::get_mem_max_usage() {
  172. #ifdef DEBUG_ENABLED
  173. return max_usage.get();
  174. #else
  175. return 0;
  176. #endif
  177. }
  178. _GlobalNil::_GlobalNil() {
  179. left = this;
  180. right = this;
  181. parent = this;
  182. }
  183. _GlobalNil _GlobalNilClass::_nil;