transhuge.txt 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300
  1. = Transparent Hugepage Support =
  2. == Objective ==
  3. Performance critical computing applications dealing with large memory
  4. working sets are already running on top of libhugetlbfs and in turn
  5. hugetlbfs. Transparent Hugepage Support is an alternative means of
  6. using huge pages for the backing of virtual memory with huge pages
  7. that supports the automatic promotion and demotion of page sizes and
  8. without the shortcomings of hugetlbfs.
  9. Currently it only works for anonymous memory mappings but in the
  10. future it can expand over the pagecache layer starting with tmpfs.
  11. The reason applications are running faster is because of two
  12. factors. The first factor is almost completely irrelevant and it's not
  13. of significant interest because it'll also have the downside of
  14. requiring larger clear-page copy-page in page faults which is a
  15. potentially negative effect. The first factor consists in taking a
  16. single page fault for each 2M virtual region touched by userland (so
  17. reducing the enter/exit kernel frequency by a 512 times factor). This
  18. only matters the first time the memory is accessed for the lifetime of
  19. a memory mapping. The second long lasting and much more important
  20. factor will affect all subsequent accesses to the memory for the whole
  21. runtime of the application. The second factor consist of two
  22. components: 1) the TLB miss will run faster (especially with
  23. virtualization using nested pagetables but almost always also on bare
  24. metal without virtualization) and 2) a single TLB entry will be
  25. mapping a much larger amount of virtual memory in turn reducing the
  26. number of TLB misses. With virtualization and nested pagetables the
  27. TLB can be mapped of larger size only if both KVM and the Linux guest
  28. are using hugepages but a significant speedup already happens if only
  29. one of the two is using hugepages just because of the fact the TLB
  30. miss is going to run faster.
  31. == Design ==
  32. - "graceful fallback": mm components which don't have transparent
  33. hugepage knowledge fall back to breaking a transparent hugepage and
  34. working on the regular pages and their respective regular pmd/pte
  35. mappings
  36. - if a hugepage allocation fails because of memory fragmentation,
  37. regular pages should be gracefully allocated instead and mixed in
  38. the same vma without any failure or significant delay and without
  39. userland noticing
  40. - if some task quits and more hugepages become available (either
  41. immediately in the buddy or through the VM), guest physical memory
  42. backed by regular pages should be relocated on hugepages
  43. automatically (with khugepaged)
  44. - it doesn't require memory reservation and in turn it uses hugepages
  45. whenever possible (the only possible reservation here is kernelcore=
  46. to avoid unmovable pages to fragment all the memory but such a tweak
  47. is not specific to transparent hugepage support and it's a generic
  48. feature that applies to all dynamic high order allocations in the
  49. kernel)
  50. - this initial support only offers the feature in the anonymous memory
  51. regions but it'd be ideal to move it to tmpfs and the pagecache
  52. later
  53. Transparent Hugepage Support maximizes the usefulness of free memory
  54. if compared to the reservation approach of hugetlbfs by allowing all
  55. unused memory to be used as cache or other movable (or even unmovable
  56. entities). It doesn't require reservation to prevent hugepage
  57. allocation failures to be noticeable from userland. It allows paging
  58. and all other advanced VM features to be available on the
  59. hugepages. It requires no modifications for applications to take
  60. advantage of it.
  61. Applications however can be further optimized to take advantage of
  62. this feature, like for example they've been optimized before to avoid
  63. a flood of mmap system calls for every malloc(4k). Optimizing userland
  64. is by far not mandatory and khugepaged already can take care of long
  65. lived page allocations even for hugepage unaware applications that
  66. deals with large amounts of memory.
  67. In certain cases when hugepages are enabled system wide, application
  68. may end up allocating more memory resources. An application may mmap a
  69. large region but only touch 1 byte of it, in that case a 2M page might
  70. be allocated instead of a 4k page for no good. This is why it's
  71. possible to disable hugepages system-wide and to only have them inside
  72. MADV_HUGEPAGE madvise regions.
  73. Embedded systems should enable hugepages only inside madvise regions
  74. to eliminate any risk of wasting any precious byte of memory and to
  75. only run faster.
  76. Applications that gets a lot of benefit from hugepages and that don't
  77. risk to lose memory by using hugepages, should use
  78. madvise(MADV_HUGEPAGE) on their critical mmapped regions.
  79. == sysfs ==
  80. Transparent Hugepage Support can be entirely disabled (mostly for
  81. debugging purposes) or only enabled inside MADV_HUGEPAGE regions (to
  82. avoid the risk of consuming more memory resources) or enabled system
  83. wide. This can be achieved with one of:
  84. echo always >/sys/kernel/mm/transparent_hugepage/enabled
  85. echo madvise >/sys/kernel/mm/transparent_hugepage/enabled
  86. echo never >/sys/kernel/mm/transparent_hugepage/enabled
  87. It's also possible to limit defrag efforts in the VM to generate
  88. hugepages in case they're not immediately free to madvise regions or
  89. to never try to defrag memory and simply fallback to regular pages
  90. unless hugepages are immediately available. Clearly if we spend CPU
  91. time to defrag memory, we would expect to gain even more by the fact
  92. we use hugepages later instead of regular pages. This isn't always
  93. guaranteed, but it may be more likely in case the allocation is for a
  94. MADV_HUGEPAGE region.
  95. echo always >/sys/kernel/mm/transparent_hugepage/defrag
  96. echo madvise >/sys/kernel/mm/transparent_hugepage/defrag
  97. echo never >/sys/kernel/mm/transparent_hugepage/defrag
  98. khugepaged will be automatically started when
  99. transparent_hugepage/enabled is set to "always" or "madvise, and it'll
  100. be automatically shutdown if it's set to "never".
  101. khugepaged runs usually at low frequency so while one may not want to
  102. invoke defrag algorithms synchronously during the page faults, it
  103. should be worth invoking defrag at least in khugepaged. However it's
  104. also possible to disable defrag in khugepaged by writing 0 or enable
  105. defrag in khugepaged by writing 1:
  106. echo 0 >/sys/kernel/mm/transparent_hugepage/khugepaged/defrag
  107. echo 1 >/sys/kernel/mm/transparent_hugepage/khugepaged/defrag
  108. You can also control how many pages khugepaged should scan at each
  109. pass:
  110. /sys/kernel/mm/transparent_hugepage/khugepaged/pages_to_scan
  111. and how many milliseconds to wait in khugepaged between each pass (you
  112. can set this to 0 to run khugepaged at 100% utilization of one core):
  113. /sys/kernel/mm/transparent_hugepage/khugepaged/scan_sleep_millisecs
  114. and how many milliseconds to wait in khugepaged if there's an hugepage
  115. allocation failure to throttle the next allocation attempt.
  116. /sys/kernel/mm/transparent_hugepage/khugepaged/alloc_sleep_millisecs
  117. The khugepaged progress can be seen in the number of pages collapsed:
  118. /sys/kernel/mm/transparent_hugepage/khugepaged/pages_collapsed
  119. for each pass:
  120. /sys/kernel/mm/transparent_hugepage/khugepaged/full_scans
  121. == Boot parameter ==
  122. You can change the sysfs boot time defaults of Transparent Hugepage
  123. Support by passing the parameter "transparent_hugepage=always" or
  124. "transparent_hugepage=madvise" or "transparent_hugepage=never"
  125. (without "") to the kernel command line.
  126. == Need of application restart ==
  127. The transparent_hugepage/enabled values only affect future
  128. behavior. So to make them effective you need to restart any
  129. application that could have been using hugepages. This also applies to
  130. the regions registered in khugepaged.
  131. == get_user_pages and follow_page ==
  132. get_user_pages and follow_page if run on a hugepage, will return the
  133. head or tail pages as usual (exactly as they would do on
  134. hugetlbfs). Most gup users will only care about the actual physical
  135. address of the page and its temporary pinning to release after the I/O
  136. is complete, so they won't ever notice the fact the page is huge. But
  137. if any driver is going to mangle over the page structure of the tail
  138. page (like for checking page->mapping or other bits that are relevant
  139. for the head page and not the tail page), it should be updated to jump
  140. to check head page instead (while serializing properly against
  141. split_huge_page() to avoid the head and tail pages to disappear from
  142. under it, see the futex code to see an example of that, hugetlbfs also
  143. needed special handling in futex code for similar reasons).
  144. NOTE: these aren't new constraints to the GUP API, and they match the
  145. same constrains that applies to hugetlbfs too, so any driver capable
  146. of handling GUP on hugetlbfs will also work fine on transparent
  147. hugepage backed mappings.
  148. In case you can't handle compound pages if they're returned by
  149. follow_page, the FOLL_SPLIT bit can be specified as parameter to
  150. follow_page, so that it will split the hugepages before returning
  151. them. Migration for example passes FOLL_SPLIT as parameter to
  152. follow_page because it's not hugepage aware and in fact it can't work
  153. at all on hugetlbfs (but it instead works fine on transparent
  154. hugepages thanks to FOLL_SPLIT). migration simply can't deal with
  155. hugepages being returned (as it's not only checking the pfn of the
  156. page and pinning it during the copy but it pretends to migrate the
  157. memory in regular page sizes and with regular pte/pmd mappings).
  158. == Optimizing the applications ==
  159. To be guaranteed that the kernel will map a 2M page immediately in any
  160. memory region, the mmap region has to be hugepage naturally
  161. aligned. posix_memalign() can provide that guarantee.
  162. == Hugetlbfs ==
  163. You can use hugetlbfs on a kernel that has transparent hugepage
  164. support enabled just fine as always. No difference can be noted in
  165. hugetlbfs other than there will be less overall fragmentation. All
  166. usual features belonging to hugetlbfs are preserved and
  167. unaffected. libhugetlbfs will also work fine as usual.
  168. == Graceful fallback ==
  169. Code walking pagetables but unware about huge pmds can simply call
  170. split_huge_page_pmd(mm, pmd) where the pmd is the one returned by
  171. pmd_offset. It's trivial to make the code transparent hugepage aware
  172. by just grepping for "pmd_offset" and adding split_huge_page_pmd where
  173. missing after pmd_offset returns the pmd. Thanks to the graceful
  174. fallback design, with a one liner change, you can avoid to write
  175. hundred if not thousand of lines of complex code to make your code
  176. hugepage aware.
  177. If you're not walking pagetables but you run into a physical hugepage
  178. but you can't handle it natively in your code, you can split it by
  179. calling split_huge_page(page). This is what the Linux VM does before
  180. it tries to swapout the hugepage for example.
  181. Example to make mremap.c transparent hugepage aware with a one liner
  182. change:
  183. diff --git a/mm/mremap.c b/mm/mremap.c
  184. --- a/mm/mremap.c
  185. +++ b/mm/mremap.c
  186. @@ -41,6 +41,7 @@ static pmd_t *get_old_pmd(struct mm_stru
  187. return NULL;
  188. pmd = pmd_offset(pud, addr);
  189. + split_huge_page_pmd(mm, pmd);
  190. if (pmd_none_or_clear_bad(pmd))
  191. return NULL;
  192. == Locking in hugepage aware code ==
  193. We want as much code as possible hugepage aware, as calling
  194. split_huge_page() or split_huge_page_pmd() has a cost.
  195. To make pagetable walks huge pmd aware, all you need to do is to call
  196. pmd_trans_huge() on the pmd returned by pmd_offset. You must hold the
  197. mmap_sem in read (or write) mode to be sure an huge pmd cannot be
  198. created from under you by khugepaged (khugepaged collapse_huge_page
  199. takes the mmap_sem in write mode in addition to the anon_vma lock). If
  200. pmd_trans_huge returns false, you just fallback in the old code
  201. paths. If instead pmd_trans_huge returns true, you have to take the
  202. mm->page_table_lock and re-run pmd_trans_huge. Taking the
  203. page_table_lock will prevent the huge pmd to be converted into a
  204. regular pmd from under you (split_huge_page can run in parallel to the
  205. pagetable walk). If the second pmd_trans_huge returns false, you
  206. should just drop the page_table_lock and fallback to the old code as
  207. before. Otherwise you should run pmd_trans_splitting on the pmd. In
  208. case pmd_trans_splitting returns true, it means split_huge_page is
  209. already in the middle of splitting the page. So if pmd_trans_splitting
  210. returns true it's enough to drop the page_table_lock and call
  211. wait_split_huge_page and then fallback the old code paths. You are
  212. guaranteed by the time wait_split_huge_page returns, the pmd isn't
  213. huge anymore. If pmd_trans_splitting returns false, you can proceed to
  214. process the huge pmd and the hugepage natively. Once finished you can
  215. drop the page_table_lock.
  216. == compound_lock, get_user_pages and put_page ==
  217. split_huge_page internally has to distribute the refcounts in the head
  218. page to the tail pages before clearing all PG_head/tail bits from the
  219. page structures. It can do that easily for refcounts taken by huge pmd
  220. mappings. But the GUI API as created by hugetlbfs (that returns head
  221. and tail pages if running get_user_pages on an address backed by any
  222. hugepage), requires the refcount to be accounted on the tail pages and
  223. not only in the head pages, if we want to be able to run
  224. split_huge_page while there are gup pins established on any tail
  225. page. Failure to be able to run split_huge_page if there's any gup pin
  226. on any tail page, would mean having to split all hugepages upfront in
  227. get_user_pages which is unacceptable as too many gup users are
  228. performance critical and they must work natively on hugepages like
  229. they work natively on hugetlbfs already (hugetlbfs is simpler because
  230. hugetlbfs pages cannot be splitted so there wouldn't be requirement of
  231. accounting the pins on the tail pages for hugetlbfs). If we wouldn't
  232. account the gup refcounts on the tail pages during gup, we won't know
  233. anymore which tail page is pinned by gup and which is not while we run
  234. split_huge_page. But we still have to add the gup pin to the head page
  235. too, to know when we can free the compound page in case it's never
  236. splitted during its lifetime. That requires changing not just
  237. get_page, but put_page as well so that when put_page runs on a tail
  238. page (and only on a tail page) it will find its respective head page,
  239. and then it will decrease the head page refcount in addition to the
  240. tail page refcount. To obtain a head page reliably and to decrease its
  241. refcount without race conditions, put_page has to serialize against
  242. __split_huge_page_refcount using a special per-page lock called
  243. compound_lock.