blob: 0759dd8bf5aac05bcc2f8d88d6d8cc07a0627968 [file] [log] [blame]
David Gibson8d2169e2007-04-27 11:53:52 +10001#ifndef _ASM_POWERPC_MMU_HASH64_H_
2#define _ASM_POWERPC_MMU_HASH64_H_
3/*
4 * PowerPC64 memory management structures
5 *
6 * Dave Engebretsen & Mike Corrigan <{engebret|mikejc}@us.ibm.com>
7 * PPC64 rework.
8 *
9 * This program is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU General Public License
11 * as published by the Free Software Foundation; either version
12 * 2 of the License, or (at your option) any later version.
13 */
14
15#include <asm/asm-compat.h>
16#include <asm/page.h>
17
18/*
19 * Segment table
20 */
21
22#define STE_ESID_V 0x80
23#define STE_ESID_KS 0x20
24#define STE_ESID_KP 0x10
25#define STE_ESID_N 0x08
26
27#define STE_VSID_SHIFT 12
28
29/* Location of cpu0's segment table */
Benjamin Herrenschmidt84493802011-03-06 18:09:07 +000030#define STAB0_PAGE 0x8
David Gibson8d2169e2007-04-27 11:53:52 +100031#define STAB0_OFFSET (STAB0_PAGE << 12)
32#define STAB0_PHYS_ADDR (STAB0_OFFSET + PHYSICAL_START)
33
34#ifndef __ASSEMBLY__
35extern char initial_stab[];
36#endif /* ! __ASSEMBLY */
37
38/*
39 * SLB
40 */
41
42#define SLB_NUM_BOLTED 3
43#define SLB_CACHE_ENTRIES 8
Brian King46db2f82009-08-28 12:06:29 +000044#define SLB_MIN_SIZE 32
David Gibson8d2169e2007-04-27 11:53:52 +100045
46/* Bits in the SLB ESID word */
47#define SLB_ESID_V ASM_CONST(0x0000000008000000) /* valid */
48
49/* Bits in the SLB VSID word */
50#define SLB_VSID_SHIFT 12
Paul Mackerras1189be62007-10-11 20:37:10 +100051#define SLB_VSID_SHIFT_1T 24
52#define SLB_VSID_SSIZE_SHIFT 62
David Gibson8d2169e2007-04-27 11:53:52 +100053#define SLB_VSID_B ASM_CONST(0xc000000000000000)
54#define SLB_VSID_B_256M ASM_CONST(0x0000000000000000)
55#define SLB_VSID_B_1T ASM_CONST(0x4000000000000000)
56#define SLB_VSID_KS ASM_CONST(0x0000000000000800)
57#define SLB_VSID_KP ASM_CONST(0x0000000000000400)
58#define SLB_VSID_N ASM_CONST(0x0000000000000200) /* no-execute */
59#define SLB_VSID_L ASM_CONST(0x0000000000000100)
60#define SLB_VSID_C ASM_CONST(0x0000000000000080) /* class */
61#define SLB_VSID_LP ASM_CONST(0x0000000000000030)
62#define SLB_VSID_LP_00 ASM_CONST(0x0000000000000000)
63#define SLB_VSID_LP_01 ASM_CONST(0x0000000000000010)
64#define SLB_VSID_LP_10 ASM_CONST(0x0000000000000020)
65#define SLB_VSID_LP_11 ASM_CONST(0x0000000000000030)
66#define SLB_VSID_LLP (SLB_VSID_L|SLB_VSID_LP)
67
68#define SLB_VSID_KERNEL (SLB_VSID_KP)
69#define SLB_VSID_USER (SLB_VSID_KP|SLB_VSID_KS|SLB_VSID_C)
70
71#define SLBIE_C (0x08000000)
Paul Mackerras1189be62007-10-11 20:37:10 +100072#define SLBIE_SSIZE_SHIFT 25
David Gibson8d2169e2007-04-27 11:53:52 +100073
74/*
75 * Hash table
76 */
77
78#define HPTES_PER_GROUP 8
79
Paul Mackerras2454c7e2007-05-10 15:28:44 +100080#define HPTE_V_SSIZE_SHIFT 62
David Gibson8d2169e2007-04-27 11:53:52 +100081#define HPTE_V_AVPN_SHIFT 7
Paul Mackerras2454c7e2007-05-10 15:28:44 +100082#define HPTE_V_AVPN ASM_CONST(0x3fffffffffffff80)
David Gibson8d2169e2007-04-27 11:53:52 +100083#define HPTE_V_AVPN_VAL(x) (((x) & HPTE_V_AVPN) >> HPTE_V_AVPN_SHIFT)
Geert Uytterhoeven91bbbe22007-11-27 03:24:43 +110084#define HPTE_V_COMPARE(x,y) (!(((x) ^ (y)) & 0xffffffffffffff80UL))
David Gibson8d2169e2007-04-27 11:53:52 +100085#define HPTE_V_BOLTED ASM_CONST(0x0000000000000010)
86#define HPTE_V_LOCK ASM_CONST(0x0000000000000008)
87#define HPTE_V_LARGE ASM_CONST(0x0000000000000004)
88#define HPTE_V_SECONDARY ASM_CONST(0x0000000000000002)
89#define HPTE_V_VALID ASM_CONST(0x0000000000000001)
90
91#define HPTE_R_PP0 ASM_CONST(0x8000000000000000)
92#define HPTE_R_TS ASM_CONST(0x4000000000000000)
Paul Mackerrasde56a942011-06-29 00:21:34 +000093#define HPTE_R_KEY_HI ASM_CONST(0x3000000000000000)
David Gibson8d2169e2007-04-27 11:53:52 +100094#define HPTE_R_RPN_SHIFT 12
Paul Mackerrasde56a942011-06-29 00:21:34 +000095#define HPTE_R_RPN ASM_CONST(0x0ffffffffffff000)
David Gibson8d2169e2007-04-27 11:53:52 +100096#define HPTE_R_PP ASM_CONST(0x0000000000000003)
97#define HPTE_R_N ASM_CONST(0x0000000000000004)
Paul Mackerrasde56a942011-06-29 00:21:34 +000098#define HPTE_R_G ASM_CONST(0x0000000000000008)
99#define HPTE_R_M ASM_CONST(0x0000000000000010)
100#define HPTE_R_I ASM_CONST(0x0000000000000020)
101#define HPTE_R_W ASM_CONST(0x0000000000000040)
102#define HPTE_R_WIMG ASM_CONST(0x0000000000000078)
David Gibson8d2169e2007-04-27 11:53:52 +1000103#define HPTE_R_C ASM_CONST(0x0000000000000080)
104#define HPTE_R_R ASM_CONST(0x0000000000000100)
Paul Mackerrasde56a942011-06-29 00:21:34 +0000105#define HPTE_R_KEY_LO ASM_CONST(0x0000000000000e00)
David Gibson8d2169e2007-04-27 11:53:52 +1000106
Sachin P. Santb7abc5c2007-06-14 15:31:34 +1000107#define HPTE_V_1TB_SEG ASM_CONST(0x4000000000000000)
108#define HPTE_V_VRMA_MASK ASM_CONST(0x4001ffffff000000)
109
David Gibson8d2169e2007-04-27 11:53:52 +1000110/* Values for PP (assumes Ks=0, Kp=1) */
David Gibson8d2169e2007-04-27 11:53:52 +1000111#define PP_RWXX 0 /* Supervisor read/write, User none */
112#define PP_RWRX 1 /* Supervisor read/write, User read */
113#define PP_RWRW 2 /* Supervisor read/write, User read/write */
114#define PP_RXRX 3 /* Supervisor read, User read */
Paul Mackerras697d3892011-12-12 12:36:37 +0000115#define PP_RXXX (HPTE_R_PP0 | 2) /* Supervisor read, user none */
David Gibson8d2169e2007-04-27 11:53:52 +1000116
117#ifndef __ASSEMBLY__
118
David Gibson8e561e72007-06-13 14:52:56 +1000119struct hash_pte {
David Gibson8d2169e2007-04-27 11:53:52 +1000120 unsigned long v;
121 unsigned long r;
David Gibson8e561e72007-06-13 14:52:56 +1000122};
David Gibson8d2169e2007-04-27 11:53:52 +1000123
David Gibson8e561e72007-06-13 14:52:56 +1000124extern struct hash_pte *htab_address;
David Gibson8d2169e2007-04-27 11:53:52 +1000125extern unsigned long htab_size_bytes;
126extern unsigned long htab_hash_mask;
127
128/*
129 * Page size definition
130 *
131 * shift : is the "PAGE_SHIFT" value for that page size
132 * sllp : is a bit mask with the value of SLB L || LP to be or'ed
133 * directly to a slbmte "vsid" value
134 * penc : is the HPTE encoding mask for the "LP" field:
135 *
136 */
137struct mmu_psize_def
138{
139 unsigned int shift; /* number of bits */
140 unsigned int penc; /* HPTE encoding */
141 unsigned int tlbiel; /* tlbiel supported for that page size */
142 unsigned long avpnm; /* bits to mask out in AVPN in the HPTE */
143 unsigned long sllp; /* SLB L||LP (exact mask to use in slbmte) */
144};
145
146#endif /* __ASSEMBLY__ */
147
148/*
Paul Mackerras2454c7e2007-05-10 15:28:44 +1000149 * Segment sizes.
150 * These are the values used by hardware in the B field of
151 * SLB entries and the first dword of MMU hashtable entries.
152 * The B field is 2 bits; the values 2 and 3 are unused and reserved.
153 */
154#define MMU_SEGSIZE_256M 0
155#define MMU_SEGSIZE_1T 1
156
Paul Mackerras1189be62007-10-11 20:37:10 +1000157
David Gibson8d2169e2007-04-27 11:53:52 +1000158#ifndef __ASSEMBLY__
159
160/*
Paul Mackerras1189be62007-10-11 20:37:10 +1000161 * The current system page and segment sizes
David Gibson8d2169e2007-04-27 11:53:52 +1000162 */
163extern struct mmu_psize_def mmu_psize_defs[MMU_PAGE_COUNT];
164extern int mmu_linear_psize;
165extern int mmu_virtual_psize;
166extern int mmu_vmalloc_psize;
Benjamin Herrenschmidtcec08e72008-04-30 15:41:48 +1000167extern int mmu_vmemmap_psize;
David Gibson8d2169e2007-04-27 11:53:52 +1000168extern int mmu_io_psize;
Paul Mackerras1189be62007-10-11 20:37:10 +1000169extern int mmu_kernel_ssize;
170extern int mmu_highuser_ssize;
Michael Neuling584f8b72007-12-06 17:24:48 +1100171extern u16 mmu_slb_size;
Michael Ellerman572fb572008-05-08 14:27:08 +1000172extern unsigned long tce_alloc_start, tce_alloc_end;
David Gibson8d2169e2007-04-27 11:53:52 +1000173
174/*
175 * If the processor supports 64k normal pages but not 64k cache
176 * inhibited pages, we have to be prepared to switch processes
177 * to use 4k pages when they create cache-inhibited mappings.
178 * If this is the case, mmu_ci_restrictions will be set to 1.
179 */
180extern int mmu_ci_restrictions;
181
David Gibson8d2169e2007-04-27 11:53:52 +1000182/*
183 * This function sets the AVPN and L fields of the HPTE appropriately
184 * for the page size
185 */
Paul Mackerras1189be62007-10-11 20:37:10 +1000186static inline unsigned long hpte_encode_v(unsigned long va, int psize,
187 int ssize)
David Gibson8d2169e2007-04-27 11:53:52 +1000188{
Paul Mackerras1189be62007-10-11 20:37:10 +1000189 unsigned long v;
David Gibson8d2169e2007-04-27 11:53:52 +1000190 v = (va >> 23) & ~(mmu_psize_defs[psize].avpnm);
191 v <<= HPTE_V_AVPN_SHIFT;
192 if (psize != MMU_PAGE_4K)
193 v |= HPTE_V_LARGE;
Paul Mackerras1189be62007-10-11 20:37:10 +1000194 v |= ((unsigned long) ssize) << HPTE_V_SSIZE_SHIFT;
David Gibson8d2169e2007-04-27 11:53:52 +1000195 return v;
196}
197
198/*
199 * This function sets the ARPN, and LP fields of the HPTE appropriately
200 * for the page size. We assume the pa is already "clean" that is properly
201 * aligned for the requested page size
202 */
203static inline unsigned long hpte_encode_r(unsigned long pa, int psize)
204{
205 unsigned long r;
206
207 /* A 4K page needs no special encoding */
208 if (psize == MMU_PAGE_4K)
209 return pa & HPTE_R_RPN;
210 else {
211 unsigned int penc = mmu_psize_defs[psize].penc;
212 unsigned int shift = mmu_psize_defs[psize].shift;
213 return (pa & ~((1ul << shift) - 1)) | (penc << 12);
214 }
215 return r;
216}
217
218/*
Paul Mackerras1189be62007-10-11 20:37:10 +1000219 * Build a VA given VSID, EA and segment size
220 */
221static inline unsigned long hpt_va(unsigned long ea, unsigned long vsid,
222 int ssize)
223{
224 if (ssize == MMU_SEGSIZE_256M)
225 return (vsid << 28) | (ea & 0xfffffffUL);
226 return (vsid << 40) | (ea & 0xffffffffffUL);
227}
228
229/*
230 * This hashes a virtual address
David Gibson8d2169e2007-04-27 11:53:52 +1000231 */
232
Paul Mackerras1189be62007-10-11 20:37:10 +1000233static inline unsigned long hpt_hash(unsigned long va, unsigned int shift,
234 int ssize)
David Gibson8d2169e2007-04-27 11:53:52 +1000235{
Paul Mackerras1189be62007-10-11 20:37:10 +1000236 unsigned long hash, vsid;
237
238 if (ssize == MMU_SEGSIZE_256M) {
239 hash = (va >> 28) ^ ((va & 0x0fffffffUL) >> shift);
240 } else {
241 vsid = va >> 40;
242 hash = vsid ^ (vsid << 25) ^ ((va & 0xffffffffffUL) >> shift);
243 }
244 return hash & 0x7fffffffffUL;
David Gibson8d2169e2007-04-27 11:53:52 +1000245}
246
247extern int __hash_page_4K(unsigned long ea, unsigned long access,
248 unsigned long vsid, pte_t *ptep, unsigned long trap,
Paul Mackerrasfa282372008-01-24 08:35:13 +1100249 unsigned int local, int ssize, int subpage_prot);
David Gibson8d2169e2007-04-27 11:53:52 +1000250extern int __hash_page_64K(unsigned long ea, unsigned long access,
251 unsigned long vsid, pte_t *ptep, unsigned long trap,
Paul Mackerras1189be62007-10-11 20:37:10 +1000252 unsigned int local, int ssize);
David Gibson8d2169e2007-04-27 11:53:52 +1000253struct mm_struct;
David Gibson0895ecd2009-10-26 19:24:31 +0000254unsigned int hash_page_do_lazy_icache(unsigned int pp, pte_t pte, int trap);
David Gibson8d2169e2007-04-27 11:53:52 +1000255extern int hash_page(unsigned long ea, unsigned long access, unsigned long trap);
David Gibsona4fe3ce2009-10-26 19:24:31 +0000256int __hash_page_huge(unsigned long ea, unsigned long access, unsigned long vsid,
257 pte_t *ptep, unsigned long trap, int local, int ssize,
258 unsigned int shift, unsigned int mmu_psize);
Benjamin Herrenschmidt4b8692c2010-07-23 10:31:13 +1000259extern void hash_failure_debug(unsigned long ea, unsigned long access,
260 unsigned long vsid, unsigned long trap,
261 int ssize, int psize, unsigned long pte);
David Gibson8d2169e2007-04-27 11:53:52 +1000262extern int htab_bolt_mapping(unsigned long vstart, unsigned long vend,
Benjamin Herrenschmidtbc033b62008-08-05 16:19:56 +1000263 unsigned long pstart, unsigned long prot,
Paul Mackerras1189be62007-10-11 20:37:10 +1000264 int psize, int ssize);
Becky Bruce41151e72011-06-28 09:54:48 +0000265extern void add_gpage(u64 addr, u64 page_size, unsigned long number_of_pages);
Paul Mackerrasfa282372008-01-24 08:35:13 +1100266extern void demote_segment_4k(struct mm_struct *mm, unsigned long addr);
David Gibson8d2169e2007-04-27 11:53:52 +1000267
David Gibson8d2169e2007-04-27 11:53:52 +1000268extern void hpte_init_native(void);
269extern void hpte_init_lpar(void);
270extern void hpte_init_iSeries(void);
271extern void hpte_init_beat(void);
Ishizaki Kou7f2c8572007-10-02 18:23:46 +1000272extern void hpte_init_beat_v3(void);
David Gibson8d2169e2007-04-27 11:53:52 +1000273
274extern void stabs_alloc(void);
275extern void slb_initialize(void);
276extern void slb_flush_and_rebolt(void);
277extern void stab_initialize(unsigned long stab);
278
Michael Neuling67439b72007-08-03 11:55:39 +1000279extern void slb_vmalloc_update(void);
Brian King46db2f82009-08-28 12:06:29 +0000280extern void slb_set_size(u16 size);
David Gibson8d2169e2007-04-27 11:53:52 +1000281#endif /* __ASSEMBLY__ */
282
283/*
284 * VSID allocation
285 *
286 * We first generate a 36-bit "proto-VSID". For kernel addresses this
287 * is equal to the ESID, for user addresses it is:
288 * (context << 15) | (esid & 0x7fff)
289 *
290 * The two forms are distinguishable because the top bit is 0 for user
291 * addresses, whereas the top two bits are 1 for kernel addresses.
292 * Proto-VSIDs with the top two bits equal to 0b10 are reserved for
293 * now.
294 *
295 * The proto-VSIDs are then scrambled into real VSIDs with the
296 * multiplicative hash:
297 *
298 * VSID = (proto-VSID * VSID_MULTIPLIER) % VSID_MODULUS
299 * where VSID_MULTIPLIER = 268435399 = 0xFFFFFC7
300 * VSID_MODULUS = 2^36-1 = 0xFFFFFFFFF
301 *
302 * This scramble is only well defined for proto-VSIDs below
303 * 0xFFFFFFFFF, so both proto-VSID and actual VSID 0xFFFFFFFFF are
304 * reserved. VSID_MULTIPLIER is prime, so in particular it is
305 * co-prime to VSID_MODULUS, making this a 1:1 scrambling function.
306 * Because the modulus is 2^n-1 we can compute it efficiently without
307 * a divide or extra multiply (see below).
308 *
309 * This scheme has several advantages over older methods:
310 *
311 * - We have VSIDs allocated for every kernel address
312 * (i.e. everything above 0xC000000000000000), except the very top
313 * segment, which simplifies several things.
314 *
Anton Blanchardb2065902011-12-12 20:16:36 +0000315 * - We allow for 16 significant bits of ESID and 19 bits of
316 * context for user addresses. i.e. 16T (44 bits) of address space for
317 * up to half a million contexts.
David Gibson8d2169e2007-04-27 11:53:52 +1000318 *
319 * - The scramble function gives robust scattering in the hash
320 * table (at least based on some initial results). The previous
321 * method was more susceptible to pathological cases giving excessive
322 * hash collisions.
323 */
324/*
325 * WARNING - If you change these you must make sure the asm
326 * implementations in slb_allocate (slb_low.S), do_stab_bolted
327 * (head.S) and ASM_VSID_SCRAMBLE (below) are changed accordingly.
328 *
329 * You'll also need to change the precomputed VSID values in head.S
330 * which are used by the iSeries firmware.
331 */
332
Paul Mackerras1189be62007-10-11 20:37:10 +1000333#define VSID_MULTIPLIER_256M ASM_CONST(200730139) /* 28-bit prime */
334#define VSID_BITS_256M 36
335#define VSID_MODULUS_256M ((1UL<<VSID_BITS_256M)-1)
David Gibson8d2169e2007-04-27 11:53:52 +1000336
Paul Mackerras1189be62007-10-11 20:37:10 +1000337#define VSID_MULTIPLIER_1T ASM_CONST(12538073) /* 24-bit prime */
338#define VSID_BITS_1T 24
339#define VSID_MODULUS_1T ((1UL<<VSID_BITS_1T)-1)
340
341#define CONTEXT_BITS 19
342#define USER_ESID_BITS 16
343#define USER_ESID_BITS_1T 4
David Gibson8d2169e2007-04-27 11:53:52 +1000344
345#define USER_VSID_RANGE (1UL << (USER_ESID_BITS + SID_SHIFT))
346
347/*
348 * This macro generates asm code to compute the VSID scramble
349 * function. Used in slb_allocate() and do_stab_bolted. The function
350 * computed is: (protovsid*VSID_MULTIPLIER) % VSID_MODULUS
351 *
352 * rt = register continaing the proto-VSID and into which the
353 * VSID will be stored
354 * rx = scratch register (clobbered)
355 *
356 * - rt and rx must be different registers
Paul Mackerras1189be62007-10-11 20:37:10 +1000357 * - The answer will end up in the low VSID_BITS bits of rt. The higher
David Gibson8d2169e2007-04-27 11:53:52 +1000358 * bits may contain other garbage, so you may need to mask the
359 * result.
360 */
Paul Mackerras1189be62007-10-11 20:37:10 +1000361#define ASM_VSID_SCRAMBLE(rt, rx, size) \
362 lis rx,VSID_MULTIPLIER_##size@h; \
363 ori rx,rx,VSID_MULTIPLIER_##size@l; \
David Gibson8d2169e2007-04-27 11:53:52 +1000364 mulld rt,rt,rx; /* rt = rt * MULTIPLIER */ \
365 \
Paul Mackerras1189be62007-10-11 20:37:10 +1000366 srdi rx,rt,VSID_BITS_##size; \
367 clrldi rt,rt,(64-VSID_BITS_##size); \
David Gibson8d2169e2007-04-27 11:53:52 +1000368 add rt,rt,rx; /* add high and low bits */ \
369 /* Now, r3 == VSID (mod 2^36-1), and lies between 0 and \
370 * 2^36-1+2^28-1. That in particular means that if r3 >= \
371 * 2^36-1, then r3+1 has the 2^36 bit set. So, if r3+1 has \
372 * the bit clear, r3 already has the answer we want, if it \
373 * doesn't, the answer is the low 36 bits of r3+1. So in all \
374 * cases the answer is the low 36 bits of (r3 + ((r3+1) >> 36))*/\
375 addi rx,rt,1; \
Paul Mackerras1189be62007-10-11 20:37:10 +1000376 srdi rx,rx,VSID_BITS_##size; /* extract 2^VSID_BITS bit */ \
David Gibson8d2169e2007-04-27 11:53:52 +1000377 add rt,rt,rx
378
379
380#ifndef __ASSEMBLY__
381
David Gibsond28513b2009-11-26 18:56:04 +0000382#ifdef CONFIG_PPC_SUBPAGE_PROT
383/*
384 * For the sub-page protection option, we extend the PGD with one of
385 * these. Basically we have a 3-level tree, with the top level being
386 * the protptrs array. To optimize speed and memory consumption when
387 * only addresses < 4GB are being protected, pointers to the first
388 * four pages of sub-page protection words are stored in the low_prot
389 * array.
390 * Each page of sub-page protection words protects 1GB (4 bytes
391 * protects 64k). For the 3-level tree, each page of pointers then
392 * protects 8TB.
393 */
394struct subpage_prot_table {
395 unsigned long maxaddr; /* only addresses < this are protected */
396 unsigned int **protptrs[2];
397 unsigned int *low_prot[4];
398};
399
400#define SBP_L1_BITS (PAGE_SHIFT - 2)
401#define SBP_L2_BITS (PAGE_SHIFT - 3)
402#define SBP_L1_COUNT (1 << SBP_L1_BITS)
403#define SBP_L2_COUNT (1 << SBP_L2_BITS)
404#define SBP_L2_SHIFT (PAGE_SHIFT + SBP_L1_BITS)
405#define SBP_L3_SHIFT (SBP_L2_SHIFT + SBP_L2_BITS)
406
407extern void subpage_prot_free(struct mm_struct *mm);
408extern void subpage_prot_init_new_context(struct mm_struct *mm);
409#else
410static inline void subpage_prot_free(struct mm_struct *mm) {}
411static inline void subpage_prot_init_new_context(struct mm_struct *mm) { }
412#endif /* CONFIG_PPC_SUBPAGE_PROT */
413
David Gibson8d2169e2007-04-27 11:53:52 +1000414typedef unsigned long mm_context_id_t;
Tseng-Hui (Frank) Lin851d2e22011-05-02 20:43:04 +0000415struct spinlock;
David Gibson8d2169e2007-04-27 11:53:52 +1000416
417typedef struct {
418 mm_context_id_t id;
Benjamin Herrenschmidtd0f13e32007-05-08 16:27:27 +1000419 u16 user_psize; /* page size index */
420
421#ifdef CONFIG_PPC_MM_SLICES
422 u64 low_slices_psize; /* SLB page size encodings */
423 u64 high_slices_psize; /* 4 bits per slice for now */
424#else
425 u16 sllp; /* SLB page size encoding */
David Gibson8d2169e2007-04-27 11:53:52 +1000426#endif
427 unsigned long vdso_base;
David Gibsond28513b2009-11-26 18:56:04 +0000428#ifdef CONFIG_PPC_SUBPAGE_PROT
429 struct subpage_prot_table spt;
430#endif /* CONFIG_PPC_SUBPAGE_PROT */
Tseng-Hui (Frank) Lin851d2e22011-05-02 20:43:04 +0000431#ifdef CONFIG_PPC_ICSWX
432 struct spinlock *cop_lockp; /* guard acop and cop_pid */
433 unsigned long acop; /* mask of enabled coprocessor types */
434 unsigned int cop_pid; /* pid value used with coprocessors */
435#endif /* CONFIG_PPC_ICSWX */
David Gibson8d2169e2007-04-27 11:53:52 +1000436} mm_context_t;
437
438
David Gibson8d2169e2007-04-27 11:53:52 +1000439#if 0
Paul Mackerras1189be62007-10-11 20:37:10 +1000440/*
441 * The code below is equivalent to this function for arguments
442 * < 2^VSID_BITS, which is all this should ever be called
443 * with. However gcc is not clever enough to compute the
444 * modulus (2^n-1) without a second multiply.
445 */
Anton Blanchard34692702010-08-02 20:35:18 +0000446#define vsid_scramble(protovsid, size) \
Paul Mackerras1189be62007-10-11 20:37:10 +1000447 ((((protovsid) * VSID_MULTIPLIER_##size) % VSID_MODULUS_##size))
David Gibson8d2169e2007-04-27 11:53:52 +1000448
Paul Mackerras1189be62007-10-11 20:37:10 +1000449#else /* 1 */
450#define vsid_scramble(protovsid, size) \
451 ({ \
452 unsigned long x; \
453 x = (protovsid) * VSID_MULTIPLIER_##size; \
454 x = (x >> VSID_BITS_##size) + (x & VSID_MODULUS_##size); \
455 (x + ((x+1) >> VSID_BITS_##size)) & VSID_MODULUS_##size; \
456 })
David Gibson8d2169e2007-04-27 11:53:52 +1000457#endif /* 1 */
David Gibson8d2169e2007-04-27 11:53:52 +1000458
Paul Mackerras549e8152008-08-30 11:43:47 +1000459/* This is only valid for addresses >= PAGE_OFFSET */
Paul Mackerras1189be62007-10-11 20:37:10 +1000460static inline unsigned long get_kernel_vsid(unsigned long ea, int ssize)
David Gibson8d2169e2007-04-27 11:53:52 +1000461{
Paul Mackerras1189be62007-10-11 20:37:10 +1000462 if (ssize == MMU_SEGSIZE_256M)
463 return vsid_scramble(ea >> SID_SHIFT, 256M);
464 return vsid_scramble(ea >> SID_SHIFT_1T, 1T);
David Gibson8d2169e2007-04-27 11:53:52 +1000465}
466
Paul Mackerras1189be62007-10-11 20:37:10 +1000467/* Returns the segment size indicator for a user address */
468static inline int user_segment_size(unsigned long addr)
David Gibson8d2169e2007-04-27 11:53:52 +1000469{
Paul Mackerras1189be62007-10-11 20:37:10 +1000470 /* Use 1T segments if possible for addresses >= 1T */
471 if (addr >= (1UL << SID_SHIFT_1T))
472 return mmu_highuser_ssize;
473 return MMU_SEGSIZE_256M;
David Gibson8d2169e2007-04-27 11:53:52 +1000474}
475
Paul Mackerras1189be62007-10-11 20:37:10 +1000476/* This is only valid for user addresses (which are below 2^44) */
477static inline unsigned long get_vsid(unsigned long context, unsigned long ea,
478 int ssize)
479{
480 if (ssize == MMU_SEGSIZE_256M)
481 return vsid_scramble((context << USER_ESID_BITS)
482 | (ea >> SID_SHIFT), 256M);
483 return vsid_scramble((context << USER_ESID_BITS_1T)
484 | (ea >> SID_SHIFT_1T), 1T);
485}
486
487/*
488 * This is only used on legacy iSeries in lparmap.c,
489 * hence the 256MB segment assumption.
490 */
491#define VSID_SCRAMBLE(pvsid) (((pvsid) * VSID_MULTIPLIER_256M) % \
492 VSID_MODULUS_256M)
David Gibson8d2169e2007-04-27 11:53:52 +1000493#define KERNEL_VSID(ea) VSID_SCRAMBLE(GET_ESID(ea))
494
David Gibson8d2169e2007-04-27 11:53:52 +1000495#endif /* __ASSEMBLY__ */
496
497#endif /* _ASM_POWERPC_MMU_HASH64_H_ */