page.c 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424
  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. RT_WEAK int rt_hw_clz(size_t n)
  32. {
  33. int bits = sizeof(size_t) * 8;
  34. n |= (n >> 1);
  35. n |= (n >> 2);
  36. n |= (n >> 4);
  37. n |= (n >> 8);
  38. n |= (n >> 16);
  39. #ifdef ARCH_CPU_64BIT
  40. n |= (n >> 32);
  41. n = (n & 0x5555555555555555UL) + ((n >> 1) & 0x5555555555555555UL);
  42. n = (n & 0x3333333333333333UL) + ((n >> 2) & 0x3333333333333333UL);
  43. n = (n & 0x0707070707070707UL) + ((n >> 4) & 0x0707070707070707UL);
  44. n = (n & 0x000f000f000f000fUL) + ((n >> 8) & 0x000f000f000f000fUL);
  45. n = (n & 0x0000001f0000001fUL) + ((n >> 16) & 0x0000001f0000001fUL);
  46. n = (n & 0x000000000000003fUL) + ((n >> 32) & 0x000000000000003fUL);
  47. #else
  48. n = (n & 0x55555555UL) + ((n >> 1) & 0x55555555UL);
  49. n = (n & 0x33333333UL) + ((n >> 2) & 0x33333333UL);
  50. n = (n & 0x07070707UL) + ((n >> 4) & 0x07070707UL);
  51. n = (n & 0x000f000fUL) + ((n >> 8) & 0x000f000fUL);
  52. n = (n & 0x0000001fUL) + ((n >> 16) & 0x0000001fUL);
  53. #endif
  54. return bits - n;
  55. }
  56. RT_WEAK int rt_hw_ctz(size_t n)
  57. {
  58. int ret = sizeof(size_t) * 8;
  59. if (n)
  60. {
  61. ret -= (rt_hw_clz(n ^ (n - 1)) + 1);
  62. }
  63. return ret;
  64. }
  65. size_t rt_page_bits(size_t size)
  66. {
  67. int bit = sizeof(size_t) * 8 - rt_hw_clz(size) - 1;
  68. if ((size ^ (1UL << bit)) != 0)
  69. {
  70. bit++;
  71. }
  72. bit -= ARCH_PAGE_SHIFT;
  73. if (bit < 0)
  74. {
  75. bit = 0;
  76. }
  77. return bit;
  78. }
  79. static struct page * addr_to_page(void *addr)
  80. {
  81. size_t off;
  82. if (addr < page_addr)
  83. {
  84. return 0;
  85. }
  86. off = (size_t)((char*)addr - (char*)page_addr);
  87. off >>= ARCH_PAGE_SHIFT;
  88. if (off >= page_nr)
  89. {
  90. return 0;
  91. }
  92. return &page_start[off];
  93. }
  94. static void* page_to_addr(struct page* p)
  95. {
  96. if (!p)
  97. {
  98. return 0;
  99. }
  100. return (void*)((char*)page_addr + ((p - page_start) << ARCH_PAGE_SHIFT));
  101. }
  102. static inline struct page *buddy_get(struct page *p, uint32_t size_bits)
  103. {
  104. size_t addr;
  105. addr = (size_t)page_to_addr(p);
  106. addr ^= (1UL << (size_bits + ARCH_PAGE_SHIFT));
  107. return addr_to_page((void*)addr);
  108. }
  109. static void page_remove(struct page *p, uint32_t size_bits)
  110. {
  111. if (p->pre)
  112. {
  113. p->pre->next = p->next;
  114. }
  115. else
  116. {
  117. page_list[size_bits] = p->next;
  118. }
  119. if (p->next)
  120. {
  121. p->next->pre = p->pre;
  122. }
  123. p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  124. }
  125. static void page_insert(struct page *p, uint32_t size_bits)
  126. {
  127. p->next = page_list[size_bits];
  128. if (p->next)
  129. {
  130. p->next->pre = p;
  131. }
  132. p->pre = 0;
  133. page_list[size_bits] = p;
  134. p->size_bits = size_bits;
  135. }
  136. static void _pages_ref_inc(struct page *p, uint32_t size_bits)
  137. {
  138. struct page *page_head;
  139. int idx;
  140. /* find page group head */
  141. idx = p - page_start;
  142. if (idx < 0 || idx >= page_nr)
  143. {
  144. return;
  145. }
  146. idx = idx & ~((1UL << size_bits) - 1);
  147. page_head = page_start + idx;
  148. page_head->ref_cnt++;
  149. }
  150. static int _pages_ref_get(struct page *p, uint32_t size_bits)
  151. {
  152. struct page *page_head;
  153. int idx;
  154. /* find page group head */
  155. idx = p - page_start;
  156. if (idx < 0 || idx >= page_nr)
  157. {
  158. return 0;
  159. }
  160. idx = idx & ~((1UL << size_bits) - 1);
  161. page_head = page_start + idx;
  162. return page_head->ref_cnt;
  163. }
  164. static int _pages_free(struct page *p, uint32_t size_bits)
  165. {
  166. uint32_t level = size_bits;
  167. struct page *buddy;
  168. RT_ASSERT(p->ref_cnt > 0);
  169. RT_ASSERT(p->size_bits == ARCH_ADDRESS_WIDTH_BITS);
  170. p->ref_cnt--;
  171. if (p->ref_cnt != 0)
  172. {
  173. return 0;
  174. }
  175. while (level < ARCH_PAGE_LIST_SIZE)
  176. {
  177. buddy = buddy_get(p, level);
  178. if (buddy && buddy->size_bits == level)
  179. {
  180. page_remove(buddy, level);
  181. p = (p < buddy) ? p : buddy;
  182. level++;
  183. }
  184. else
  185. {
  186. break;
  187. }
  188. }
  189. page_insert(p, level);
  190. return 1;
  191. }
  192. static struct page *_pages_alloc(uint32_t size_bits)
  193. {
  194. struct page *p;
  195. if (page_list[size_bits])
  196. {
  197. p = page_list[size_bits];
  198. page_remove(p, size_bits);
  199. }
  200. else
  201. {
  202. uint32_t level;
  203. for (level = size_bits + 1; level < ARCH_PAGE_LIST_SIZE; level++)
  204. {
  205. if (page_list[level])
  206. {
  207. break;
  208. }
  209. }
  210. if (level == ARCH_PAGE_LIST_SIZE)
  211. {
  212. return 0;
  213. }
  214. p = page_list[level];
  215. page_remove(p, level);
  216. while (level > size_bits)
  217. {
  218. page_insert(p, level - 1);
  219. p = buddy_get(p, level - 1);
  220. level--;
  221. }
  222. }
  223. p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  224. p->ref_cnt = 1;
  225. return p;
  226. }
  227. int rt_page_ref_get(void *addr, uint32_t size_bits)
  228. {
  229. struct page *p;
  230. rt_base_t level;
  231. int ref;
  232. p = addr_to_page(addr);
  233. level = rt_hw_interrupt_disable();
  234. ref = _pages_ref_get(p, size_bits);
  235. rt_hw_interrupt_enable(level);
  236. return ref;
  237. }
  238. void rt_page_ref_inc(void *addr, uint32_t size_bits)
  239. {
  240. struct page *p;
  241. rt_base_t level;
  242. p = addr_to_page(addr);
  243. level = rt_hw_interrupt_disable();
  244. _pages_ref_inc(p, size_bits);
  245. rt_hw_interrupt_enable(level);
  246. }
  247. void *rt_pages_alloc(uint32_t size_bits)
  248. {
  249. struct page *p;
  250. rt_base_t level;
  251. level = rt_hw_interrupt_disable();
  252. p = _pages_alloc(size_bits);
  253. rt_hw_interrupt_enable(level);
  254. return page_to_addr(p);
  255. }
  256. int rt_pages_free(void *addr, uint32_t size_bits)
  257. {
  258. struct page *p;
  259. int real_free = 0;
  260. p = addr_to_page(addr);
  261. if (p)
  262. {
  263. rt_base_t level;
  264. level = rt_hw_interrupt_disable();
  265. real_free = _pages_free(p, size_bits);
  266. rt_hw_interrupt_enable(level);
  267. }
  268. return real_free;
  269. }
  270. void list_page(void)
  271. {
  272. int i;
  273. size_t total = 0;
  274. rt_base_t level;
  275. level = rt_hw_interrupt_disable();
  276. for (i = 0; i < ARCH_PAGE_LIST_SIZE; i++)
  277. {
  278. struct page *p = page_list[i];
  279. rt_kprintf("level %d ", i);
  280. while (p)
  281. {
  282. total += (1UL << i);
  283. rt_kprintf("[0x%08p]", page_to_addr(p));
  284. p = p->next;
  285. }
  286. rt_kprintf("\n");
  287. }
  288. rt_hw_interrupt_enable(level);
  289. rt_kprintf("free pages is %08x\n", total);
  290. rt_kprintf("-------------------------------\n");
  291. }
  292. MSH_CMD_EXPORT(list_page, show page info);
  293. void rt_page_get_info(size_t *total_nr, size_t *free_nr)
  294. {
  295. int i;
  296. size_t total_free = 0;
  297. rt_base_t level;
  298. level = rt_hw_interrupt_disable();
  299. for (i = 0; i < ARCH_PAGE_LIST_SIZE; i++)
  300. {
  301. struct page *p = page_list[i];
  302. while (p)
  303. {
  304. total_free += (1UL << i);
  305. p = p->next;
  306. }
  307. }
  308. rt_hw_interrupt_enable(level);
  309. *total_nr = page_nr;
  310. *free_nr = total_free;
  311. }
  312. void rt_page_init(rt_region_t reg)
  313. {
  314. int i;
  315. LOG_D("split 0x%08x 0x%08x\n", reg.start, reg.end);
  316. reg.start += ARCH_PAGE_MASK;
  317. reg.start &= ~ARCH_PAGE_MASK;
  318. reg.end &= ~ARCH_PAGE_MASK;
  319. {
  320. int nr = ARCH_PAGE_SIZE / sizeof(struct page);
  321. int total = (reg.end - reg.start) >> ARCH_PAGE_SHIFT;
  322. int mnr = (total + nr) / (nr + 1);
  323. LOG_D("nr = 0x%08x\n", nr);
  324. LOG_D("total = 0x%08x\n", total);
  325. LOG_D("mnr = 0x%08x\n", mnr);
  326. RT_ASSERT(mnr < total);
  327. page_start = (struct page*)reg.start;
  328. reg.start += (mnr << ARCH_PAGE_SHIFT);
  329. page_addr = (void*)reg.start;
  330. page_nr = (reg.end - reg.start) >> ARCH_PAGE_SHIFT;
  331. }
  332. LOG_D("align 0x%08x 0x%08x\n", reg.start, reg.end);
  333. /* init free list */
  334. for (i = 0; i < ARCH_PAGE_LIST_SIZE; i++)
  335. {
  336. page_list[i] = 0;
  337. }
  338. /* add pages to free list */
  339. while (reg.start != reg.end)
  340. {
  341. struct page *p;
  342. int align_bits;
  343. int size_bits;
  344. size_bits = ARCH_ADDRESS_WIDTH_BITS - 1 - rt_hw_clz(reg.end - reg.start);
  345. align_bits = rt_hw_ctz(reg.start);
  346. if (align_bits < size_bits)
  347. {
  348. size_bits = align_bits;
  349. }
  350. p = addr_to_page((void*)reg.start);
  351. p->size_bits = ARCH_ADDRESS_WIDTH_BITS;
  352. p->ref_cnt = 1;
  353. _pages_free(p, size_bits - ARCH_PAGE_SHIFT);
  354. reg.start += (1UL << size_bits);
  355. }
  356. }
  357. #endif