lwp_mem.c 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232
  1. /*
  2. * File : lwp_mem.c
  3. * This file is part of RT-Thread RTOS
  4. * COPYRIGHT (C) 2012, RT-Thread Development Team
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation; either version 2 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License along
  17. * with this program; if not, write to the Free Software Foundation, Inc.,
  18. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  19. *
  20. * Change Logs:
  21. * Date Author Notes
  22. * 2018-03-24 Tanek the first version
  23. */
  24. #include <stdio.h>
  25. #include <rtthread.h>
  26. #include <lwp.h>
  27. #define DBG_ENABLE
  28. #define DBG_SECTION_NAME "[LWPMEM]"
  29. #define DBG_COLOR
  30. #define DBG_LEVEL DBG_LOG
  31. #include <rtdbg.h>
  32. // todo: remove repleat code
  33. #define RT_MEMHEAP_SIZE RT_ALIGN(sizeof(struct rt_lwp_memheap_item), RT_ALIGN_SIZE)
  34. #define MEMITEM_SIZE(item) ((rt_uint32_t)item->next - (rt_uint32_t)item - RT_MEMHEAP_SIZE)
  35. #ifndef LWP_MEM_PAGE_SIZE
  36. #define LWP_MEM_PAGE_SIZE (4 * 1024)
  37. #endif
  38. #ifndef LWP_MEM_MAX_PAGE_COUNT
  39. #define LWP_MEM_MAX_PAGE_COUNT (256 * 4)
  40. #endif
  41. static void *rt_lwp_malloc_page(struct rt_lwp *lwp, rt_size_t npages)
  42. {
  43. void *chunk;
  44. char name[6];
  45. struct rt_lwp_memheap *lwp_heap;
  46. rt_size_t page_cnt;
  47. RT_ASSERT(lwp != RT_NULL);
  48. page_cnt = lwp->heap_cnt + npages;
  49. if (page_cnt > LWP_MEM_MAX_PAGE_COUNT)
  50. {
  51. dbg_log(DBG_ERROR, "alloc new page failed, lwp memory size out of limited: %d\n", page_cnt);
  52. return RT_NULL;
  53. }
  54. lwp_heap = rt_malloc(sizeof(struct rt_lwp_memheap));
  55. if (lwp_heap == RT_NULL)
  56. {
  57. dbg_log(DBG_ERROR, "alloc new page head failed, out of memory : %d\n", page_cnt);
  58. return RT_NULL;
  59. }
  60. chunk = rt_malloc(npages * LWP_MEM_PAGE_SIZE);
  61. if (chunk == RT_NULL)
  62. {
  63. dbg_log(DBG_ERROR, "alloc new page buffer failed, out of memory : %d\n", page_cnt);
  64. rt_free(lwp_heap);
  65. return RT_NULL;
  66. }
  67. dbg_log(DBG_LOG, "lwp alloc page: %d\n", npages);
  68. sprintf(name, "lwp%02x", lwp->heap_cnt);
  69. rt_lwp_memheap_init(lwp_heap, name, chunk, npages * LWP_MEM_PAGE_SIZE);
  70. rt_list_insert_before(&lwp->hlist, &lwp_heap->mlist);
  71. lwp->heap_cnt += npages;
  72. return chunk;
  73. }
  74. static void rt_lwp_free_page(struct rt_lwp *lwp, struct rt_lwp_memheap *lwp_heap)
  75. {
  76. rt_size_t npages;
  77. RT_ASSERT(lwp != RT_NULL);
  78. RT_ASSERT(lwp_heap != RT_NULL);
  79. RT_ASSERT(lwp_heap->start_addr != RT_NULL);
  80. npages = lwp_heap->pool_size / LWP_MEM_PAGE_SIZE;
  81. lwp->heap_cnt -= npages;
  82. dbg_log(DBG_LOG, "lwp free page: %d\n", npages);
  83. rt_list_remove(&lwp_heap->mlist);
  84. rt_free(lwp_heap->start_addr);
  85. rt_free(lwp_heap);
  86. }
  87. void rt_lwp_mem_init(struct rt_lwp *lwp)
  88. {
  89. RT_ASSERT(lwp != RT_NULL);
  90. rt_list_init(&lwp->hlist);
  91. }
  92. void rt_lwp_mem_deinit(struct rt_lwp *lwp)
  93. {
  94. struct rt_list_node *node;
  95. RT_ASSERT(lwp != RT_NULL);
  96. for (node = lwp->hlist.next; node != &(lwp->hlist); node = node->next)
  97. {
  98. struct rt_lwp_memheap *lwp_heap;
  99. lwp_heap = rt_list_entry(node, struct rt_lwp_memheap, mlist);
  100. RT_ASSERT(lwp_heap != RT_NULL);
  101. rt_lwp_free_page(lwp, lwp_heap);
  102. }
  103. }
  104. void *rt_lwp_mem_malloc(rt_uint32_t size)
  105. {
  106. struct rt_lwp *lwp;
  107. struct rt_list_node *node;
  108. void *addr = RT_NULL;
  109. rt_uint32_t npages;
  110. if (size == 0)
  111. return RT_NULL;
  112. lwp = rt_lwp_self();
  113. RT_ASSERT(lwp != RT_NULL);
  114. for (node = lwp->hlist.next; node != &(lwp->hlist); node = node->next)
  115. {
  116. struct rt_lwp_memheap *lwp_heap;
  117. lwp_heap = rt_list_entry(node, struct rt_lwp_memheap, mlist);
  118. addr = rt_lwp_memheap_alloc(lwp_heap, size);
  119. if (addr != RT_NULL)
  120. {
  121. dbg_log(DBG_LOG, "lwp alloc 0x%x/%d\n", addr, size);
  122. return addr;
  123. }
  124. }
  125. npages = (size + rt_lwp_memheap_unavailable_size_get() + LWP_MEM_PAGE_SIZE) / LWP_MEM_PAGE_SIZE;
  126. if (RT_NULL != rt_lwp_malloc_page(lwp, npages))
  127. return rt_lwp_mem_malloc(size);
  128. else
  129. return RT_NULL;
  130. }
  131. void rt_lwp_mem_free(void *addr)
  132. {
  133. struct rt_lwp_memheap_item *header_ptr;
  134. struct rt_lwp_memheap *lwp_heap;
  135. if (addr == RT_NULL)
  136. return ;
  137. /* get memory item */
  138. header_ptr = (struct rt_lwp_memheap_item *)((rt_uint8_t *)addr - RT_MEMHEAP_SIZE);
  139. RT_ASSERT(header_ptr);
  140. lwp_heap = header_ptr->pool_ptr;
  141. RT_ASSERT(lwp_heap);
  142. dbg_log(DBG_LOG, "lwp free 0x%x\n", addr);
  143. rt_lwp_memheap_free((void *)addr);
  144. if (rt_lwp_memheap_is_empty(lwp_heap))
  145. {
  146. rt_lwp_free_page(rt_lwp_self(), lwp_heap);
  147. }
  148. }
  149. void *rt_lwp_mem_realloc(void *rmem, rt_size_t newsize)
  150. {
  151. void *new_ptr;
  152. struct rt_lwp_memheap_item *header_ptr;
  153. if (rmem == RT_NULL)
  154. return rt_lwp_mem_malloc(newsize);
  155. if (newsize == 0)
  156. {
  157. rt_lwp_mem_free(rmem);
  158. return RT_NULL;
  159. }
  160. /* get old memory item */
  161. header_ptr = (struct rt_lwp_memheap_item *)
  162. ((rt_uint8_t *)rmem - RT_MEMHEAP_SIZE);
  163. new_ptr = rt_lwp_memheap_realloc(header_ptr->pool_ptr, rmem, newsize);
  164. if (new_ptr == RT_NULL)
  165. {
  166. /* allocate memory block from other memheap */
  167. new_ptr = rt_lwp_mem_malloc(newsize);
  168. if (new_ptr != RT_NULL && rmem != RT_NULL)
  169. {
  170. rt_size_t oldsize;
  171. /* get the size of old memory block */
  172. oldsize = MEMITEM_SIZE(header_ptr);
  173. if (newsize > oldsize)
  174. rt_memcpy(new_ptr, rmem, oldsize);
  175. else
  176. rt_memcpy(new_ptr, rmem, newsize);
  177. dbg_log(DBG_LOG, "lwp realloc with memcpy 0x%x -> 0x%x/%d\n", rmem, new_ptr, newsize);
  178. rt_lwp_mem_free(rmem);
  179. }
  180. }
  181. dbg_log(DBG_LOG, "lwp realloc in same address 0x%x/%d\n", rmem, newsize);
  182. return new_ptr;
  183. }