cachetlb.rst 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398
  1. ==================================
  2. Cache and TLB Flushing Under Linux
  3. ==================================
  4. :Author: David S. Miller <davem@redhat.com>
  5. This document describes the cache/tlb flushing interfaces called
  6. by the Linux VM subsystem. It enumerates over each interface,
  7. describes its intended purpose, and what side effect is expected
  8. after the interface is invoked.
  9. The side effects described below are stated for a uniprocessor
  10. implementation, and what is to happen on that single processor. The
  11. SMP cases are a simple extension, in that you just extend the
  12. definition such that the side effect for a particular interface occurs
  13. on all processors in the system. Don't let this scare you into
  14. thinking SMP cache/tlb flushing must be so inefficient, this is in
  15. fact an area where many optimizations are possible. For example,
  16. if it can be proven that a user address space has never executed
  17. on a cpu (see mm_cpumask()), one need not perform a flush
  18. for this address space on that cpu.
  19. First, the TLB flushing interfaces, since they are the simplest. The
  20. "TLB" is abstracted under Linux as something the cpu uses to cache
  21. virtual-->physical address translations obtained from the software
  22. page tables. Meaning that if the software page tables change, it is
  23. possible for stale translations to exist in this "TLB" cache.
  24. Therefore when software page table changes occur, the kernel will
  25. invoke one of the following flush methods _after_ the page table
  26. changes occur:
  27. 1) ``void flush_tlb_all(void)``
  28. The most severe flush of all. After this interface runs,
  29. any previous page table modification whatsoever will be
  30. visible to the cpu.
  31. This is usually invoked when the kernel page tables are
  32. changed, since such translations are "global" in nature.
  33. 2) ``void flush_tlb_mm(struct mm_struct *mm)``
  34. This interface flushes an entire user address space from
  35. the TLB. After running, this interface must make sure that
  36. any previous page table modifications for the address space
  37. 'mm' will be visible to the cpu. That is, after running,
  38. there will be no entries in the TLB for 'mm'.
  39. This interface is used to handle whole address space
  40. page table operations such as what happens during
  41. fork, and exec.
  42. 3) ``void flush_tlb_range(struct vm_area_struct *vma,
  43. unsigned long start, unsigned long end)``
  44. Here we are flushing a specific range of (user) virtual
  45. address translations from the TLB. After running, this
  46. interface must make sure that any previous page table
  47. modifications for the address space 'vma->vm_mm' in the range
  48. 'start' to 'end-1' will be visible to the cpu. That is, after
  49. running, there will be no entries in the TLB for 'mm' for
  50. virtual addresses in the range 'start' to 'end-1'.
  51. The "vma" is the backing store being used for the region.
  52. Primarily, this is used for munmap() type operations.
  53. The interface is provided in hopes that the port can find
  54. a suitably efficient method for removing multiple page
  55. sized translations from the TLB, instead of having the kernel
  56. call flush_tlb_page (see below) for each entry which may be
  57. modified.
  58. 4) ``void flush_tlb_page(struct vm_area_struct *vma, unsigned long addr)``
  59. This time we need to remove the PAGE_SIZE sized translation
  60. from the TLB. The 'vma' is the backing structure used by
  61. Linux to keep track of mmap'd regions for a process, the
  62. address space is available via vma->vm_mm. Also, one may
  63. test (vma->vm_flags & VM_EXEC) to see if this region is
  64. executable (and thus could be in the 'instruction TLB' in
  65. split-tlb type setups).
  66. After running, this interface must make sure that any previous
  67. page table modification for address space 'vma->vm_mm' for
  68. user virtual address 'addr' will be visible to the cpu. That
  69. is, after running, there will be no entries in the TLB for
  70. 'vma->vm_mm' for virtual address 'addr'.
  71. This is used primarily during fault processing.
  72. 5) ``void update_mmu_cache_range(struct vm_fault *vmf,
  73. struct vm_area_struct *vma, unsigned long address, pte_t *ptep,
  74. unsigned int nr)``
  75. At the end of every page fault, this routine is invoked to tell
  76. the architecture specific code that translations now exists
  77. in the software page tables for address space "vma->vm_mm"
  78. at virtual address "address" for "nr" consecutive pages.
  79. This routine is also invoked in various other places which pass
  80. a NULL "vmf".
  81. A port may use this information in any way it so chooses.
  82. For example, it could use this event to pre-load TLB
  83. translations for software managed TLB configurations.
  84. The sparc64 port currently does this.
  85. Next, we have the cache flushing interfaces. In general, when Linux
  86. is changing an existing virtual-->physical mapping to a new value,
  87. the sequence will be in one of the following forms::
  88. 1) flush_cache_mm(mm);
  89. change_all_page_tables_of(mm);
  90. flush_tlb_mm(mm);
  91. 2) flush_cache_range(vma, start, end);
  92. change_range_of_page_tables(mm, start, end);
  93. flush_tlb_range(vma, start, end);
  94. 3) flush_cache_page(vma, addr, pfn);
  95. set_pte(pte_pointer, new_pte_val);
  96. flush_tlb_page(vma, addr);
  97. The cache level flush will always be first, because this allows
  98. us to properly handle systems whose caches are strict and require
  99. a virtual-->physical translation to exist for a virtual address
  100. when that virtual address is flushed from the cache. The HyperSparc
  101. cpu is one such cpu with this attribute.
  102. The cache flushing routines below need only deal with cache flushing
  103. to the extent that it is necessary for a particular cpu. Mostly,
  104. these routines must be implemented for cpus which have virtually
  105. indexed caches which must be flushed when virtual-->physical
  106. translations are changed or removed. So, for example, the physically
  107. indexed physically tagged caches of IA32 processors have no need to
  108. implement these interfaces since the caches are fully synchronized
  109. and have no dependency on translation information.
  110. Here are the routines, one by one:
  111. 1) ``void flush_cache_mm(struct mm_struct *mm)``
  112. This interface flushes an entire user address space from
  113. the caches. That is, after running, there will be no cache
  114. lines associated with 'mm'.
  115. This interface is used to handle whole address space
  116. page table operations such as what happens during exit and exec.
  117. 2) ``void flush_cache_dup_mm(struct mm_struct *mm)``
  118. This interface flushes an entire user address space from
  119. the caches. That is, after running, there will be no cache
  120. lines associated with 'mm'.
  121. This interface is used to handle whole address space
  122. page table operations such as what happens during fork.
  123. This option is separate from flush_cache_mm to allow some
  124. optimizations for VIPT caches.
  125. 3) ``void flush_cache_range(struct vm_area_struct *vma,
  126. unsigned long start, unsigned long end)``
  127. Here we are flushing a specific range of (user) virtual
  128. addresses from the cache. After running, there will be no
  129. entries in the cache for 'vma->vm_mm' for virtual addresses in
  130. the range 'start' to 'end-1'.
  131. The "vma" is the backing store being used for the region.
  132. Primarily, this is used for munmap() type operations.
  133. The interface is provided in hopes that the port can find
  134. a suitably efficient method for removing multiple page
  135. sized regions from the cache, instead of having the kernel
  136. call flush_cache_page (see below) for each entry which may be
  137. modified.
  138. 4) ``void flush_cache_page(struct vm_area_struct *vma, unsigned long addr, unsigned long pfn)``
  139. This time we need to remove a PAGE_SIZE sized range
  140. from the cache. The 'vma' is the backing structure used by
  141. Linux to keep track of mmap'd regions for a process, the
  142. address space is available via vma->vm_mm. Also, one may
  143. test (vma->vm_flags & VM_EXEC) to see if this region is
  144. executable (and thus could be in the 'instruction cache' in
  145. "Harvard" type cache layouts).
  146. The 'pfn' indicates the physical page frame (shift this value
  147. left by PAGE_SHIFT to get the physical address) that 'addr'
  148. translates to. It is this mapping which should be removed from
  149. the cache.
  150. After running, there will be no entries in the cache for
  151. 'vma->vm_mm' for virtual address 'addr' which translates
  152. to 'pfn'.
  153. This is used primarily during fault processing.
  154. 5) ``void flush_cache_kmaps(void)``
  155. This routine need only be implemented if the platform utilizes
  156. highmem. It will be called right before all of the kmaps
  157. are invalidated.
  158. After running, there will be no entries in the cache for
  159. the kernel virtual address range PKMAP_ADDR(0) to
  160. PKMAP_ADDR(LAST_PKMAP).
  161. This routing should be implemented in asm/highmem.h
  162. 6) ``void flush_cache_vmap(unsigned long start, unsigned long end)``
  163. ``void flush_cache_vunmap(unsigned long start, unsigned long end)``
  164. Here in these two interfaces we are flushing a specific range
  165. of (kernel) virtual addresses from the cache. After running,
  166. there will be no entries in the cache for the kernel address
  167. space for virtual addresses in the range 'start' to 'end-1'.
  168. The first of these two routines is invoked after vmap_range()
  169. has installed the page table entries. The second is invoked
  170. before vunmap_range() deletes the page table entries.
  171. There exists another whole class of cpu cache issues which currently
  172. require a whole different set of interfaces to handle properly.
  173. The biggest problem is that of virtual aliasing in the data cache
  174. of a processor.
  175. Is your port susceptible to virtual aliasing in its D-cache?
  176. Well, if your D-cache is virtually indexed, is larger in size than
  177. PAGE_SIZE, and does not prevent multiple cache lines for the same
  178. physical address from existing at once, you have this problem.
  179. If your D-cache has this problem, first define asm/shmparam.h SHMLBA
  180. properly, it should essentially be the size of your virtually
  181. addressed D-cache (or if the size is variable, the largest possible
  182. size). This setting will force the SYSv IPC layer to only allow user
  183. processes to mmap shared memory at address which are a multiple of
  184. this value.
  185. .. note::
  186. This does not fix shared mmaps, check out the sparc64 port for
  187. one way to solve this (in particular SPARC_FLAG_MMAPSHARED).
  188. Next, you have to solve the D-cache aliasing issue for all
  189. other cases. Please keep in mind that fact that, for a given page
  190. mapped into some user address space, there is always at least one more
  191. mapping, that of the kernel in its linear mapping starting at
  192. PAGE_OFFSET. So immediately, once the first user maps a given
  193. physical page into its address space, by implication the D-cache
  194. aliasing problem has the potential to exist since the kernel already
  195. maps this page at its virtual address.
  196. ``void copy_user_page(void *to, void *from, unsigned long addr, struct page *page)``
  197. ``void clear_user_page(void *to, unsigned long addr, struct page *page)``
  198. These two routines store data in user anonymous or COW
  199. pages. It allows a port to efficiently avoid D-cache alias
  200. issues between userspace and the kernel.
  201. For example, a port may temporarily map 'from' and 'to' to
  202. kernel virtual addresses during the copy. The virtual address
  203. for these two pages is chosen in such a way that the kernel
  204. load/store instructions happen to virtual addresses which are
  205. of the same "color" as the user mapping of the page. Sparc64
  206. for example, uses this technique.
  207. The 'addr' parameter tells the virtual address where the
  208. user will ultimately have this page mapped, and the 'page'
  209. parameter gives a pointer to the struct page of the target.
  210. If D-cache aliasing is not an issue, these two routines may
  211. simply call memcpy/memset directly and do nothing more.
  212. ``void flush_dcache_folio(struct folio *folio)``
  213. This routines must be called when:
  214. a) the kernel did write to a page that is in the page cache page
  215. and / or in high memory
  216. b) the kernel is about to read from a page cache page and user space
  217. shared/writable mappings of this page potentially exist. Note
  218. that {get,pin}_user_pages{_fast} already call flush_dcache_folio
  219. on any page found in the user address space and thus driver
  220. code rarely needs to take this into account.
  221. .. note::
  222. This routine need only be called for page cache pages
  223. which can potentially ever be mapped into the address
  224. space of a user process. So for example, VFS layer code
  225. handling vfs symlinks in the page cache need not call
  226. this interface at all.
  227. The phrase "kernel writes to a page cache page" means, specifically,
  228. that the kernel executes store instructions that dirty data in that
  229. page at the kernel virtual mapping of that page. It is important to
  230. flush here to handle D-cache aliasing, to make sure these kernel stores
  231. are visible to user space mappings of that page.
  232. The corollary case is just as important, if there are users which have
  233. shared+writable mappings of this file, we must make sure that kernel
  234. reads of these pages will see the most recent stores done by the user.
  235. If D-cache aliasing is not an issue, this routine may simply be defined
  236. as a nop on that architecture.
  237. There is a bit set aside in folio->flags (PG_arch_1) as "architecture
  238. private". The kernel guarantees that, for pagecache pages, it will
  239. clear this bit when such a page first enters the pagecache.
  240. This allows these interfaces to be implemented much more
  241. efficiently. It allows one to "defer" (perhaps indefinitely) the
  242. actual flush if there are currently no user processes mapping this
  243. page. See sparc64's flush_dcache_folio and update_mmu_cache_range
  244. implementations for an example of how to go about doing this.
  245. The idea is, first at flush_dcache_folio() time, if
  246. folio_flush_mapping() returns a mapping, and mapping_mapped() on that
  247. mapping returns %false, just mark the architecture private page
  248. flag bit. Later, in update_mmu_cache_range(), a check is made
  249. of this flag bit, and if set the flush is done and the flag bit
  250. is cleared.
  251. .. important::
  252. It is often important, if you defer the flush,
  253. that the actual flush occurs on the same CPU
  254. as did the cpu stores into the page to make it
  255. dirty. Again, see sparc64 for examples of how
  256. to deal with this.
  257. ``void copy_to_user_page(struct vm_area_struct *vma, struct page *page,
  258. unsigned long user_vaddr, void *dst, void *src, int len)``
  259. ``void copy_from_user_page(struct vm_area_struct *vma, struct page *page,
  260. unsigned long user_vaddr, void *dst, void *src, int len)``
  261. When the kernel needs to copy arbitrary data in and out
  262. of arbitrary user pages (f.e. for ptrace()) it will use
  263. these two routines.
  264. Any necessary cache flushing or other coherency operations
  265. that need to occur should happen here. If the processor's
  266. instruction cache does not snoop cpu stores, it is very
  267. likely that you will need to flush the instruction cache
  268. for copy_to_user_page().
  269. ``void flush_anon_page(struct vm_area_struct *vma, struct page *page,
  270. unsigned long vmaddr)``
  271. When the kernel needs to access the contents of an anonymous
  272. page, it calls this function (currently only
  273. get_user_pages()). Note: flush_dcache_folio() deliberately
  274. doesn't work for an anonymous page. The default
  275. implementation is a nop (and should remain so for all coherent
  276. architectures). For incoherent architectures, it should flush
  277. the cache of the page at vmaddr.
  278. ``void flush_icache_range(unsigned long start, unsigned long end)``
  279. When the kernel stores into addresses that it will execute
  280. out of (eg when loading modules), this function is called.
  281. If the icache does not snoop stores then this routine will need
  282. to flush it.
  283. ``void flush_icache_page(struct vm_area_struct *vma, struct page *page)``
  284. All the functionality of flush_icache_page can be implemented in
  285. flush_dcache_folio and update_mmu_cache_range. In the future, the hope
  286. is to remove this interface completely.
  287. The final category of APIs is for I/O to deliberately aliased address
  288. ranges inside the kernel. Such aliases are set up by use of the
  289. vmap/vmalloc API. Since kernel I/O goes via physical pages, the I/O
  290. subsystem assumes that the user mapping and kernel offset mapping are
  291. the only aliases. This isn't true for vmap aliases, so anything in
  292. the kernel trying to do I/O to vmap areas must manually manage
  293. coherency. It must do this by flushing the vmap range before doing
  294. I/O and invalidating it after the I/O returns.
  295. ``void flush_kernel_vmap_range(void *vaddr, int size)``
  296. flushes the kernel cache for a given virtual address range in
  297. the vmap area. This is to make sure that any data the kernel
  298. modified in the vmap range is made visible to the physical
  299. page. The design is to make this area safe to perform I/O on.
  300. Note that this API does *not* also flush the offset map alias
  301. of the area.
  302. ``void invalidate_kernel_vmap_range(void *vaddr, int size) invalidates``
  303. the cache for a given virtual address range in the vmap area
  304. which prevents the processor from making the cache stale by
  305. speculatively reading data while the I/O was occurring to the
  306. physical pages. This is only necessary for data reads into the
  307. vmap area.