transhuge.rst 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169
  1. ============================
  2. Transparent Hugepage Support
  3. ============================
  4. This document describes design principles for Transparent Hugepage (THP)
  5. support and its interaction with other parts of the memory management
  6. system.
  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 pin_user_pages
  28. =================================
  29. get_user_pages and pin_user_pages 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 a reference on any head/tail page would
  38. prevent the page from being split by anyone.
  39. .. note::
  40. these aren't new constraints to the GUP API, and they match the
  41. same constraints that apply to hugetlbfs too, so any driver capable
  42. of handling GUP on hugetlbfs will also work fine on transparent
  43. hugepage backed mappings.
  44. Graceful fallback
  45. =================
  46. Code walking pagetables but unaware about huge pmds can simply call
  47. split_huge_pmd(vma, pmd, addr) where the pmd is the one returned by
  48. pmd_offset. It's trivial to make the code transparent hugepage aware
  49. by just grepping for "pmd_offset" and adding split_huge_pmd where
  50. missing after pmd_offset returns the pmd. Thanks to the graceful
  51. fallback design, with a one liner change, you can avoid to write
  52. hundreds if not thousands of lines of complex code to make your code
  53. hugepage aware.
  54. If you're not walking pagetables but you run into a physical hugepage
  55. that you can't handle natively in your code, you can split it by
  56. calling split_huge_page(page). This is what the Linux VM does before
  57. it tries to swapout the hugepage for example. split_huge_page() can fail
  58. if the page is pinned and you must handle this correctly.
  59. Example to make mremap.c transparent hugepage aware with a one liner
  60. change::
  61. diff --git a/mm/mremap.c b/mm/mremap.c
  62. --- a/mm/mremap.c
  63. +++ b/mm/mremap.c
  64. @@ -41,6 +41,7 @@ static pmd_t *get_old_pmd(struct mm_stru
  65. return NULL;
  66. pmd = pmd_offset(pud, addr);
  67. + split_huge_pmd(vma, pmd, addr);
  68. if (pmd_none_or_clear_bad(pmd))
  69. return NULL;
  70. Locking in hugepage aware code
  71. ==============================
  72. We want as much code as possible hugepage aware, as calling
  73. split_huge_page() or split_huge_pmd() has a cost.
  74. To make pagetable walks huge pmd aware, all you need to do is to call
  75. pmd_trans_huge() on the pmd returned by pmd_offset. You must hold the
  76. mmap_lock in read (or write) mode to be sure a huge pmd cannot be
  77. created from under you by khugepaged (khugepaged collapse_huge_page
  78. takes the mmap_lock in write mode in addition to the anon_vma lock). If
  79. pmd_trans_huge returns false, you just fallback in the old code
  80. paths. If instead pmd_trans_huge returns true, you have to take the
  81. page table lock (pmd_lock()) and re-run pmd_trans_huge. Taking the
  82. page table lock will prevent the huge pmd being converted into a
  83. regular pmd from under you (split_huge_pmd can run in parallel to the
  84. pagetable walk). If the second pmd_trans_huge returns false, you
  85. should just drop the page table lock and fallback to the old code as
  86. before. Otherwise, you can proceed to process the huge pmd and the
  87. hugepage natively. Once finished, you can drop the page table lock.
  88. Refcounts and transparent huge pages
  89. ====================================
  90. Refcounting on THP is mostly consistent with refcounting on other compound
  91. pages:
  92. - get_page()/put_page() and GUP operate on the folio->_refcount.
  93. - ->_refcount in tail pages is always zero: get_page_unless_zero() never
  94. succeeds on tail pages.
  95. - map/unmap of a PMD entry for the whole THP increment/decrement
  96. folio->_entire_mapcount, increment/decrement folio->_large_mapcount
  97. and also increment/decrement folio->_nr_pages_mapped by ENTIRELY_MAPPED
  98. when _entire_mapcount goes from -1 to 0 or 0 to -1.
  99. - map/unmap of individual pages with PTE entry increment/decrement
  100. page->_mapcount, increment/decrement folio->_large_mapcount and also
  101. increment/decrement folio->_nr_pages_mapped when page->_mapcount goes
  102. from -1 to 0 or 0 to -1 as this counts the number of pages mapped by PTE.
  103. split_huge_page internally has to distribute the refcounts in the head
  104. page to the tail pages before clearing all PG_head/tail bits from the page
  105. structures. It can be done easily for refcounts taken by page table
  106. entries, but we don't have enough information on how to distribute any
  107. additional pins (i.e. from get_user_pages). split_huge_page() fails any
  108. requests to split pinned huge pages: it expects page count to be equal to
  109. the sum of mapcount of all sub-pages plus one (split_huge_page caller must
  110. have a reference to the head page).
  111. split_huge_page uses migration entries to stabilize page->_refcount and
  112. page->_mapcount of anonymous pages. File pages just get unmapped.
  113. We are safe against physical memory scanners too: the only legitimate way
  114. a scanner can get a reference to a page is get_page_unless_zero().
  115. All tail pages have zero ->_refcount until atomic_add(). This prevents the
  116. scanner from getting a reference to the tail page up to that point. After the
  117. atomic_add() we don't care about the ->_refcount value. We already know how
  118. many references should be uncharged from the head page.
  119. For head page get_page_unless_zero() will succeed and we don't mind. It's
  120. clear where references should go after split: it will stay on the head page.
  121. Note that split_huge_pmd() doesn't have any limitations on refcounting:
  122. pmd can be split at any point and never fails.
  123. Partial unmap and deferred_split_folio()
  124. ========================================
  125. Unmapping part of THP (with munmap() or other way) is not going to free
  126. memory immediately. Instead, we detect that a subpage of THP is not in use
  127. in folio_remove_rmap_*() and queue the THP for splitting if memory pressure
  128. comes. Splitting will free up unused subpages.
  129. Splitting the page right away is not an option due to locking context in
  130. the place where we can detect partial unmap. It also might be
  131. counterproductive since in many cases partial unmap happens during exit(2) if
  132. a THP crosses a VMA boundary.
  133. The function deferred_split_folio() is used to queue a folio for splitting.
  134. The splitting itself will happen when we get memory pressure via shrinker
  135. interface.