Home Verkennen Help
Inloggen
Aarav90-cpu
/
ARK-OS
1
0
Vork 0
Bestanden Issues 0 Pull-aanvragen 0 Wiki
Aftakking: master
Aftakkingen Labels
ARK-OS
/
arkos
/
kernel
/
Documentation
/
mm
/
swap-table.rst

swap-table.rst 2.3 KB
Permalink Geschiedenis Ruwe

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869 
  1. .. SPDX-License-Identifier: GPL-2.0
    2. 

  2. 

  3. :Author: Chris Li <chrisl@kernel.org>, Kairui Song <kasong@tencent.com>
    4. 

  4. 

  5. ==========
    6. 

  6. Swap Table
    7. 

  7. ==========
    8. 

  8. 

  9. Swap table implements swap cache as a per-cluster swap cache value array.
    10. 

  10. 

  11. Swap Entry
    12. 

  12. ----------
    13. 

  13. 

  14. A swap entry contains the information required to serve the anonymous page
    15. 

  15. fault.
    16. 

  16. 

  17. Swap entry is encoded as two parts: swap type and swap offset.
    18. 

  18. 

  19. The swap type indicates which swap device to use.
    20. 

  20. The swap offset is the offset of the swap file to read the page data from.
    21. 

  21. 

  22. Swap Cache
    23. 

  23. ----------
    24. 

  24. 

  25. Swap cache is a map to look up folios using swap entry as the key. The result
    26. 

  26. value can have three possible types depending on which stage of this swap entry
    27. 

  27. was in.
    28. 

  28. 

  29. 1. NULL: This swap entry is not used.
    30. 

  30. 

  31. 2. folio: A folio has been allocated and bound to this swap entry. This is
    32. 

  32.    the transient state of swap out or swap in. The folio data can be in
    33. 

  33.    the folio or swap file, or both.
    34. 

  34. 

  35. 3. shadow: The shadow contains the working set information of the swapped
    36. 

  36.    out folio. This is the normal state for a swapped out page.
    37. 

  37. 

  38. Swap Table Internals
    39. 

  39. --------------------
    40. 

  40. 

  41. The previous swap cache is implemented by XArray. The XArray is a tree
    42. 

  42. structure. Each lookup will go through multiple nodes. Can we do better?
    43. 

  43. 

  44. Notice that most of the time when we look up the swap cache, we are either
    45. 

  45. in a swap in or swap out path. We should already have the swap cluster,
    46. 

  46. which contains the swap entry.
    47. 

  47. 

  48. If we have a per-cluster array to store swap cache value in the cluster.
    49. 

  49. Swap cache lookup within the cluster can be a very simple array lookup.
    50. 

  50. 

  51. We give such a per-cluster swap cache value array a name: the swap table.
    52. 

  52. 

  53. A swap table is an array of pointers. Each pointer is the same size as a
    54. 

  54. PTE. The size of a swap table for one swap cluster typically matches a PTE
    55. 

  55. page table, which is one page on modern 64-bit systems.
    56. 

  56. 

  57. With swap table, swap cache lookup can achieve great locality, simpler,
    58. 

  58. and faster.
    59. 

  59. 

  60. Locking
    61. 

  61. -------
    62. 

  62. 

  63. Swap table modification requires taking the cluster lock. If a folio
    64. 

  64. is being added to or removed from the swap table, the folio must be
    65. 

  65. locked prior to the cluster lock. After adding or removing is done, the
    66. 

  66. folio shall be unlocked.
    67. 

  67. 

  68. Swap table lookup is protected by RCU and atomic read. If the lookup
    69. 

  69. returns a folio, the user must lock the folio before use.
    70.