tlb.h 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168
  1. #ifndef _S390_TLB_H
  2. #define _S390_TLB_H
  3. /*
  4. * TLB flushing on s390 is complicated. The following requirement
  5. * from the principles of operation is the most arduous:
  6. *
  7. * "A valid table entry must not be changed while it is attached
  8. * to any CPU and may be used for translation by that CPU except to
  9. * (1) invalidate the entry by using INVALIDATE PAGE TABLE ENTRY,
  10. * or INVALIDATE DAT TABLE ENTRY, (2) alter bits 56-63 of a page
  11. * table entry, or (3) make a change by means of a COMPARE AND SWAP
  12. * AND PURGE instruction that purges the TLB."
  13. *
  14. * The modification of a pte of an active mm struct therefore is
  15. * a two step process: i) invalidate the pte, ii) store the new pte.
  16. * This is true for the page protection bit as well.
  17. * The only possible optimization is to flush at the beginning of
  18. * a tlb_gather_mmu cycle if the mm_struct is currently not in use.
  19. *
  20. * Pages used for the page tables is a different story. FIXME: more
  21. */
  22. #include <linux/mm.h>
  23. #include <linux/pagemap.h>
  24. #include <linux/swap.h>
  25. #include <asm/processor.h>
  26. #include <asm/pgalloc.h>
  27. #include <asm/tlbflush.h>
  28. struct mmu_gather {
  29. struct mm_struct *mm;
  30. struct mmu_table_batch *batch;
  31. unsigned int fullmm;
  32. unsigned long start, end;
  33. };
  34. struct mmu_table_batch {
  35. struct rcu_head rcu;
  36. unsigned int nr;
  37. void *tables[0];
  38. };
  39. #define MAX_TABLE_BATCH \
  40. ((PAGE_SIZE - sizeof(struct mmu_table_batch)) / sizeof(void *))
  41. extern void tlb_table_flush(struct mmu_gather *tlb);
  42. extern void tlb_remove_table(struct mmu_gather *tlb, void *table);
  43. static inline void tlb_gather_mmu(struct mmu_gather *tlb,
  44. struct mm_struct *mm,
  45. unsigned long start,
  46. unsigned long end)
  47. {
  48. tlb->mm = mm;
  49. tlb->start = start;
  50. tlb->end = end;
  51. tlb->fullmm = !(start | (end+1));
  52. tlb->batch = NULL;
  53. }
  54. static inline void tlb_flush_mmu_tlbonly(struct mmu_gather *tlb)
  55. {
  56. __tlb_flush_mm_lazy(tlb->mm);
  57. }
  58. static inline void tlb_flush_mmu_free(struct mmu_gather *tlb)
  59. {
  60. tlb_table_flush(tlb);
  61. }
  62. static inline void tlb_flush_mmu(struct mmu_gather *tlb)
  63. {
  64. tlb_flush_mmu_tlbonly(tlb);
  65. tlb_flush_mmu_free(tlb);
  66. }
  67. static inline void tlb_finish_mmu(struct mmu_gather *tlb,
  68. unsigned long start, unsigned long end)
  69. {
  70. tlb_flush_mmu(tlb);
  71. }
  72. /*
  73. * Release the page cache reference for a pte removed by
  74. * tlb_ptep_clear_flush. In both flush modes the tlb for a page cache page
  75. * has already been freed, so just do free_page_and_swap_cache.
  76. */
  77. static inline bool __tlb_remove_page(struct mmu_gather *tlb, struct page *page)
  78. {
  79. free_page_and_swap_cache(page);
  80. return false; /* avoid calling tlb_flush_mmu */
  81. }
  82. static inline void tlb_remove_page(struct mmu_gather *tlb, struct page *page)
  83. {
  84. free_page_and_swap_cache(page);
  85. }
  86. static inline bool __tlb_remove_page_size(struct mmu_gather *tlb,
  87. struct page *page, int page_size)
  88. {
  89. return __tlb_remove_page(tlb, page);
  90. }
  91. static inline void tlb_remove_page_size(struct mmu_gather *tlb,
  92. struct page *page, int page_size)
  93. {
  94. return tlb_remove_page(tlb, page);
  95. }
  96. /*
  97. * pte_free_tlb frees a pte table and clears the CRSTE for the
  98. * page table from the tlb.
  99. */
  100. static inline void pte_free_tlb(struct mmu_gather *tlb, pgtable_t pte,
  101. unsigned long address)
  102. {
  103. page_table_free_rcu(tlb, (unsigned long *) pte, address);
  104. }
  105. /*
  106. * pmd_free_tlb frees a pmd table and clears the CRSTE for the
  107. * segment table entry from the tlb.
  108. * If the mm uses a two level page table the single pmd is freed
  109. * as the pgd. pmd_free_tlb checks the asce_limit against 2GB
  110. * to avoid the double free of the pmd in this case.
  111. */
  112. static inline void pmd_free_tlb(struct mmu_gather *tlb, pmd_t *pmd,
  113. unsigned long address)
  114. {
  115. if (tlb->mm->context.asce_limit <= (1UL << 31))
  116. return;
  117. pgtable_pmd_page_dtor(virt_to_page(pmd));
  118. tlb_remove_table(tlb, pmd);
  119. }
  120. /*
  121. * pud_free_tlb frees a pud table and clears the CRSTE for the
  122. * region third table entry from the tlb.
  123. * If the mm uses a three level page table the single pud is freed
  124. * as the pgd. pud_free_tlb checks the asce_limit against 4TB
  125. * to avoid the double free of the pud in this case.
  126. */
  127. static inline void pud_free_tlb(struct mmu_gather *tlb, pud_t *pud,
  128. unsigned long address)
  129. {
  130. if (tlb->mm->context.asce_limit <= (1UL << 42))
  131. return;
  132. tlb_remove_table(tlb, pud);
  133. }
  134. #define tlb_start_vma(tlb, vma) do { } while (0)
  135. #define tlb_end_vma(tlb, vma) do { } while (0)
  136. #define tlb_remove_tlb_entry(tlb, ptep, addr) do { } while (0)
  137. #define tlb_remove_pmd_tlb_entry(tlb, pmdp, addr) do { } while (0)
  138. #define tlb_migrate_finish(mm) do { } while (0)
  139. #define tlb_remove_huge_tlb_entry(h, tlb, ptep, address) \
  140. tlb_remove_tlb_entry(tlb, ptep, address)
  141. #define tlb_remove_check_page_size_change tlb_remove_check_page_size_change
  142. static inline void tlb_remove_check_page_size_change(struct mmu_gather *tlb,
  143. unsigned int page_size)
  144. {
  145. }
  146. #endif /* _S390_TLB_H */