page.c 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347
  1. /*
  2. * Copyright (c) 2006-2019, RT-Thread Development Team
  3. *
  4. * SPDX-License-Identifier: Apache-2.0
  5. *
  6. * Change Logs:
  7. * Date Author Notes
  8. * 2019-11-01 Jesven The first version
  9. */
  10. #include <stdint.h>
  11. #include <rthw.h>
  12. #include <rtthread.h>
  13. #ifdef RT_USING_USERSPACE
  14. #include <page.h>
  15. #include <mmu.h>
  16. #define ARCH_PAGE_LIST_SIZE (ARCH_ADDRESS_WIDTH_BITS - ARCH_PAGE_SHIFT)
  17. #define DBG_TAG "PAGE"
  18. #define DBG_LVL DBG_WARNING
  19. #include <rtdbg.h>
  20. struct page
  21. {
  22. struct page *next; /* same level next */
  23. struct page *pre; /* same level pre */
  24. uint32_t size_bits; /* if is ARCH_ADDRESS_WIDTH_BITS, means not free */
  25. int ref_cnt; /* page group ref count */
  26. };
  27. static struct page* page_start;
  28. static void* page_addr;
  29. static size_t page_nr;
  30. static struct page *page_list[ARCH_PAGE_LIST_SIZE];
  31. size_t rt_page_bits(size_t size)
  32. {
  33. int bit;
  34. bit = __builtin_clz(size);
  35. bit = (31 - bit);
  36. if ((size ^ (1UL << bit)) != 0)
  37. {
  38. bit++;
  39. }
  40. bit -= ARCH_PAGE_SHIFT;
  41. if (bit < 0)
  42. {
  43. bit = 0;
  44. }
  45. return bit;
  46. }
  47. static struct page * addr_to_page(void *addr)
  48. {
  49. size_t off;
  50. if (addr < page_addr)
  51. {
  52. return 0;
  53. }
  54. off = (size_t)((char*)addr - (char*)page_addr);
  55. off >>= ARCH_PAGE_SHIFT;
  56. if (off >= page_nr)
  57. {
  58. return 0;
  59. }
  60. return &page_start[off];
  61. }
  62. static void* page_to_addr(struct page* p)
  63. {
  64. if (!p)
  65. {
  66. return 0;
  67. }
  68. return (void*)((char*)page_addr + ((p - page_start) << ARCH_PAGE_SHIFT));
  69. }
  70. static inline struct page *buddy_get(struct page *p, uint32_t size_bits)
  71. {
  72. size_t addr;
  73. addr = (size_t)page_to_addr(p);
  74. addr ^= (1UL << (size_bits + ARCH_PAGE_SHIFT));
  75. return addr_to_page((void*)addr);
  76. }
  77. static void page_remove(struct page *p, uint32_t size_bits)
  78. {
  79. if (p->pre)
  80. {
  81. p->pre->next = p->next;
  82. }
  83. else
  84. {
  85. page_list[size_bits] = p->next;
  86. }
  87. if (p->next)
  88. {
  89. p->next->pre = p->pre;
  90. }
  91. p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  92. }
  93. static void page_insert(struct page *p, uint32_t size_bits)
  94. {
  95. p->next = page_list[size_bits];
  96. if (p->next)
  97. {
  98. p->next->pre = p;
  99. }
  100. p->pre = 0;
  101. page_list[size_bits] = p;
  102. p->size_bits = size_bits;
  103. }
  104. static void _pages_ref_inc(struct page *p, uint32_t size_bits)
  105. {
  106. struct page *page_head;
  107. int idx;
  108. /* find page group head */
  109. idx = p - page_start;
  110. if (idx < 0 || idx >= page_nr)
  111. {
  112. return;
  113. }
  114. idx = idx & ~((1UL << size_bits) - 1);
  115. page_head = page_start + idx;
  116. page_head->ref_cnt++;
  117. }
  118. static int _pages_free(struct page *p, uint32_t size_bits)
  119. {
  120. uint32_t level = size_bits;
  121. uint32_t high = ARCH_ADDRESS_WIDTH_BITS - size_bits - 1;
  122. struct page *buddy;
  123. RT_ASSERT(p->ref_cnt > 0);
  124. p->ref_cnt--;
  125. if (p->ref_cnt != 0)
  126. {
  127. return 0;
  128. }
  129. while (level < high)
  130. {
  131. buddy = buddy_get(p, level);
  132. if (buddy && buddy->size_bits == level)
  133. {
  134. page_remove(buddy, level);
  135. p = (p < buddy) ? p : buddy;
  136. level++;
  137. }
  138. else
  139. {
  140. break;
  141. }
  142. }
  143. page_insert(p, level);
  144. return 1;
  145. }
  146. static struct page *_pages_alloc(uint32_t size_bits)
  147. {
  148. struct page *p;
  149. if (page_list[size_bits])
  150. {
  151. p = page_list[size_bits];
  152. page_remove(p, size_bits);
  153. }
  154. else
  155. {
  156. uint32_t level;
  157. uint32_t high = ARCH_ADDRESS_WIDTH_BITS - size_bits - 1;
  158. for (level = size_bits + 1; level <= high; level++)
  159. {
  160. if (page_list[level])
  161. {
  162. break;
  163. }
  164. }
  165. if (level == high + 1)
  166. {
  167. return 0;
  168. }
  169. p = page_list[level];
  170. page_remove(p, level);
  171. while (level > size_bits)
  172. {
  173. page_insert(p, level - 1);
  174. p = buddy_get(p, level - 1);
  175. level--;
  176. }
  177. }
  178. p->ref_cnt = 1;
  179. return p;
  180. }
  181. void rt_page_ref_inc(void *addr, uint32_t size_bits)
  182. {
  183. struct page *p;
  184. rt_base_t level;
  185. p = addr_to_page(addr);
  186. level = rt_hw_interrupt_disable();
  187. _pages_ref_inc(p, size_bits);
  188. rt_hw_interrupt_enable(level);
  189. }
  190. void *rt_pages_alloc(uint32_t size_bits)
  191. {
  192. struct page *p;
  193. rt_base_t level;
  194. level = rt_hw_interrupt_disable();
  195. p = _pages_alloc(size_bits);
  196. rt_hw_interrupt_enable(level);
  197. return page_to_addr(p);
  198. }
  199. int rt_pages_free(void *addr, uint32_t size_bits)
  200. {
  201. struct page *p;
  202. int real_free = 0;
  203. p = addr_to_page(addr);
  204. if (p)
  205. {
  206. rt_base_t level;
  207. level = rt_hw_interrupt_disable();
  208. real_free = _pages_free(p, size_bits);
  209. rt_hw_interrupt_enable(level);
  210. }
  211. return real_free;
  212. }
  213. void rt_pageinfo_dump(void)
  214. {
  215. int i;
  216. size_t total = 0;
  217. rt_base_t level;
  218. level = rt_hw_interrupt_disable();
  219. for (i = 0; i < ARCH_PAGE_LIST_SIZE; i++)
  220. {
  221. struct page *p = page_list[i];
  222. rt_kprintf("level %d ", i);
  223. while (p)
  224. {
  225. total += (1UL << i);
  226. rt_kprintf("[0x%08x]", page_to_addr(p));
  227. p = p->next;
  228. }
  229. rt_kprintf("\n");
  230. }
  231. rt_hw_interrupt_enable(level);
  232. rt_kprintf("free pages is %08x\n", total);
  233. rt_kprintf("-------------------------------\n");
  234. }
  235. MSH_CMD_EXPORT(rt_pageinfo_dump, show page info);
  236. void rt_page_get_info(size_t *total_nr, size_t *free_nr)
  237. {
  238. int i;
  239. size_t total_free = 0;
  240. rt_base_t level;
  241. level = rt_hw_interrupt_disable();
  242. for (i = 0; i < ARCH_PAGE_LIST_SIZE; i++)
  243. {
  244. struct page *p = page_list[i];
  245. while (p)
  246. {
  247. total_free += (1UL << i);
  248. p = p->next;
  249. }
  250. }
  251. rt_hw_interrupt_enable(level);
  252. *total_nr = page_nr;
  253. *free_nr = total_free;
  254. }
  255. void rt_page_init(rt_region_t reg)
  256. {
  257. int i;
  258. LOG_D("split 0x%08x 0x%08x\n", reg.start, reg.end);
  259. reg.start += ARCH_PAGE_MASK;
  260. reg.start &= ~ARCH_PAGE_MASK;
  261. reg.end &= ~ARCH_PAGE_MASK;
  262. {
  263. int nr = ARCH_PAGE_SIZE / sizeof(struct page);
  264. int total = (reg.end - reg.start) >> ARCH_PAGE_SHIFT;
  265. int mnr = (total + nr) / (nr + 1);
  266. LOG_D("nr = 0x%08x\n", nr);
  267. LOG_D("total = 0x%08x\n", total);
  268. LOG_D("mnr = 0x%08x\n", mnr);
  269. page_start = (struct page*)reg.start;
  270. reg.start += (mnr << ARCH_PAGE_SHIFT);
  271. page_addr = (void*)reg.start;
  272. page_nr = (reg.end - reg.start) >> ARCH_PAGE_SHIFT;
  273. }
  274. LOG_D("align 0x%08x 0x%08x\n", reg.start, reg.end);
  275. /* init free list */
  276. for (i = 0; i < ARCH_PAGE_LIST_SIZE; i++)
  277. {
  278. page_list[i] = 0;
  279. }
  280. /* init page struct */
  281. for (i = 0; i < page_nr; i++)
  282. {
  283. page_start[i].size_bits = ARCH_ADDRESS_WIDTH_BITS;
  284. page_start[i].ref_cnt = 1;
  285. }
  286. /* add to free list */
  287. for (i = 0; i < page_nr; i++)
  288. {
  289. _pages_free(page_start + i, 0);
  290. }
  291. }
  292. #endif