highmem.rst 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190
  1. .. _highmem:
  2. ====================
  3. High Memory Handling
  4. ====================
  5. By: Peter Zijlstra <[email protected]>
  6. .. contents:: :local:
  7. What Is High Memory?
  8. ====================
  9. High memory (highmem) is used when the size of physical memory approaches or
  10. exceeds the maximum size of virtual memory. At that point it becomes
  11. impossible for the kernel to keep all of the available physical memory mapped
  12. at all times. This means the kernel needs to start using temporary mappings of
  13. the pieces of physical memory that it wants to access.
  14. The part of (physical) memory not covered by a permanent mapping is what we
  15. refer to as 'highmem'. There are various architecture dependent constraints on
  16. where exactly that border lies.
  17. In the i386 arch, for example, we choose to map the kernel into every process's
  18. VM space so that we don't have to pay the full TLB invalidation costs for
  19. kernel entry/exit. This means the available virtual memory space (4GiB on
  20. i386) has to be divided between user and kernel space.
  21. The traditional split for architectures using this approach is 3:1, 3GiB for
  22. userspace and the top 1GiB for kernel space::
  23. +--------+ 0xffffffff
  24. | Kernel |
  25. +--------+ 0xc0000000
  26. | |
  27. | User |
  28. | |
  29. +--------+ 0x00000000
  30. This means that the kernel can at most map 1GiB of physical memory at any one
  31. time, but because we need virtual address space for other things - including
  32. temporary maps to access the rest of the physical memory - the actual direct
  33. map will typically be less (usually around ~896MiB).
  34. Other architectures that have mm context tagged TLBs can have separate kernel
  35. and user maps. Some hardware (like some ARMs), however, have limited virtual
  36. space when they use mm context tags.
  37. Temporary Virtual Mappings
  38. ==========================
  39. The kernel contains several ways of creating temporary mappings. The following
  40. list shows them in order of preference of use.
  41. * kmap_local_page(). This function is used to require short term mappings.
  42. It can be invoked from any context (including interrupts) but the mappings
  43. can only be used in the context which acquired them.
  44. This function should be preferred, where feasible, over all the others.
  45. These mappings are thread-local and CPU-local, meaning that the mapping
  46. can only be accessed from within this thread and the thread is bound to the
  47. CPU while the mapping is active. Although preemption is never disabled by
  48. this function, the CPU can not be unplugged from the system via
  49. CPU-hotplug until the mapping is disposed.
  50. It's valid to take pagefaults in a local kmap region, unless the context
  51. in which the local mapping is acquired does not allow it for other reasons.
  52. As said, pagefaults and preemption are never disabled. There is no need to
  53. disable preemption because, when context switches to a different task, the
  54. maps of the outgoing task are saved and those of the incoming one are
  55. restored.
  56. kmap_local_page() always returns a valid virtual address and it is assumed
  57. that kunmap_local() will never fail.
  58. On CONFIG_HIGHMEM=n kernels and for low memory pages this returns the
  59. virtual address of the direct mapping. Only real highmem pages are
  60. temporarily mapped. Therefore, users may call a plain page_address()
  61. for pages which are known to not come from ZONE_HIGHMEM. However, it is
  62. always safe to use kmap_local_page() / kunmap_local().
  63. While it is significantly faster than kmap(), for the higmem case it
  64. comes with restrictions about the pointers validity. Contrary to kmap()
  65. mappings, the local mappings are only valid in the context of the caller
  66. and cannot be handed to other contexts. This implies that users must
  67. be absolutely sure to keep the use of the return address local to the
  68. thread which mapped it.
  69. Most code can be designed to use thread local mappings. User should
  70. therefore try to design their code to avoid the use of kmap() by mapping
  71. pages in the same thread the address will be used and prefer
  72. kmap_local_page().
  73. Nesting kmap_local_page() and kmap_atomic() mappings is allowed to a certain
  74. extent (up to KMAP_TYPE_NR) but their invocations have to be strictly ordered
  75. because the map implementation is stack based. See kmap_local_page() kdocs
  76. (included in the "Functions" section) for details on how to manage nested
  77. mappings.
  78. * kmap_atomic(). This permits a very short duration mapping of a single
  79. page. Since the mapping is restricted to the CPU that issued it, it
  80. performs well, but the issuing task is therefore required to stay on that
  81. CPU until it has finished, lest some other task displace its mappings.
  82. kmap_atomic() may also be used by interrupt contexts, since it does not
  83. sleep and the callers too may not sleep until after kunmap_atomic() is
  84. called.
  85. Each call of kmap_atomic() in the kernel creates a non-preemptible section
  86. and disable pagefaults. This could be a source of unwanted latency. Therefore
  87. users should prefer kmap_local_page() instead of kmap_atomic().
  88. It is assumed that k[un]map_atomic() won't fail.
  89. * kmap(). This should be used to make short duration mapping of a single
  90. page with no restrictions on preemption or migration. It comes with an
  91. overhead as mapping space is restricted and protected by a global lock
  92. for synchronization. When mapping is no longer needed, the address that
  93. the page was mapped to must be released with kunmap().
  94. Mapping changes must be propagated across all the CPUs. kmap() also
  95. requires global TLB invalidation when the kmap's pool wraps and it might
  96. block when the mapping space is fully utilized until a slot becomes
  97. available. Therefore, kmap() is only callable from preemptible context.
  98. All the above work is necessary if a mapping must last for a relatively
  99. long time but the bulk of high-memory mappings in the kernel are
  100. short-lived and only used in one place. This means that the cost of
  101. kmap() is mostly wasted in such cases. kmap() was not intended for long
  102. term mappings but it has morphed in that direction and its use is
  103. strongly discouraged in newer code and the set of the preceding functions
  104. should be preferred.
  105. On 64-bit systems, calls to kmap_local_page(), kmap_atomic() and kmap() have
  106. no real work to do because a 64-bit address space is more than sufficient to
  107. address all the physical memory whose pages are permanently mapped.
  108. * vmap(). This can be used to make a long duration mapping of multiple
  109. physical pages into a contiguous virtual space. It needs global
  110. synchronization to unmap.
  111. Cost of Temporary Mappings
  112. ==========================
  113. The cost of creating temporary mappings can be quite high. The arch has to
  114. manipulate the kernel's page tables, the data TLB and/or the MMU's registers.
  115. If CONFIG_HIGHMEM is not set, then the kernel will try and create a mapping
  116. simply with a bit of arithmetic that will convert the page struct address into
  117. a pointer to the page contents rather than juggling mappings about. In such a
  118. case, the unmap operation may be a null operation.
  119. If CONFIG_MMU is not set, then there can be no temporary mappings and no
  120. highmem. In such a case, the arithmetic approach will also be used.
  121. i386 PAE
  122. ========
  123. The i386 arch, under some circumstances, will permit you to stick up to 64GiB
  124. of RAM into your 32-bit machine. This has a number of consequences:
  125. * Linux needs a page-frame structure for each page in the system and the
  126. pageframes need to live in the permanent mapping, which means:
  127. * you can have 896M/sizeof(struct page) page-frames at most; with struct
  128. page being 32-bytes that would end up being something in the order of 112G
  129. worth of pages; the kernel, however, needs to store more than just
  130. page-frames in that memory...
  131. * PAE makes your page tables larger - which slows the system down as more
  132. data has to be accessed to traverse in TLB fills and the like. One
  133. advantage is that PAE has more PTE bits and can provide advanced features
  134. like NX and PAT.
  135. The general recommendation is that you don't use more than 8GiB on a 32-bit
  136. machine - although more might work for you and your workload, you're pretty
  137. much on your own - don't expect kernel developers to really care much if things
  138. come apart.
  139. Functions
  140. =========
  141. .. kernel-doc:: include/linux/highmem.h
  142. .. kernel-doc:: include/linux/highmem-internal.h