mmu.h 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408
  1. #ifndef _ASM_POWERPC_MMU_H_
  2. #define _ASM_POWERPC_MMU_H_
  3. #ifdef __KERNEL__
  4. #ifndef CONFIG_PPC64
  5. #include <asm-ppc/mmu.h>
  6. #else
  7. /*
  8. * PowerPC memory management structures
  9. *
  10. * Dave Engebretsen & Mike Corrigan <{engebret|mikejc}@us.ibm.com>
  11. * PPC64 rework.
  12. *
  13. * This program is free software; you can redistribute it and/or
  14. * modify it under the terms of the GNU General Public License
  15. * as published by the Free Software Foundation; either version
  16. * 2 of the License, or (at your option) any later version.
  17. */
  18. #include <asm/asm-compat.h>
  19. #include <asm/page.h>
  20. /*
  21. * Segment table
  22. */
  23. #define STE_ESID_V 0x80
  24. #define STE_ESID_KS 0x20
  25. #define STE_ESID_KP 0x10
  26. #define STE_ESID_N 0x08
  27. #define STE_VSID_SHIFT 12
  28. /* Location of cpu0's segment table */
  29. #define STAB0_PAGE 0x6
  30. #define STAB0_OFFSET (STAB0_PAGE << 12)
  31. #define STAB0_PHYS_ADDR (STAB0_OFFSET + PHYSICAL_START)
  32. #ifndef __ASSEMBLY__
  33. extern char initial_stab[];
  34. #endif /* ! __ASSEMBLY */
  35. /*
  36. * SLB
  37. */
  38. #define SLB_NUM_BOLTED 3
  39. #define SLB_CACHE_ENTRIES 8
  40. /* Bits in the SLB ESID word */
  41. #define SLB_ESID_V ASM_CONST(0x0000000008000000) /* valid */
  42. /* Bits in the SLB VSID word */
  43. #define SLB_VSID_SHIFT 12
  44. #define SLB_VSID_B ASM_CONST(0xc000000000000000)
  45. #define SLB_VSID_B_256M ASM_CONST(0x0000000000000000)
  46. #define SLB_VSID_B_1T ASM_CONST(0x4000000000000000)
  47. #define SLB_VSID_KS ASM_CONST(0x0000000000000800)
  48. #define SLB_VSID_KP ASM_CONST(0x0000000000000400)
  49. #define SLB_VSID_N ASM_CONST(0x0000000000000200) /* no-execute */
  50. #define SLB_VSID_L ASM_CONST(0x0000000000000100)
  51. #define SLB_VSID_C ASM_CONST(0x0000000000000080) /* class */
  52. #define SLB_VSID_LP ASM_CONST(0x0000000000000030)
  53. #define SLB_VSID_LP_00 ASM_CONST(0x0000000000000000)
  54. #define SLB_VSID_LP_01 ASM_CONST(0x0000000000000010)
  55. #define SLB_VSID_LP_10 ASM_CONST(0x0000000000000020)
  56. #define SLB_VSID_LP_11 ASM_CONST(0x0000000000000030)
  57. #define SLB_VSID_LLP (SLB_VSID_L|SLB_VSID_LP)
  58. #define SLB_VSID_KERNEL (SLB_VSID_KP)
  59. #define SLB_VSID_USER (SLB_VSID_KP|SLB_VSID_KS|SLB_VSID_C)
  60. #define SLBIE_C (0x08000000)
  61. /*
  62. * Hash table
  63. */
  64. #define HPTES_PER_GROUP 8
  65. #define HPTE_V_AVPN_SHIFT 7
  66. #define HPTE_V_AVPN ASM_CONST(0xffffffffffffff80)
  67. #define HPTE_V_AVPN_VAL(x) (((x) & HPTE_V_AVPN) >> HPTE_V_AVPN_SHIFT)
  68. #define HPTE_V_COMPARE(x,y) (!(((x) ^ (y)) & HPTE_V_AVPN))
  69. #define HPTE_V_BOLTED ASM_CONST(0x0000000000000010)
  70. #define HPTE_V_LOCK ASM_CONST(0x0000000000000008)
  71. #define HPTE_V_LARGE ASM_CONST(0x0000000000000004)
  72. #define HPTE_V_SECONDARY ASM_CONST(0x0000000000000002)
  73. #define HPTE_V_VALID ASM_CONST(0x0000000000000001)
  74. #define HPTE_R_PP0 ASM_CONST(0x8000000000000000)
  75. #define HPTE_R_TS ASM_CONST(0x4000000000000000)
  76. #define HPTE_R_RPN_SHIFT 12
  77. #define HPTE_R_RPN ASM_CONST(0x3ffffffffffff000)
  78. #define HPTE_R_FLAGS ASM_CONST(0x00000000000003ff)
  79. #define HPTE_R_PP ASM_CONST(0x0000000000000003)
  80. #define HPTE_R_N ASM_CONST(0x0000000000000004)
  81. /* Values for PP (assumes Ks=0, Kp=1) */
  82. /* pp0 will always be 0 for linux */
  83. #define PP_RWXX 0 /* Supervisor read/write, User none */
  84. #define PP_RWRX 1 /* Supervisor read/write, User read */
  85. #define PP_RWRW 2 /* Supervisor read/write, User read/write */
  86. #define PP_RXRX 3 /* Supervisor read, User read */
  87. #ifndef __ASSEMBLY__
  88. typedef struct {
  89. unsigned long v;
  90. unsigned long r;
  91. } hpte_t;
  92. extern hpte_t *htab_address;
  93. extern unsigned long htab_size_bytes;
  94. extern unsigned long htab_hash_mask;
  95. /*
  96. * Page size definition
  97. *
  98. * shift : is the "PAGE_SHIFT" value for that page size
  99. * sllp : is a bit mask with the value of SLB L || LP to be or'ed
  100. * directly to a slbmte "vsid" value
  101. * penc : is the HPTE encoding mask for the "LP" field:
  102. *
  103. */
  104. struct mmu_psize_def
  105. {
  106. unsigned int shift; /* number of bits */
  107. unsigned int penc; /* HPTE encoding */
  108. unsigned int tlbiel; /* tlbiel supported for that page size */
  109. unsigned long avpnm; /* bits to mask out in AVPN in the HPTE */
  110. unsigned long sllp; /* SLB L||LP (exact mask to use in slbmte) */
  111. };
  112. #endif /* __ASSEMBLY__ */
  113. /*
  114. * The kernel use the constants below to index in the page sizes array.
  115. * The use of fixed constants for this purpose is better for performances
  116. * of the low level hash refill handlers.
  117. *
  118. * A non supported page size has a "shift" field set to 0
  119. *
  120. * Any new page size being implemented can get a new entry in here. Whether
  121. * the kernel will use it or not is a different matter though. The actual page
  122. * size used by hugetlbfs is not defined here and may be made variable
  123. */
  124. #define MMU_PAGE_4K 0 /* 4K */
  125. #define MMU_PAGE_64K 1 /* 64K */
  126. #define MMU_PAGE_64K_AP 2 /* 64K Admixed (in a 4K segment) */
  127. #define MMU_PAGE_1M 3 /* 1M */
  128. #define MMU_PAGE_16M 4 /* 16M */
  129. #define MMU_PAGE_16G 5 /* 16G */
  130. #define MMU_PAGE_COUNT 6
  131. #ifndef __ASSEMBLY__
  132. /*
  133. * The current system page sizes
  134. */
  135. extern struct mmu_psize_def mmu_psize_defs[MMU_PAGE_COUNT];
  136. extern int mmu_linear_psize;
  137. extern int mmu_virtual_psize;
  138. #ifdef CONFIG_HUGETLB_PAGE
  139. /*
  140. * The page size index of the huge pages for use by hugetlbfs
  141. */
  142. extern int mmu_huge_psize;
  143. #endif /* CONFIG_HUGETLB_PAGE */
  144. /*
  145. * This function sets the AVPN and L fields of the HPTE appropriately
  146. * for the page size
  147. */
  148. static inline unsigned long hpte_encode_v(unsigned long va, int psize)
  149. {
  150. unsigned long v =
  151. v = (va >> 23) & ~(mmu_psize_defs[psize].avpnm);
  152. v <<= HPTE_V_AVPN_SHIFT;
  153. if (psize != MMU_PAGE_4K)
  154. v |= HPTE_V_LARGE;
  155. return v;
  156. }
  157. /*
  158. * This function sets the ARPN, and LP fields of the HPTE appropriately
  159. * for the page size. We assume the pa is already "clean" that is properly
  160. * aligned for the requested page size
  161. */
  162. static inline unsigned long hpte_encode_r(unsigned long pa, int psize)
  163. {
  164. unsigned long r;
  165. /* A 4K page needs no special encoding */
  166. if (psize == MMU_PAGE_4K)
  167. return pa & HPTE_R_RPN;
  168. else {
  169. unsigned int penc = mmu_psize_defs[psize].penc;
  170. unsigned int shift = mmu_psize_defs[psize].shift;
  171. return (pa & ~((1ul << shift) - 1)) | (penc << 12);
  172. }
  173. return r;
  174. }
  175. /*
  176. * This hashes a virtual address for a 256Mb segment only for now
  177. */
  178. static inline unsigned long hpt_hash(unsigned long va, unsigned int shift)
  179. {
  180. return ((va >> 28) & 0x7fffffffffUL) ^ ((va & 0x0fffffffUL) >> shift);
  181. }
  182. extern int __hash_page_4K(unsigned long ea, unsigned long access,
  183. unsigned long vsid, pte_t *ptep, unsigned long trap,
  184. unsigned int local);
  185. extern int __hash_page_64K(unsigned long ea, unsigned long access,
  186. unsigned long vsid, pte_t *ptep, unsigned long trap,
  187. unsigned int local);
  188. struct mm_struct;
  189. extern int hash_huge_page(struct mm_struct *mm, unsigned long access,
  190. unsigned long ea, unsigned long vsid, int local,
  191. unsigned long trap);
  192. extern void htab_finish_init(void);
  193. extern int htab_bolt_mapping(unsigned long vstart, unsigned long vend,
  194. unsigned long pstart, unsigned long mode,
  195. int psize);
  196. extern void htab_initialize(void);
  197. extern void htab_initialize_secondary(void);
  198. extern void hpte_init_native(void);
  199. extern void hpte_init_lpar(void);
  200. extern void hpte_init_iSeries(void);
  201. extern void mm_init_ppc64(void);
  202. extern long pSeries_lpar_hpte_insert(unsigned long hpte_group,
  203. unsigned long va, unsigned long prpn,
  204. unsigned long rflags,
  205. unsigned long vflags, int psize);
  206. extern long native_hpte_insert(unsigned long hpte_group,
  207. unsigned long va, unsigned long prpn,
  208. unsigned long rflags,
  209. unsigned long vflags, int psize);
  210. extern long iSeries_hpte_insert(unsigned long hpte_group,
  211. unsigned long va, unsigned long prpn,
  212. unsigned long rflags,
  213. unsigned long vflags, int psize);
  214. extern void stabs_alloc(void);
  215. extern void slb_initialize(void);
  216. extern void stab_initialize(unsigned long stab);
  217. #endif /* __ASSEMBLY__ */
  218. /*
  219. * VSID allocation
  220. *
  221. * We first generate a 36-bit "proto-VSID". For kernel addresses this
  222. * is equal to the ESID, for user addresses it is:
  223. * (context << 15) | (esid & 0x7fff)
  224. *
  225. * The two forms are distinguishable because the top bit is 0 for user
  226. * addresses, whereas the top two bits are 1 for kernel addresses.
  227. * Proto-VSIDs with the top two bits equal to 0b10 are reserved for
  228. * now.
  229. *
  230. * The proto-VSIDs are then scrambled into real VSIDs with the
  231. * multiplicative hash:
  232. *
  233. * VSID = (proto-VSID * VSID_MULTIPLIER) % VSID_MODULUS
  234. * where VSID_MULTIPLIER = 268435399 = 0xFFFFFC7
  235. * VSID_MODULUS = 2^36-1 = 0xFFFFFFFFF
  236. *
  237. * This scramble is only well defined for proto-VSIDs below
  238. * 0xFFFFFFFFF, so both proto-VSID and actual VSID 0xFFFFFFFFF are
  239. * reserved. VSID_MULTIPLIER is prime, so in particular it is
  240. * co-prime to VSID_MODULUS, making this a 1:1 scrambling function.
  241. * Because the modulus is 2^n-1 we can compute it efficiently without
  242. * a divide or extra multiply (see below).
  243. *
  244. * This scheme has several advantages over older methods:
  245. *
  246. * - We have VSIDs allocated for every kernel address
  247. * (i.e. everything above 0xC000000000000000), except the very top
  248. * segment, which simplifies several things.
  249. *
  250. * - We allow for 15 significant bits of ESID and 20 bits of
  251. * context for user addresses. i.e. 8T (43 bits) of address space for
  252. * up to 1M contexts (although the page table structure and context
  253. * allocation will need changes to take advantage of this).
  254. *
  255. * - The scramble function gives robust scattering in the hash
  256. * table (at least based on some initial results). The previous
  257. * method was more susceptible to pathological cases giving excessive
  258. * hash collisions.
  259. */
  260. /*
  261. * WARNING - If you change these you must make sure the asm
  262. * implementations in slb_allocate (slb_low.S), do_stab_bolted
  263. * (head.S) and ASM_VSID_SCRAMBLE (below) are changed accordingly.
  264. *
  265. * You'll also need to change the precomputed VSID values in head.S
  266. * which are used by the iSeries firmware.
  267. */
  268. #define VSID_MULTIPLIER ASM_CONST(200730139) /* 28-bit prime */
  269. #define VSID_BITS 36
  270. #define VSID_MODULUS ((1UL<<VSID_BITS)-1)
  271. #define CONTEXT_BITS 19
  272. #define USER_ESID_BITS 16
  273. #define USER_VSID_RANGE (1UL << (USER_ESID_BITS + SID_SHIFT))
  274. /*
  275. * This macro generates asm code to compute the VSID scramble
  276. * function. Used in slb_allocate() and do_stab_bolted. The function
  277. * computed is: (protovsid*VSID_MULTIPLIER) % VSID_MODULUS
  278. *
  279. * rt = register continaing the proto-VSID and into which the
  280. * VSID will be stored
  281. * rx = scratch register (clobbered)
  282. *
  283. * - rt and rx must be different registers
  284. * - The answer will end up in the low 36 bits of rt. The higher
  285. * bits may contain other garbage, so you may need to mask the
  286. * result.
  287. */
  288. #define ASM_VSID_SCRAMBLE(rt, rx) \
  289. lis rx,VSID_MULTIPLIER@h; \
  290. ori rx,rx,VSID_MULTIPLIER@l; \
  291. mulld rt,rt,rx; /* rt = rt * MULTIPLIER */ \
  292. \
  293. srdi rx,rt,VSID_BITS; \
  294. clrldi rt,rt,(64-VSID_BITS); \
  295. add rt,rt,rx; /* add high and low bits */ \
  296. /* Now, r3 == VSID (mod 2^36-1), and lies between 0 and \
  297. * 2^36-1+2^28-1. That in particular means that if r3 >= \
  298. * 2^36-1, then r3+1 has the 2^36 bit set. So, if r3+1 has \
  299. * the bit clear, r3 already has the answer we want, if it \
  300. * doesn't, the answer is the low 36 bits of r3+1. So in all \
  301. * cases the answer is the low 36 bits of (r3 + ((r3+1) >> 36))*/\
  302. addi rx,rt,1; \
  303. srdi rx,rx,VSID_BITS; /* extract 2^36 bit */ \
  304. add rt,rt,rx
  305. #ifndef __ASSEMBLY__
  306. typedef unsigned long mm_context_id_t;
  307. typedef struct {
  308. mm_context_id_t id;
  309. #ifdef CONFIG_HUGETLB_PAGE
  310. u16 low_htlb_areas, high_htlb_areas;
  311. #endif
  312. } mm_context_t;
  313. static inline unsigned long vsid_scramble(unsigned long protovsid)
  314. {
  315. #if 0
  316. /* The code below is equivalent to this function for arguments
  317. * < 2^VSID_BITS, which is all this should ever be called
  318. * with. However gcc is not clever enough to compute the
  319. * modulus (2^n-1) without a second multiply. */
  320. return ((protovsid * VSID_MULTIPLIER) % VSID_MODULUS);
  321. #else /* 1 */
  322. unsigned long x;
  323. x = protovsid * VSID_MULTIPLIER;
  324. x = (x >> VSID_BITS) + (x & VSID_MODULUS);
  325. return (x + ((x+1) >> VSID_BITS)) & VSID_MODULUS;
  326. #endif /* 1 */
  327. }
  328. /* This is only valid for addresses >= KERNELBASE */
  329. static inline unsigned long get_kernel_vsid(unsigned long ea)
  330. {
  331. return vsid_scramble(ea >> SID_SHIFT);
  332. }
  333. /* This is only valid for user addresses (which are below 2^41) */
  334. static inline unsigned long get_vsid(unsigned long context, unsigned long ea)
  335. {
  336. return vsid_scramble((context << USER_ESID_BITS)
  337. | (ea >> SID_SHIFT));
  338. }
  339. #define VSID_SCRAMBLE(pvsid) (((pvsid) * VSID_MULTIPLIER) % VSID_MODULUS)
  340. #define KERNEL_VSID(ea) VSID_SCRAMBLE(GET_ESID(ea))
  341. /* Physical address used by some IO functions */
  342. typedef unsigned long phys_addr_t;
  343. #endif /* __ASSEMBLY */
  344. #endif /* CONFIG_PPC64 */
  345. #endif /* __KERNEL__ */
  346. #endif /* _ASM_POWERPC_MMU_H_ */