transhuge.rst 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197
  1. .. _transhuge:
  2. ============================
  3. Transparent Hugepage Support
  4. ============================
  5. This document describes design principles Transparent Hugepage (THP)
  6. Support and its interaction with other parts of the memory management.
  7. Design principles
  8. =================
  9. - "graceful fallback": mm components which don't have transparent hugepage
  10. knowledge fall back to breaking huge pmd mapping into table of ptes and,
  11. if necessary, split a transparent hugepage. Therefore these components
  12. can continue working on the regular pages or regular pte mappings.
  13. - if a hugepage allocation fails because of memory fragmentation,
  14. regular pages should be gracefully allocated instead and mixed in
  15. the same vma without any failure or significant delay and without
  16. userland noticing
  17. - if some task quits and more hugepages become available (either
  18. immediately in the buddy or through the VM), guest physical memory
  19. backed by regular pages should be relocated on hugepages
  20. automatically (with khugepaged)
  21. - it doesn't require memory reservation and in turn it uses hugepages
  22. whenever possible (the only possible reservation here is kernelcore=
  23. to avoid unmovable pages to fragment all the memory but such a tweak
  24. is not specific to transparent hugepage support and it's a generic
  25. feature that applies to all dynamic high order allocations in the
  26. kernel)
  27. get_user_pages and follow_page
  28. ==============================
  29. get_user_pages and follow_page if run on a hugepage, will return the
  30. head or tail pages as usual (exactly as they would do on
  31. hugetlbfs). Most gup users will only care about the actual physical
  32. address of the page and its temporary pinning to release after the I/O
  33. is complete, so they won't ever notice the fact the page is huge. But
  34. if any driver is going to mangle over the page structure of the tail
  35. page (like for checking page->mapping or other bits that are relevant
  36. for the head page and not the tail page), it should be updated to jump
  37. to check head page instead. Taking reference on any head/tail page would
  38. prevent page from being split by anyone.
  39. .. note::
  40. these aren't new constraints to the GUP API, and they match the
  41. same constrains that applies to hugetlbfs too, so any driver capable
  42. of handling GUP on hugetlbfs will also work fine on transparent
  43. hugepage backed mappings.
  44. In case you can't handle compound pages if they're returned by
  45. follow_page, the FOLL_SPLIT bit can be specified as parameter to
  46. follow_page, so that it will split the hugepages before returning
  47. them. Migration for example passes FOLL_SPLIT as parameter to
  48. follow_page because it's not hugepage aware and in fact it can't work
  49. at all on hugetlbfs (but it instead works fine on transparent
  50. hugepages thanks to FOLL_SPLIT). migration simply can't deal with
  51. hugepages being returned (as it's not only checking the pfn of the
  52. page and pinning it during the copy but it pretends to migrate the
  53. memory in regular page sizes and with regular pte/pmd mappings).
  54. Graceful fallback
  55. =================
  56. Code walking pagetables but unaware about huge pmds can simply call
  57. split_huge_pmd(vma, pmd, addr) where the pmd is the one returned by
  58. pmd_offset. It's trivial to make the code transparent hugepage aware
  59. by just grepping for "pmd_offset" and adding split_huge_pmd where
  60. missing after pmd_offset returns the pmd. Thanks to the graceful
  61. fallback design, with a one liner change, you can avoid to write
  62. hundred if not thousand of lines of complex code to make your code
  63. hugepage aware.
  64. If you're not walking pagetables but you run into a physical hugepage
  65. but you can't handle it natively in your code, you can split it by
  66. calling split_huge_page(page). This is what the Linux VM does before
  67. it tries to swapout the hugepage for example. split_huge_page() can fail
  68. if the page is pinned and you must handle this correctly.
  69. Example to make mremap.c transparent hugepage aware with a one liner
  70. change::
  71. diff --git a/mm/mremap.c b/mm/mremap.c
  72. --- a/mm/mremap.c
  73. +++ b/mm/mremap.c
  74. @@ -41,6 +41,7 @@ static pmd_t *get_old_pmd(struct mm_stru
  75. return NULL;
  76. pmd = pmd_offset(pud, addr);
  77. + split_huge_pmd(vma, pmd, addr);
  78. if (pmd_none_or_clear_bad(pmd))
  79. return NULL;
  80. Locking in hugepage aware code
  81. ==============================
  82. We want as much code as possible hugepage aware, as calling
  83. split_huge_page() or split_huge_pmd() has a cost.
  84. To make pagetable walks huge pmd aware, all you need to do is to call
  85. pmd_trans_huge() on the pmd returned by pmd_offset. You must hold the
  86. mmap_sem in read (or write) mode to be sure an huge pmd cannot be
  87. created from under you by khugepaged (khugepaged collapse_huge_page
  88. takes the mmap_sem in write mode in addition to the anon_vma lock). If
  89. pmd_trans_huge returns false, you just fallback in the old code
  90. paths. If instead pmd_trans_huge returns true, you have to take the
  91. page table lock (pmd_lock()) and re-run pmd_trans_huge. Taking the
  92. page table lock will prevent the huge pmd to be converted into a
  93. regular pmd from under you (split_huge_pmd can run in parallel to the
  94. pagetable walk). If the second pmd_trans_huge returns false, you
  95. should just drop the page table lock and fallback to the old code as
  96. before. Otherwise you can proceed to process the huge pmd and the
  97. hugepage natively. Once finished you can drop the page table lock.
  98. Refcounts and transparent huge pages
  99. ====================================
  100. Refcounting on THP is mostly consistent with refcounting on other compound
  101. pages:
  102. - get_page()/put_page() and GUP operate in head page's ->_refcount.
  103. - ->_refcount in tail pages is always zero: get_page_unless_zero() never
  104. succeed on tail pages.
  105. - map/unmap of the pages with PTE entry increment/decrement ->_mapcount
  106. on relevant sub-page of the compound page.
  107. - map/unmap of the whole compound page accounted in compound_mapcount
  108. (stored in first tail page). For file huge pages, we also increment
  109. ->_mapcount of all sub-pages in order to have race-free detection of
  110. last unmap of subpages.
  111. PageDoubleMap() indicates that the page is *possibly* mapped with PTEs.
  112. For anonymous pages PageDoubleMap() also indicates ->_mapcount in all
  113. subpages is offset up by one. This additional reference is required to
  114. get race-free detection of unmap of subpages when we have them mapped with
  115. both PMDs and PTEs.
  116. This is optimization required to lower overhead of per-subpage mapcount
  117. tracking. The alternative is alter ->_mapcount in all subpages on each
  118. map/unmap of the whole compound page.
  119. For anonymous pages, we set PG_double_map when a PMD of the page got split
  120. for the first time, but still have PMD mapping. The additional references
  121. go away with last compound_mapcount.
  122. File pages get PG_double_map set on first map of the page with PTE and
  123. goes away when the page gets evicted from page cache.
  124. split_huge_page internally has to distribute the refcounts in the head
  125. page to the tail pages before clearing all PG_head/tail bits from the page
  126. structures. It can be done easily for refcounts taken by page table
  127. entries. But we don't have enough information on how to distribute any
  128. additional pins (i.e. from get_user_pages). split_huge_page() fails any
  129. requests to split pinned huge page: it expects page count to be equal to
  130. sum of mapcount of all sub-pages plus one (split_huge_page caller must
  131. have reference for head page).
  132. split_huge_page uses migration entries to stabilize page->_refcount and
  133. page->_mapcount of anonymous pages. File pages just got unmapped.
  134. We safe against physical memory scanners too: the only legitimate way
  135. scanner can get reference to a page is get_page_unless_zero().
  136. All tail pages have zero ->_refcount until atomic_add(). This prevents the
  137. scanner from getting a reference to the tail page up to that point. After the
  138. atomic_add() we don't care about the ->_refcount value. We already known how
  139. many references should be uncharged from the head page.
  140. For head page get_page_unless_zero() will succeed and we don't mind. It's
  141. clear where reference should go after split: it will stay on head page.
  142. Note that split_huge_pmd() doesn't have any limitation on refcounting:
  143. pmd can be split at any point and never fails.
  144. Partial unmap and deferred_split_huge_page()
  145. ============================================
  146. Unmapping part of THP (with munmap() or other way) is not going to free
  147. memory immediately. Instead, we detect that a subpage of THP is not in use
  148. in page_remove_rmap() and queue the THP for splitting if memory pressure
  149. comes. Splitting will free up unused subpages.
  150. Splitting the page right away is not an option due to locking context in
  151. the place where we can detect partial unmap. It's also might be
  152. counterproductive since in many cases partial unmap happens during exit(2) if
  153. a THP crosses a VMA boundary.
  154. Function deferred_split_huge_page() is used to queue page for splitting.
  155. The splitting itself will happen when we get memory pressure via shrinker
  156. interface.