hugetlb_cma.c 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. #include <linux/mm.h>
  3. #include <linux/cma.h>
  4. #include <linux/compiler.h>
  5. #include <linux/mm_inline.h>
  6. #include <asm/page.h>
  7. #include <asm/setup.h>
  8. #include <linux/hugetlb.h>
  9. #include "internal.h"
  10. #include "hugetlb_cma.h"
  11. static struct cma *hugetlb_cma[MAX_NUMNODES] __ro_after_init;
  12. static unsigned long hugetlb_cma_size_in_node[MAX_NUMNODES] __initdata;
  13. static bool hugetlb_cma_only __ro_after_init;
  14. static unsigned long hugetlb_cma_size __ro_after_init;
  15. void hugetlb_cma_free_frozen_folio(struct folio *folio)
  16. {
  17. WARN_ON_ONCE(!cma_release_frozen(hugetlb_cma[folio_nid(folio)],
  18. &folio->page, folio_nr_pages(folio)));
  19. }
  20. struct folio *hugetlb_cma_alloc_frozen_folio(int order, gfp_t gfp_mask,
  21. int nid, nodemask_t *nodemask)
  22. {
  23. int node;
  24. struct folio *folio;
  25. struct page *page = NULL;
  26. if (!hugetlb_cma_size)
  27. return NULL;
  28. if (hugetlb_cma[nid])
  29. page = cma_alloc_frozen_compound(hugetlb_cma[nid], order);
  30. if (!page && !(gfp_mask & __GFP_THISNODE)) {
  31. for_each_node_mask(node, *nodemask) {
  32. if (node == nid || !hugetlb_cma[node])
  33. continue;
  34. page = cma_alloc_frozen_compound(hugetlb_cma[node], order);
  35. if (page)
  36. break;
  37. }
  38. }
  39. if (!page)
  40. return NULL;
  41. folio = page_folio(page);
  42. folio_set_hugetlb_cma(folio);
  43. return folio;
  44. }
  45. struct huge_bootmem_page * __init
  46. hugetlb_cma_alloc_bootmem(struct hstate *h, int *nid, bool node_exact)
  47. {
  48. struct cma *cma;
  49. struct huge_bootmem_page *m;
  50. int node = *nid;
  51. cma = hugetlb_cma[*nid];
  52. m = cma_reserve_early(cma, huge_page_size(h));
  53. if (!m) {
  54. if (node_exact)
  55. return NULL;
  56. for_each_node_mask(node, hugetlb_bootmem_nodes) {
  57. cma = hugetlb_cma[node];
  58. if (!cma || node == *nid)
  59. continue;
  60. m = cma_reserve_early(cma, huge_page_size(h));
  61. if (m) {
  62. *nid = node;
  63. break;
  64. }
  65. }
  66. }
  67. if (m) {
  68. m->flags = HUGE_BOOTMEM_CMA;
  69. m->cma = cma;
  70. }
  71. return m;
  72. }
  73. static int __init cmdline_parse_hugetlb_cma(char *p)
  74. {
  75. int nid, count = 0;
  76. unsigned long tmp;
  77. char *s = p;
  78. while (*s) {
  79. if (sscanf(s, "%lu%n", &tmp, &count) != 1)
  80. break;
  81. if (s[count] == ':') {
  82. if (tmp >= MAX_NUMNODES)
  83. break;
  84. nid = array_index_nospec(tmp, MAX_NUMNODES);
  85. s += count + 1;
  86. tmp = memparse(s, &s);
  87. hugetlb_cma_size_in_node[nid] = tmp;
  88. hugetlb_cma_size += tmp;
  89. /*
  90. * Skip the separator if have one, otherwise
  91. * break the parsing.
  92. */
  93. if (*s == ',')
  94. s++;
  95. else
  96. break;
  97. } else {
  98. hugetlb_cma_size = memparse(p, &p);
  99. break;
  100. }
  101. }
  102. return 0;
  103. }
  104. early_param("hugetlb_cma", cmdline_parse_hugetlb_cma);
  105. static int __init cmdline_parse_hugetlb_cma_only(char *p)
  106. {
  107. return kstrtobool(p, &hugetlb_cma_only);
  108. }
  109. early_param("hugetlb_cma_only", cmdline_parse_hugetlb_cma_only);
  110. unsigned int __weak arch_hugetlb_cma_order(void)
  111. {
  112. return 0;
  113. }
  114. void __init hugetlb_cma_reserve(void)
  115. {
  116. unsigned long size, reserved, per_node, order;
  117. bool node_specific_cma_alloc = false;
  118. int nid;
  119. if (!hugetlb_cma_size)
  120. return;
  121. order = arch_hugetlb_cma_order();
  122. if (!order) {
  123. pr_warn("hugetlb_cma: the option isn't supported by current arch\n");
  124. return;
  125. }
  126. /*
  127. * HugeTLB CMA reservation is required for gigantic
  128. * huge pages which could not be allocated via the
  129. * page allocator. Just warn if there is any change
  130. * breaking this assumption.
  131. */
  132. VM_WARN_ON(order <= MAX_PAGE_ORDER);
  133. hugetlb_bootmem_set_nodes();
  134. for (nid = 0; nid < MAX_NUMNODES; nid++) {
  135. if (hugetlb_cma_size_in_node[nid] == 0)
  136. continue;
  137. if (!node_isset(nid, hugetlb_bootmem_nodes)) {
  138. pr_warn("hugetlb_cma: invalid node %d specified\n", nid);
  139. hugetlb_cma_size -= hugetlb_cma_size_in_node[nid];
  140. hugetlb_cma_size_in_node[nid] = 0;
  141. continue;
  142. }
  143. if (hugetlb_cma_size_in_node[nid] < (PAGE_SIZE << order)) {
  144. pr_warn("hugetlb_cma: cma area of node %d should be at least %lu MiB\n",
  145. nid, (PAGE_SIZE << order) / SZ_1M);
  146. hugetlb_cma_size -= hugetlb_cma_size_in_node[nid];
  147. hugetlb_cma_size_in_node[nid] = 0;
  148. } else {
  149. node_specific_cma_alloc = true;
  150. }
  151. }
  152. /* Validate the CMA size again in case some invalid nodes specified. */
  153. if (!hugetlb_cma_size)
  154. return;
  155. if (hugetlb_cma_size < (PAGE_SIZE << order)) {
  156. pr_warn("hugetlb_cma: cma area should be at least %lu MiB\n",
  157. (PAGE_SIZE << order) / SZ_1M);
  158. hugetlb_cma_size = 0;
  159. return;
  160. }
  161. if (!node_specific_cma_alloc) {
  162. /*
  163. * If 3 GB area is requested on a machine with 4 numa nodes,
  164. * let's allocate 1 GB on first three nodes and ignore the last one.
  165. */
  166. per_node = DIV_ROUND_UP(hugetlb_cma_size,
  167. nodes_weight(hugetlb_bootmem_nodes));
  168. pr_info("hugetlb_cma: reserve %lu MiB, up to %lu MiB per node\n",
  169. hugetlb_cma_size / SZ_1M, per_node / SZ_1M);
  170. }
  171. reserved = 0;
  172. for_each_node_mask(nid, hugetlb_bootmem_nodes) {
  173. int res;
  174. char name[CMA_MAX_NAME];
  175. if (node_specific_cma_alloc) {
  176. if (hugetlb_cma_size_in_node[nid] == 0)
  177. continue;
  178. size = hugetlb_cma_size_in_node[nid];
  179. } else {
  180. size = min(per_node, hugetlb_cma_size - reserved);
  181. }
  182. size = round_up(size, PAGE_SIZE << order);
  183. snprintf(name, sizeof(name), "hugetlb%d", nid);
  184. /*
  185. * Note that 'order per bit' is based on smallest size that
  186. * may be returned to CMA allocator in the case of
  187. * huge page demotion.
  188. */
  189. res = cma_declare_contiguous_multi(size, PAGE_SIZE << order,
  190. HUGETLB_PAGE_ORDER, name,
  191. &hugetlb_cma[nid], nid);
  192. if (res) {
  193. pr_warn("hugetlb_cma: reservation failed: err %d, node %d",
  194. res, nid);
  195. continue;
  196. }
  197. reserved += size;
  198. pr_info("hugetlb_cma: reserved %lu MiB on node %d\n",
  199. size / SZ_1M, nid);
  200. if (reserved >= hugetlb_cma_size)
  201. break;
  202. }
  203. if (!reserved)
  204. /*
  205. * hugetlb_cma_size is used to determine if allocations from
  206. * cma are possible. Set to zero if no cma regions are set up.
  207. */
  208. hugetlb_cma_size = 0;
  209. }
  210. bool hugetlb_cma_exclusive_alloc(void)
  211. {
  212. return hugetlb_cma_only;
  213. }
  214. unsigned long __init hugetlb_cma_total_size(void)
  215. {
  216. return hugetlb_cma_size;
  217. }
  218. void __init hugetlb_cma_validate_params(void)
  219. {
  220. if (!hugetlb_cma_size)
  221. hugetlb_cma_only = false;
  222. }
  223. bool __init hugetlb_early_cma(struct hstate *h)
  224. {
  225. if (arch_has_huge_bootmem_alloc())
  226. return false;
  227. return hstate_is_gigantic(h) && hugetlb_cma_only;
  228. }