multi_heap.c 9.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373
  1. /*
  2. * SPDX-FileCopyrightText: 2015-2021 Espressif Systems (Shanghai) CO LTD
  3. *
  4. * SPDX-License-Identifier: Apache-2.0
  5. */
  6. #include <stdint.h>
  7. #include <stdlib.h>
  8. #include <stdbool.h>
  9. #include <assert.h>
  10. #include <string.h>
  11. #include <stddef.h>
  12. #include <stdio.h>
  13. #include <sys/cdefs.h>
  14. #include "heap_tlsf.h"
  15. #include <multi_heap.h>
  16. #include "multi_heap_internal.h"
  17. /* Note: Keep platform-specific parts in this header, this source
  18. file should depend on libc only */
  19. #include "multi_heap_platform.h"
  20. /* Defines compile-time configuration macros */
  21. #include "multi_heap_config.h"
  22. #ifndef MULTI_HEAP_POISONING
  23. /* if no heap poisoning, public API aliases directly to these implementations */
  24. void *multi_heap_malloc(multi_heap_handle_t heap, size_t size)
  25. __attribute__((alias("multi_heap_malloc_impl")));
  26. void *multi_heap_aligned_alloc(multi_heap_handle_t heap, size_t size, size_t alignment)
  27. __attribute__((alias("multi_heap_aligned_alloc_impl")));
  28. void multi_heap_aligned_free(multi_heap_handle_t heap, void *p)
  29. __attribute__((alias("multi_heap_free_impl")));
  30. void multi_heap_free(multi_heap_handle_t heap, void *p)
  31. __attribute__((alias("multi_heap_free_impl")));
  32. void *multi_heap_realloc(multi_heap_handle_t heap, void *p, size_t size)
  33. __attribute__((alias("multi_heap_realloc_impl")));
  34. size_t multi_heap_get_allocated_size(multi_heap_handle_t heap, void *p)
  35. __attribute__((alias("multi_heap_get_allocated_size_impl")));
  36. multi_heap_handle_t multi_heap_register(void *start, size_t size)
  37. __attribute__((alias("multi_heap_register_impl")));
  38. void multi_heap_get_info(multi_heap_handle_t heap, multi_heap_info_t *info)
  39. __attribute__((alias("multi_heap_get_info_impl")));
  40. size_t multi_heap_free_size(multi_heap_handle_t heap)
  41. __attribute__((alias("multi_heap_free_size_impl")));
  42. size_t multi_heap_minimum_free_size(multi_heap_handle_t heap)
  43. __attribute__((alias("multi_heap_minimum_free_size_impl")));
  44. void *multi_heap_get_block_address(multi_heap_block_handle_t block)
  45. __attribute__((alias("multi_heap_get_block_address_impl")));
  46. void *multi_heap_get_block_owner(multi_heap_block_handle_t block)
  47. {
  48. return NULL;
  49. }
  50. #endif
  51. #define ALIGN(X) ((X) & ~(sizeof(void *)-1))
  52. #define ALIGN_UP(X) ALIGN((X)+sizeof(void *)-1)
  53. #define ALIGN_UP_BY(num, align) (((num) + ((align) - 1)) & ~((align) - 1))
  54. typedef struct multi_heap_info {
  55. void *lock;
  56. size_t free_bytes;
  57. size_t minimum_free_bytes;
  58. size_t pool_size;
  59. tlsf_t heap_data;
  60. } heap_t;
  61. /* Return true if this block is free. */
  62. static inline bool is_free(const block_header_t *block)
  63. {
  64. return ((block->size & 0x01) != 0);
  65. }
  66. /* Data size of the block (excludes this block's header) */
  67. static inline size_t block_data_size(const block_header_t *block)
  68. {
  69. return (block->size & ~0x03);
  70. }
  71. /* Check a block is valid for this heap. Used to verify parameters. */
  72. static void assert_valid_block(const heap_t *heap, const block_header_t *block)
  73. {
  74. pool_t pool = tlsf_get_pool(heap->heap_data);
  75. void *ptr = block_to_ptr(block);
  76. MULTI_HEAP_ASSERT((ptr >= pool) &&
  77. (ptr < pool + heap->pool_size),
  78. (uintptr_t)ptr);
  79. }
  80. void *multi_heap_get_block_address_impl(multi_heap_block_handle_t block)
  81. {
  82. void *ptr = block_to_ptr(block);
  83. return (ptr);
  84. }
  85. size_t multi_heap_get_allocated_size_impl(multi_heap_handle_t heap, void *p)
  86. {
  87. return tlsf_block_size(p);
  88. }
  89. multi_heap_handle_t multi_heap_register_impl(void *start_ptr, size_t size)
  90. {
  91. assert(start_ptr);
  92. if(size < (tlsf_size() + tlsf_block_size_min() + sizeof(heap_t))) {
  93. //Region too small to be a heap.
  94. return NULL;
  95. }
  96. heap_t *result = (heap_t *)start_ptr;
  97. size -= sizeof(heap_t);
  98. result->heap_data = tlsf_create_with_pool(start_ptr + sizeof(heap_t), size);
  99. if(!result->heap_data) {
  100. return NULL;
  101. }
  102. result->lock = NULL;
  103. result->free_bytes = size - tlsf_size();
  104. result->pool_size = size;
  105. result->minimum_free_bytes = result->free_bytes;
  106. return result;
  107. }
  108. void multi_heap_set_lock(multi_heap_handle_t heap, void *lock)
  109. {
  110. heap->lock = lock;
  111. }
  112. void inline multi_heap_internal_lock(multi_heap_handle_t heap)
  113. {
  114. MULTI_HEAP_LOCK(heap->lock);
  115. }
  116. void inline multi_heap_internal_unlock(multi_heap_handle_t heap)
  117. {
  118. MULTI_HEAP_UNLOCK(heap->lock);
  119. }
  120. multi_heap_block_handle_t multi_heap_get_first_block(multi_heap_handle_t heap)
  121. {
  122. assert(heap != NULL);
  123. pool_t pool = tlsf_get_pool(heap->heap_data);
  124. block_header_t* block = offset_to_block(pool, -(int)block_header_overhead);
  125. return (multi_heap_block_handle_t)block;
  126. }
  127. multi_heap_block_handle_t multi_heap_get_next_block(multi_heap_handle_t heap, multi_heap_block_handle_t block)
  128. {
  129. assert(heap != NULL);
  130. assert_valid_block(heap, block);
  131. block_header_t* next = block_next(block);
  132. if(block_data_size(next) == 0) {
  133. //Last block:
  134. return NULL;
  135. } else {
  136. return (multi_heap_block_handle_t)next;
  137. }
  138. }
  139. bool multi_heap_is_free(multi_heap_block_handle_t block)
  140. {
  141. return is_free(block);
  142. }
  143. void *multi_heap_malloc_impl(multi_heap_handle_t heap, size_t size)
  144. {
  145. if (size == 0 || heap == NULL) {
  146. return NULL;
  147. }
  148. multi_heap_internal_lock(heap);
  149. void *result = tlsf_malloc(heap->heap_data, size);
  150. if(result) {
  151. heap->free_bytes -= tlsf_block_size(result);
  152. if (heap->free_bytes < heap->minimum_free_bytes) {
  153. heap->minimum_free_bytes = heap->free_bytes;
  154. }
  155. }
  156. multi_heap_internal_unlock(heap);
  157. return result;
  158. }
  159. void multi_heap_free_impl(multi_heap_handle_t heap, void *p)
  160. {
  161. if (heap == NULL || p == NULL) {
  162. return;
  163. }
  164. assert_valid_block(heap, p);
  165. multi_heap_internal_lock(heap);
  166. heap->free_bytes += tlsf_block_size(p);
  167. tlsf_free(heap->heap_data, p);
  168. multi_heap_internal_unlock(heap);
  169. }
  170. void *multi_heap_realloc_impl(multi_heap_handle_t heap, void *p, size_t size)
  171. {
  172. assert(heap != NULL);
  173. if (p == NULL) {
  174. return multi_heap_malloc_impl(heap, size);
  175. }
  176. assert_valid_block(heap, p);
  177. if (heap == NULL) {
  178. return NULL;
  179. }
  180. multi_heap_internal_lock(heap);
  181. size_t previous_block_size = tlsf_block_size(p);
  182. void *result = tlsf_realloc(heap->heap_data, p, size);
  183. if(result) {
  184. heap->free_bytes += previous_block_size;
  185. heap->free_bytes -= tlsf_block_size(result);
  186. if (heap->free_bytes < heap->minimum_free_bytes) {
  187. heap->minimum_free_bytes = heap->free_bytes;
  188. }
  189. }
  190. multi_heap_internal_unlock(heap);
  191. return result;
  192. }
  193. void *multi_heap_aligned_alloc_impl_offs(multi_heap_handle_t heap, size_t size, size_t alignment, size_t offset)
  194. {
  195. if(heap == NULL) {
  196. return NULL;
  197. }
  198. if(!size) {
  199. return NULL;
  200. }
  201. //Alignment must be a power of two:
  202. if(((alignment & (alignment - 1)) != 0) ||(!alignment)) {
  203. return NULL;
  204. }
  205. multi_heap_internal_lock(heap);
  206. void *result = tlsf_memalign_offs(heap->heap_data, alignment, size, offset);
  207. if(result) {
  208. heap->free_bytes -= tlsf_block_size(result);
  209. if(heap->free_bytes < heap->minimum_free_bytes) {
  210. heap->minimum_free_bytes = heap->free_bytes;
  211. }
  212. }
  213. multi_heap_internal_unlock(heap);
  214. return result;
  215. }
  216. void *multi_heap_aligned_alloc_impl(multi_heap_handle_t heap, size_t size, size_t alignment)
  217. {
  218. return multi_heap_aligned_alloc_impl_offs(heap, size, alignment, 0);
  219. }
  220. bool multi_heap_check(multi_heap_handle_t heap, bool print_errors)
  221. {
  222. (void)print_errors;
  223. bool valid = true;
  224. assert(heap != NULL);
  225. multi_heap_internal_lock(heap);
  226. if(tlsf_check(heap->heap_data)) {
  227. valid = false;
  228. }
  229. if(tlsf_check_pool(tlsf_get_pool(heap->heap_data))) {
  230. valid = false;
  231. }
  232. multi_heap_internal_unlock(heap);
  233. return valid;
  234. }
  235. static void multi_heap_dump_tlsf(void* ptr, size_t size, int used, void* user)
  236. {
  237. (void)user;
  238. MULTI_HEAP_STDERR_PRINTF("Block %p data, size: %d bytes, Free: %s \n",
  239. (void *)ptr,
  240. size,
  241. used ? "No" : "Yes");
  242. }
  243. void multi_heap_dump(multi_heap_handle_t heap)
  244. {
  245. assert(heap != NULL);
  246. multi_heap_internal_lock(heap);
  247. MULTI_HEAP_STDERR_PRINTF("Showing data for heap: %p \n", (void *)heap);
  248. tlsf_walk_pool(tlsf_get_pool(heap->heap_data), multi_heap_dump_tlsf, NULL);
  249. multi_heap_internal_unlock(heap);
  250. }
  251. size_t multi_heap_free_size_impl(multi_heap_handle_t heap)
  252. {
  253. if (heap == NULL) {
  254. return 0;
  255. }
  256. return heap->free_bytes;
  257. }
  258. size_t multi_heap_minimum_free_size_impl(multi_heap_handle_t heap)
  259. {
  260. if (heap == NULL) {
  261. return 0;
  262. }
  263. return heap->minimum_free_bytes;
  264. }
  265. static void multi_heap_get_info_tlsf(void* ptr, size_t size, int used, void* user)
  266. {
  267. multi_heap_info_t *info = user;
  268. if(used) {
  269. info->allocated_blocks++;
  270. } else {
  271. info->free_blocks++;
  272. if(size > info->largest_free_block ) {
  273. info->largest_free_block = size;
  274. }
  275. }
  276. info->total_blocks++;
  277. }
  278. void multi_heap_get_info_impl(multi_heap_handle_t heap, multi_heap_info_t *info)
  279. {
  280. uint32_t sl_interval;
  281. memset(info, 0, sizeof(multi_heap_info_t));
  282. if (heap == NULL) {
  283. return;
  284. }
  285. multi_heap_internal_lock(heap);
  286. tlsf_walk_pool(tlsf_get_pool(heap->heap_data), multi_heap_get_info_tlsf, info);
  287. info->total_allocated_bytes = (heap->pool_size - tlsf_size()) - heap->free_bytes;
  288. info->minimum_free_bytes = heap->minimum_free_bytes;
  289. info->total_free_bytes = heap->free_bytes;
  290. if (info->largest_free_block) {
  291. sl_interval = (1 << (31 - __builtin_clz(info->largest_free_block))) / SL_INDEX_COUNT;
  292. info->largest_free_block = info->largest_free_block & ~(sl_interval - 1);
  293. }
  294. multi_heap_internal_unlock(heap);
  295. }