1
0

lwp_mem.c 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236
  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 <rtthread.h>
  25. #include <lwp.h>
  26. #define DBG_ENABLE
  27. #define DBG_SECTION_NAME "LWPMEM"
  28. #define DBG_COLOR
  29. #define DBG_LEVEL DBG_WARNING
  30. #include <rtdbg.h>
  31. // todo: remove repleat code
  32. #define RT_MEMHEAP_SIZE RT_ALIGN(sizeof(struct rt_lwp_memheap_item), RT_ALIGN_SIZE)
  33. #define MEMITEM_SIZE(item) ((rt_uint32_t)item->next - (rt_uint32_t)item - RT_MEMHEAP_SIZE)
  34. #ifndef LWP_MEM_PAGE_SIZE
  35. #define LWP_MEM_PAGE_SIZE (4 * 1024)
  36. #endif
  37. #ifndef LWP_MEM_MAX_PAGE_COUNT
  38. #define LWP_MEM_MAX_PAGE_COUNT (256 * 4)
  39. #endif
  40. static void *rt_lwp_malloc_page(struct rt_lwp *lwp, rt_size_t npages)
  41. {
  42. void *chunk;
  43. char name[6];
  44. struct rt_lwp_memheap *lwp_heap;
  45. rt_size_t page_cnt;
  46. RT_ASSERT(lwp != RT_NULL);
  47. page_cnt = lwp->heap_cnt + npages;
  48. if (page_cnt > LWP_MEM_MAX_PAGE_COUNT)
  49. {
  50. dbg_log(DBG_ERROR, "alloc new page failed, lwp memory size out of limited: %d\n", page_cnt);
  51. return RT_NULL;
  52. }
  53. lwp_heap = rt_malloc(sizeof(struct rt_lwp_memheap));
  54. if (lwp_heap == RT_NULL)
  55. {
  56. dbg_log(DBG_ERROR, "alloc new page head failed, out of memory : %d\n", page_cnt);
  57. return RT_NULL;
  58. }
  59. chunk = rt_malloc(npages * LWP_MEM_PAGE_SIZE);
  60. if (chunk == RT_NULL)
  61. {
  62. dbg_log(DBG_ERROR, "alloc new page buffer failed, out of memory : %d\n", page_cnt);
  63. rt_free(lwp_heap);
  64. return RT_NULL;
  65. }
  66. dbg_log(DBG_LOG, "lwp alloc page: %d\n", npages);
  67. rt_sprintf(name, "lwp%02x", lwp->heap_cnt);
  68. rt_lwp_memheap_init(lwp_heap, name, chunk, npages * LWP_MEM_PAGE_SIZE);
  69. rt_list_insert_before(&lwp->hlist, &lwp_heap->mlist);
  70. lwp->heap_cnt += npages;
  71. return chunk;
  72. }
  73. static void rt_lwp_free_page(struct rt_lwp *lwp, struct rt_lwp_memheap *lwp_heap)
  74. {
  75. rt_size_t npages;
  76. RT_ASSERT(lwp != RT_NULL);
  77. RT_ASSERT(lwp_heap != RT_NULL);
  78. RT_ASSERT(lwp_heap->start_addr != RT_NULL);
  79. npages = lwp_heap->pool_size / LWP_MEM_PAGE_SIZE;
  80. lwp->heap_cnt -= npages;
  81. dbg_log(DBG_LOG, "lwp free page: %d\n", npages);
  82. rt_list_remove(&lwp_heap->mlist);
  83. rt_free(lwp_heap->start_addr);
  84. rt_free(lwp_heap);
  85. }
  86. void rt_lwp_mem_init(struct rt_lwp *lwp)
  87. {
  88. RT_ASSERT(lwp != RT_NULL);
  89. rt_list_init(&lwp->hlist);
  90. }
  91. void rt_lwp_mem_deinit(struct rt_lwp *lwp)
  92. {
  93. struct rt_list_node *node;
  94. RT_ASSERT(lwp != RT_NULL);
  95. node = lwp->hlist.next;
  96. while (node != &(lwp->hlist))
  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. /* update note before free page*/
  102. node = node->next;
  103. rt_lwp_free_page(lwp, lwp_heap);
  104. }
  105. }
  106. void *rt_lwp_mem_malloc(rt_uint32_t size)
  107. {
  108. struct rt_lwp *lwp;
  109. struct rt_list_node *node;
  110. void *addr = RT_NULL;
  111. rt_uint32_t npages;
  112. if (size == 0)
  113. return RT_NULL;
  114. lwp = rt_lwp_self();
  115. RT_ASSERT(lwp != RT_NULL);
  116. for (node = lwp->hlist.next; node != &(lwp->hlist); node = node->next)
  117. {
  118. struct rt_lwp_memheap *lwp_heap;
  119. lwp_heap = rt_list_entry(node, struct rt_lwp_memheap, mlist);
  120. addr = rt_lwp_memheap_alloc(lwp_heap, size);
  121. if (addr != RT_NULL)
  122. {
  123. dbg_log(DBG_LOG, "lwp alloc 0x%x/%d\n", addr, size);
  124. return addr;
  125. }
  126. }
  127. npages = (size + rt_lwp_memheap_unavailable_size_get() + LWP_MEM_PAGE_SIZE) / LWP_MEM_PAGE_SIZE;
  128. if (RT_NULL != rt_lwp_malloc_page(lwp, npages))
  129. return rt_lwp_mem_malloc(size);
  130. else
  131. return RT_NULL;
  132. }
  133. void rt_lwp_mem_free(void *addr)
  134. {
  135. struct rt_lwp_memheap_item *header_ptr;
  136. struct rt_lwp_memheap *lwp_heap;
  137. if (addr == RT_NULL)
  138. return ;
  139. /* get memory item */
  140. header_ptr = (struct rt_lwp_memheap_item *)((rt_uint8_t *)addr - RT_MEMHEAP_SIZE);
  141. RT_ASSERT(header_ptr);
  142. lwp_heap = header_ptr->pool_ptr;
  143. RT_ASSERT(lwp_heap);
  144. dbg_log(DBG_LOG, "lwp free 0x%x\n", addr);
  145. rt_lwp_memheap_free((void *)addr);
  146. if (rt_lwp_memheap_is_empty(lwp_heap))
  147. {
  148. rt_lwp_free_page(rt_lwp_self(), lwp_heap);
  149. }
  150. }
  151. void *rt_lwp_mem_realloc(void *rmem, rt_size_t newsize)
  152. {
  153. void *new_ptr;
  154. struct rt_lwp_memheap_item *header_ptr;
  155. if (rmem == RT_NULL)
  156. return rt_lwp_mem_malloc(newsize);
  157. if (newsize == 0)
  158. {
  159. rt_lwp_mem_free(rmem);
  160. return RT_NULL;
  161. }
  162. /* get old memory item */
  163. header_ptr = (struct rt_lwp_memheap_item *)
  164. ((rt_uint8_t *)rmem - RT_MEMHEAP_SIZE);
  165. new_ptr = rt_lwp_memheap_realloc(header_ptr->pool_ptr, rmem, newsize);
  166. if (new_ptr == RT_NULL)
  167. {
  168. /* allocate memory block from other memheap */
  169. new_ptr = rt_lwp_mem_malloc(newsize);
  170. if (new_ptr != RT_NULL && rmem != RT_NULL)
  171. {
  172. rt_size_t oldsize;
  173. /* get the size of old memory block */
  174. oldsize = MEMITEM_SIZE(header_ptr);
  175. if (newsize > oldsize)
  176. rt_memcpy(new_ptr, rmem, oldsize);
  177. else
  178. rt_memcpy(new_ptr, rmem, newsize);
  179. dbg_log(DBG_LOG, "lwp realloc with memcpy 0x%x -> 0x%x/%d\n", rmem, new_ptr, newsize);
  180. rt_lwp_mem_free(rmem);
  181. }
  182. }
  183. dbg_log(DBG_LOG, "lwp realloc in same address 0x%x/%d\n", rmem, newsize);
  184. return new_ptr;
  185. }