blob: 8853974201046cc2a1535b3127fcb3344887bea8 [file] [log] [blame]
Paul Mackerras047ea782005-11-19 20:17:32 +11001#ifndef _ASM_POWERPC_MMU_H_
2#define _ASM_POWERPC_MMU_H_
Arnd Bergmann88ced032005-12-16 22:43:46 +01003#ifdef __KERNEL__
Paul Mackerras047ea782005-11-19 20:17:32 +11004
5#ifndef CONFIG_PPC64
6#include <asm-ppc/mmu.h>
7#else
8
Linus Torvalds1da177e2005-04-16 15:20:36 -07009/*
10 * PowerPC memory management structures
11 *
12 * Dave Engebretsen & Mike Corrigan <{engebret|mikejc}@us.ibm.com>
13 * PPC64 rework.
14 *
15 * This program is free software; you can redistribute it and/or
16 * modify it under the terms of the GNU General Public License
17 * as published by the Free Software Foundation; either version
18 * 2 of the License, or (at your option) any later version.
19 */
20
David Gibson3ddfbcf2005-11-10 12:56:55 +110021#include <asm/asm-compat.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070022#include <asm/page.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070023
David Gibson1f8d4192005-05-05 16:15:13 -070024/*
25 * Segment table
26 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070027
28#define STE_ESID_V 0x80
29#define STE_ESID_KS 0x20
30#define STE_ESID_KP 0x10
31#define STE_ESID_N 0x08
32
33#define STE_VSID_SHIFT 12
34
David Gibson1f8d4192005-05-05 16:15:13 -070035/* Location of cpu0's segment table */
David Gibsonc59c4642005-08-19 14:52:31 +100036#define STAB0_PAGE 0x6
Michael Ellerman758438a2005-12-05 15:49:00 -060037#define STAB0_OFFSET (STAB0_PAGE << 12)
38#define STAB0_PHYS_ADDR (STAB0_OFFSET + PHYSICAL_START)
David Gibsonc59c4642005-08-19 14:52:31 +100039
40#ifndef __ASSEMBLY__
41extern char initial_stab[];
42#endif /* ! __ASSEMBLY */
Linus Torvalds1da177e2005-04-16 15:20:36 -070043
David Gibson1f8d4192005-05-05 16:15:13 -070044/*
45 * SLB
46 */
47
48#define SLB_NUM_BOLTED 3
49#define SLB_CACHE_ENTRIES 8
50
51/* Bits in the SLB ESID word */
52#define SLB_ESID_V ASM_CONST(0x0000000008000000) /* valid */
53
54/* Bits in the SLB VSID word */
55#define SLB_VSID_SHIFT 12
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +110056#define SLB_VSID_B ASM_CONST(0xc000000000000000)
57#define SLB_VSID_B_256M ASM_CONST(0x0000000000000000)
58#define SLB_VSID_B_1T ASM_CONST(0x4000000000000000)
David Gibson1f8d4192005-05-05 16:15:13 -070059#define SLB_VSID_KS ASM_CONST(0x0000000000000800)
60#define SLB_VSID_KP ASM_CONST(0x0000000000000400)
61#define SLB_VSID_N ASM_CONST(0x0000000000000200) /* no-execute */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +110062#define SLB_VSID_L ASM_CONST(0x0000000000000100)
David Gibson1f8d4192005-05-05 16:15:13 -070063#define SLB_VSID_C ASM_CONST(0x0000000000000080) /* class */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +110064#define SLB_VSID_LP ASM_CONST(0x0000000000000030)
65#define SLB_VSID_LP_00 ASM_CONST(0x0000000000000000)
66#define SLB_VSID_LP_01 ASM_CONST(0x0000000000000010)
67#define SLB_VSID_LP_10 ASM_CONST(0x0000000000000020)
68#define SLB_VSID_LP_11 ASM_CONST(0x0000000000000030)
69#define SLB_VSID_LLP (SLB_VSID_L|SLB_VSID_LP)
70
David Gibson14b34662005-09-06 14:59:47 +100071#define SLB_VSID_KERNEL (SLB_VSID_KP)
72#define SLB_VSID_USER (SLB_VSID_KP|SLB_VSID_KS|SLB_VSID_C)
73
74#define SLBIE_C (0x08000000)
David Gibson1f8d4192005-05-05 16:15:13 -070075
76/*
77 * Hash table
78 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070079
80#define HPTES_PER_GROUP 8
81
David Gibson96e28442005-07-13 01:11:42 -070082#define HPTE_V_AVPN_SHIFT 7
83#define HPTE_V_AVPN ASM_CONST(0xffffffffffffff80)
84#define HPTE_V_AVPN_VAL(x) (((x) & HPTE_V_AVPN) >> HPTE_V_AVPN_SHIFT)
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +110085#define HPTE_V_COMPARE(x,y) (!(((x) ^ (y)) & HPTE_V_AVPN))
David Gibson96e28442005-07-13 01:11:42 -070086#define HPTE_V_BOLTED ASM_CONST(0x0000000000000010)
87#define HPTE_V_LOCK ASM_CONST(0x0000000000000008)
88#define HPTE_V_LARGE ASM_CONST(0x0000000000000004)
89#define HPTE_V_SECONDARY ASM_CONST(0x0000000000000002)
90#define HPTE_V_VALID ASM_CONST(0x0000000000000001)
91
92#define HPTE_R_PP0 ASM_CONST(0x8000000000000000)
93#define HPTE_R_TS ASM_CONST(0x4000000000000000)
94#define HPTE_R_RPN_SHIFT 12
95#define HPTE_R_RPN ASM_CONST(0x3ffffffffffff000)
96#define HPTE_R_FLAGS ASM_CONST(0x00000000000003ff)
97#define HPTE_R_PP ASM_CONST(0x0000000000000003)
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +110098#define HPTE_R_N ASM_CONST(0x0000000000000004)
Benjamin Herrenschmidtc5cf0e32006-05-30 14:14:19 +100099#define HPTE_R_C ASM_CONST(0x0000000000000080)
100#define HPTE_R_R ASM_CONST(0x0000000000000100)
David Gibson96e28442005-07-13 01:11:42 -0700101
David Gibson1f8d4192005-05-05 16:15:13 -0700102/* Values for PP (assumes Ks=0, Kp=1) */
103/* pp0 will always be 0 for linux */
104#define PP_RWXX 0 /* Supervisor read/write, User none */
105#define PP_RWRX 1 /* Supervisor read/write, User read */
106#define PP_RWRW 2 /* Supervisor read/write, User read/write */
107#define PP_RXRX 3 /* Supervisor read, User read */
108
109#ifndef __ASSEMBLY__
110
Linus Torvalds1da177e2005-04-16 15:20:36 -0700111typedef struct {
David Gibson96e28442005-07-13 01:11:42 -0700112 unsigned long v;
113 unsigned long r;
114} hpte_t;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700115
David Gibson96e28442005-07-13 01:11:42 -0700116extern hpte_t *htab_address;
Michael Ellerman337a7122006-02-21 17:22:55 +1100117extern unsigned long htab_size_bytes;
David Gibson96e28442005-07-13 01:11:42 -0700118extern unsigned long htab_hash_mask;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700119
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100120/*
121 * Page size definition
122 *
123 * shift : is the "PAGE_SHIFT" value for that page size
124 * sllp : is a bit mask with the value of SLB L || LP to be or'ed
125 * directly to a slbmte "vsid" value
126 * penc : is the HPTE encoding mask for the "LP" field:
127 *
128 */
129struct mmu_psize_def
Linus Torvalds1da177e2005-04-16 15:20:36 -0700130{
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100131 unsigned int shift; /* number of bits */
132 unsigned int penc; /* HPTE encoding */
133 unsigned int tlbiel; /* tlbiel supported for that page size */
134 unsigned long avpnm; /* bits to mask out in AVPN in the HPTE */
135 unsigned long sllp; /* SLB L||LP (exact mask to use in slbmte) */
136};
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100138#endif /* __ASSEMBLY__ */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100140/*
141 * The kernel use the constants below to index in the page sizes array.
142 * The use of fixed constants for this purpose is better for performances
143 * of the low level hash refill handlers.
144 *
145 * A non supported page size has a "shift" field set to 0
146 *
147 * Any new page size being implemented can get a new entry in here. Whether
148 * the kernel will use it or not is a different matter though. The actual page
149 * size used by hugetlbfs is not defined here and may be made variable
150 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100152#define MMU_PAGE_4K 0 /* 4K */
153#define MMU_PAGE_64K 1 /* 64K */
154#define MMU_PAGE_64K_AP 2 /* 64K Admixed (in a 4K segment) */
155#define MMU_PAGE_1M 3 /* 1M */
156#define MMU_PAGE_16M 4 /* 16M */
157#define MMU_PAGE_16G 5 /* 16G */
158#define MMU_PAGE_COUNT 6
159
160#ifndef __ASSEMBLY__
161
162/*
163 * The current system page sizes
164 */
165extern struct mmu_psize_def mmu_psize_defs[MMU_PAGE_COUNT];
166extern int mmu_linear_psize;
167extern int mmu_virtual_psize;
168
169#ifdef CONFIG_HUGETLB_PAGE
170/*
171 * The page size index of the huge pages for use by hugetlbfs
172 */
173extern int mmu_huge_psize;
174
175#endif /* CONFIG_HUGETLB_PAGE */
176
177/*
178 * This function sets the AVPN and L fields of the HPTE appropriately
179 * for the page size
180 */
181static inline unsigned long hpte_encode_v(unsigned long va, int psize)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182{
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100183 unsigned long v =
184 v = (va >> 23) & ~(mmu_psize_defs[psize].avpnm);
185 v <<= HPTE_V_AVPN_SHIFT;
186 if (psize != MMU_PAGE_4K)
187 v |= HPTE_V_LARGE;
188 return v;
R Sharadaf4c82d52005-06-25 14:58:08 -0700189}
190
Linus Torvalds1da177e2005-04-16 15:20:36 -0700191/*
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100192 * This function sets the ARPN, and LP fields of the HPTE appropriately
193 * for the page size. We assume the pa is already "clean" that is properly
194 * aligned for the requested page size
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195 */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100196static inline unsigned long hpte_encode_r(unsigned long pa, int psize)
197{
198 unsigned long r;
199
200 /* A 4K page needs no special encoding */
201 if (psize == MMU_PAGE_4K)
202 return pa & HPTE_R_RPN;
203 else {
204 unsigned int penc = mmu_psize_defs[psize].penc;
205 unsigned int shift = mmu_psize_defs[psize].shift;
206 return (pa & ~((1ul << shift) - 1)) | (penc << 12);
207 }
208 return r;
209}
210
211/*
212 * This hashes a virtual address for a 256Mb segment only for now
213 */
214
215static inline unsigned long hpt_hash(unsigned long va, unsigned int shift)
216{
217 return ((va >> 28) & 0x7fffffffffUL) ^ ((va & 0x0fffffffUL) >> shift);
218}
219
220extern int __hash_page_4K(unsigned long ea, unsigned long access,
221 unsigned long vsid, pte_t *ptep, unsigned long trap,
222 unsigned int local);
223extern int __hash_page_64K(unsigned long ea, unsigned long access,
224 unsigned long vsid, pte_t *ptep, unsigned long trap,
225 unsigned int local);
226struct mm_struct;
227extern int hash_huge_page(struct mm_struct *mm, unsigned long access,
David Gibsoncbf52af2005-12-09 14:20:52 +1100228 unsigned long ea, unsigned long vsid, int local,
229 unsigned long trap);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700230
231extern void htab_finish_init(void);
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100232extern int htab_bolt_mapping(unsigned long vstart, unsigned long vend,
233 unsigned long pstart, unsigned long mode,
234 int psize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700235
Paul Mackerras799d6042005-11-10 13:37:51 +1100236extern void htab_initialize(void);
237extern void htab_initialize_secondary(void);
David Gibson1f8d4192005-05-05 16:15:13 -0700238extern void hpte_init_native(void);
239extern void hpte_init_lpar(void);
240extern void hpte_init_iSeries(void);
241
242extern long pSeries_lpar_hpte_insert(unsigned long hpte_group,
243 unsigned long va, unsigned long prpn,
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100244 unsigned long rflags,
245 unsigned long vflags, int psize);
David Gibson1f8d4192005-05-05 16:15:13 -0700246
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100247extern long native_hpte_insert(unsigned long hpte_group,
248 unsigned long va, unsigned long prpn,
249 unsigned long rflags,
250 unsigned long vflags, int psize);
251
252extern long iSeries_hpte_insert(unsigned long hpte_group,
253 unsigned long va, unsigned long prpn,
254 unsigned long rflags,
255 unsigned long vflags, int psize);
Michael Ellerman4c551302005-09-23 14:47:58 +1000256
David Gibson533f0812005-07-27 11:44:19 -0700257extern void stabs_alloc(void);
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100258extern void slb_initialize(void);
Paul Mackerras799d6042005-11-10 13:37:51 +1100259extern void stab_initialize(unsigned long stab);
David Gibson533f0812005-07-27 11:44:19 -0700260
Linus Torvalds1da177e2005-04-16 15:20:36 -0700261#endif /* __ASSEMBLY__ */
262
263/*
David Gibson1f8d4192005-05-05 16:15:13 -0700264 * VSID allocation
265 *
266 * We first generate a 36-bit "proto-VSID". For kernel addresses this
267 * is equal to the ESID, for user addresses it is:
268 * (context << 15) | (esid & 0x7fff)
269 *
270 * The two forms are distinguishable because the top bit is 0 for user
271 * addresses, whereas the top two bits are 1 for kernel addresses.
272 * Proto-VSIDs with the top two bits equal to 0b10 are reserved for
273 * now.
274 *
275 * The proto-VSIDs are then scrambled into real VSIDs with the
276 * multiplicative hash:
277 *
278 * VSID = (proto-VSID * VSID_MULTIPLIER) % VSID_MODULUS
279 * where VSID_MULTIPLIER = 268435399 = 0xFFFFFC7
280 * VSID_MODULUS = 2^36-1 = 0xFFFFFFFFF
281 *
282 * This scramble is only well defined for proto-VSIDs below
283 * 0xFFFFFFFFF, so both proto-VSID and actual VSID 0xFFFFFFFFF are
284 * reserved. VSID_MULTIPLIER is prime, so in particular it is
285 * co-prime to VSID_MODULUS, making this a 1:1 scrambling function.
286 * Because the modulus is 2^n-1 we can compute it efficiently without
287 * a divide or extra multiply (see below).
288 *
289 * This scheme has several advantages over older methods:
290 *
291 * - We have VSIDs allocated for every kernel address
292 * (i.e. everything above 0xC000000000000000), except the very top
293 * segment, which simplifies several things.
294 *
295 * - We allow for 15 significant bits of ESID and 20 bits of
296 * context for user addresses. i.e. 8T (43 bits) of address space for
297 * up to 1M contexts (although the page table structure and context
298 * allocation will need changes to take advantage of this).
299 *
300 * - The scramble function gives robust scattering in the hash
301 * table (at least based on some initial results). The previous
302 * method was more susceptible to pathological cases giving excessive
303 * hash collisions.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304 */
David Gibson1f8d4192005-05-05 16:15:13 -0700305/*
306 * WARNING - If you change these you must make sure the asm
307 * implementations in slb_allocate (slb_low.S), do_stab_bolted
308 * (head.S) and ASM_VSID_SCRAMBLE (below) are changed accordingly.
309 *
310 * You'll also need to change the precomputed VSID values in head.S
311 * which are used by the iSeries firmware.
312 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700313
314#define VSID_MULTIPLIER ASM_CONST(200730139) /* 28-bit prime */
315#define VSID_BITS 36
316#define VSID_MODULUS ((1UL<<VSID_BITS)-1)
317
David Gibsone28f7fa2005-08-05 19:39:06 +1000318#define CONTEXT_BITS 19
319#define USER_ESID_BITS 16
320
321#define USER_VSID_RANGE (1UL << (USER_ESID_BITS + SID_SHIFT))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700322
323/*
324 * This macro generates asm code to compute the VSID scramble
325 * function. Used in slb_allocate() and do_stab_bolted. The function
326 * computed is: (protovsid*VSID_MULTIPLIER) % VSID_MODULUS
327 *
328 * rt = register continaing the proto-VSID and into which the
329 * VSID will be stored
330 * rx = scratch register (clobbered)
331 *
332 * - rt and rx must be different registers
333 * - The answer will end up in the low 36 bits of rt. The higher
334 * bits may contain other garbage, so you may need to mask the
335 * result.
336 */
337#define ASM_VSID_SCRAMBLE(rt, rx) \
338 lis rx,VSID_MULTIPLIER@h; \
339 ori rx,rx,VSID_MULTIPLIER@l; \
340 mulld rt,rt,rx; /* rt = rt * MULTIPLIER */ \
341 \
342 srdi rx,rt,VSID_BITS; \
343 clrldi rt,rt,(64-VSID_BITS); \
344 add rt,rt,rx; /* add high and low bits */ \
345 /* Now, r3 == VSID (mod 2^36-1), and lies between 0 and \
346 * 2^36-1+2^28-1. That in particular means that if r3 >= \
347 * 2^36-1, then r3+1 has the 2^36 bit set. So, if r3+1 has \
348 * the bit clear, r3 already has the answer we want, if it \
349 * doesn't, the answer is the low 36 bits of r3+1. So in all \
350 * cases the answer is the low 36 bits of (r3 + ((r3+1) >> 36))*/\
351 addi rx,rt,1; \
352 srdi rx,rx,VSID_BITS; /* extract 2^36 bit */ \
353 add rt,rt,rx
354
David Gibson1f8d4192005-05-05 16:15:13 -0700355
356#ifndef __ASSEMBLY__
357
358typedef unsigned long mm_context_id_t;
359
360typedef struct {
361 mm_context_id_t id;
362#ifdef CONFIG_HUGETLB_PAGE
David Gibsonc594ada2005-08-11 16:55:21 +1000363 u16 low_htlb_areas, high_htlb_areas;
David Gibson1f8d4192005-05-05 16:15:13 -0700364#endif
Benjamin Herrenschmidta5bba932006-05-30 13:51:37 +1000365 unsigned long vdso_base;
David Gibson1f8d4192005-05-05 16:15:13 -0700366} mm_context_t;
367
368
369static inline unsigned long vsid_scramble(unsigned long protovsid)
370{
371#if 0
372 /* The code below is equivalent to this function for arguments
373 * < 2^VSID_BITS, which is all this should ever be called
374 * with. However gcc is not clever enough to compute the
375 * modulus (2^n-1) without a second multiply. */
376 return ((protovsid * VSID_MULTIPLIER) % VSID_MODULUS);
377#else /* 1 */
378 unsigned long x;
379
380 x = protovsid * VSID_MULTIPLIER;
381 x = (x >> VSID_BITS) + (x & VSID_MODULUS);
382 return (x + ((x+1) >> VSID_BITS)) & VSID_MODULUS;
383#endif /* 1 */
384}
385
386/* This is only valid for addresses >= KERNELBASE */
387static inline unsigned long get_kernel_vsid(unsigned long ea)
388{
389 return vsid_scramble(ea >> SID_SHIFT);
390}
391
392/* This is only valid for user addresses (which are below 2^41) */
393static inline unsigned long get_vsid(unsigned long context, unsigned long ea)
394{
395 return vsid_scramble((context << USER_ESID_BITS)
396 | (ea >> SID_SHIFT));
397}
398
David Gibson488f8492005-07-27 11:44:21 -0700399#define VSID_SCRAMBLE(pvsid) (((pvsid) * VSID_MULTIPLIER) % VSID_MODULUS)
400#define KERNEL_VSID(ea) VSID_SCRAMBLE(GET_ESID(ea))
401
Benjamin Herrenschmidtd1405b82005-11-23 17:53:42 +1100402/* Physical address used by some IO functions */
403typedef unsigned long phys_addr_t;
404
405
David Gibson1f8d4192005-05-05 16:15:13 -0700406#endif /* __ASSEMBLY */
407
Paul Mackerras047ea782005-11-19 20:17:32 +1100408#endif /* CONFIG_PPC64 */
Arnd Bergmann88ced032005-12-16 22:43:46 +0100409#endif /* __KERNEL__ */
Paul Mackerras047ea782005-11-19 20:17:32 +1100410#endif /* _ASM_POWERPC_MMU_H_ */