2 * This file contains the routines for handling the MMU on those
3 * PowerPC implementations where the MMU substantially follows the
4 * architecture specification. This includes the 6xx, 7xx, 7xxx,
5 * and 8260 implementations but excludes the 8xx and 4xx.
8 * Derived from arch/ppc/mm/init.c:
9 * Copyright (C) 1995-1996 Gary Thomas (gdt@linuxppc.org)
11 * Modifications by Paul Mackerras (PowerMac) (paulus@cs.anu.edu.au)
12 * and Cort Dougan (PReP) (cort@cs.nmt.edu)
13 * Copyright (C) 1996 Paul Mackerras
14 * Amiga/APUS changes by Jesper Skov (jskov@cygnus.co.uk).
16 * Derived from "arch/i386/mm/init.c"
17 * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
19 * This program is free software; you can redistribute it and/or
20 * modify it under the terms of the GNU General Public License
21 * as published by the Free Software Foundation; either version
22 * 2 of the License, or (at your option) any later version.
26 #include <linux/kernel.h>
28 #include <linux/init.h>
29 #include <linux/highmem.h>
33 #include <asm/machdep.h>
36 #include "mem_pieces.h"
39 unsigned long Hash_size
, Hash_mask
;
42 union ubat
{ /* BAT register values to be loaded */
45 } BATS
[4][2]; /* 4 pairs of IBAT, DBAT */
47 struct batrange
{ /* stores address ranges mapped by BATs */
54 * Return PA for this VA if it is mapped by a BAT, or 0
56 unsigned long v_mapped_by_bats(unsigned long va
)
59 for (b
= 0; b
< 4; ++b
)
60 if (va
>= bat_addrs
[b
].start
&& va
< bat_addrs
[b
].limit
)
61 return bat_addrs
[b
].phys
+ (va
- bat_addrs
[b
].start
);
66 * Return VA for a given PA or 0 if not mapped
68 unsigned long p_mapped_by_bats(unsigned long pa
)
71 for (b
= 0; b
< 4; ++b
)
72 if (pa
>= bat_addrs
[b
].phys
73 && pa
< (bat_addrs
[b
].limit
-bat_addrs
[b
].start
)
75 return bat_addrs
[b
].start
+(pa
-bat_addrs
[b
].phys
);
79 unsigned long __init
mmu_mapin_ram(void)
81 unsigned long tot
, bl
, done
;
82 unsigned long max_size
= (256<<20);
85 if (__map_without_bats
)
88 /* Set up BAT2 and if necessary BAT3 to cover RAM. */
90 /* Make sure we don't map a block larger than the
91 smallest alignment of the physical address. */
92 /* alignment of PPC_MEMSTART */
93 align
= ~(PPC_MEMSTART
-1) & PPC_MEMSTART
;
94 /* set BAT block size to MIN(max_size, align) */
95 if (align
&& align
< max_size
)
99 for (bl
= 128<<10; bl
< max_size
; bl
<<= 1) {
104 setbat(2, KERNELBASE
, PPC_MEMSTART
, bl
, _PAGE_RAM
);
105 done
= (unsigned long)bat_addrs
[2].limit
- KERNELBASE
+ 1;
106 if ((done
< tot
) && !bat_addrs
[3].limit
) {
107 /* use BAT3 to cover a bit more */
109 for (bl
= 128<<10; bl
< max_size
; bl
<<= 1)
112 setbat(3, KERNELBASE
+done
, PPC_MEMSTART
+done
, bl
, _PAGE_RAM
);
113 done
= (unsigned long)bat_addrs
[3].limit
- KERNELBASE
+ 1;
120 * Set up one of the I/D BAT (block address translation) register pairs.
121 * The parameters are not checked; in particular size must be a power
122 * of 2 between 128k and 256M.
124 void __init
setbat(int index
, unsigned long virt
, unsigned long phys
,
125 unsigned int size
, int flags
)
129 union ubat
*bat
= BATS
[index
];
131 if (((flags
& _PAGE_NO_CACHE
) == 0) &&
132 cpu_has_feature(CPU_FTR_NEED_COHERENT
))
133 flags
|= _PAGE_COHERENT
;
135 bl
= (size
>> 17) - 1;
136 if (PVR_VER(mfspr(SPRN_PVR
)) != 1) {
139 wimgxpp
= flags
& (_PAGE_WRITETHRU
| _PAGE_NO_CACHE
140 | _PAGE_COHERENT
| _PAGE_GUARDED
);
141 wimgxpp
|= (flags
& _PAGE_RW
)? BPP_RW
: BPP_RX
;
142 bat
[1].word
[0] = virt
| (bl
<< 2) | 2; /* Vs=1, Vp=0 */
143 bat
[1].word
[1] = phys
| wimgxpp
;
144 #ifndef CONFIG_KGDB /* want user access for breakpoints */
145 if (flags
& _PAGE_USER
)
147 bat
[1].bat
.batu
.vp
= 1;
148 if (flags
& _PAGE_GUARDED
) {
149 /* G bit must be zero in IBATs */
150 bat
[0].word
[0] = bat
[0].word
[1] = 0;
152 /* make IBAT same as DBAT */
159 wimgxpp
= flags
& (_PAGE_WRITETHRU
| _PAGE_NO_CACHE
161 wimgxpp
|= (flags
& _PAGE_RW
)?
162 ((flags
& _PAGE_USER
)? PP_RWRW
: PP_RWXX
): PP_RXRX
;
163 bat
->word
[0] = virt
| wimgxpp
| 4; /* Ks=0, Ku=1 */
164 bat
->word
[1] = phys
| bl
| 0x40; /* V=1 */
167 bat_addrs
[index
].start
= virt
;
168 bat_addrs
[index
].limit
= virt
+ ((bl
+ 1) << 17) - 1;
169 bat_addrs
[index
].phys
= phys
;
173 * Initialize the hash table and patch the instructions in hashtable.S.
175 void __init
MMU_init_hw(void)
177 unsigned int hmask
, mb
, mb2
;
178 unsigned int n_hpteg
, lg_n_hpteg
;
180 extern unsigned int hash_page_patch_A
[];
181 extern unsigned int hash_page_patch_B
[], hash_page_patch_C
[];
182 extern unsigned int hash_page
[];
183 extern unsigned int flush_hash_patch_A
[], flush_hash_patch_B
[];
185 if (!cpu_has_feature(CPU_FTR_HPTE_TABLE
)) {
187 * Put a blr (procedure return) instruction at the
188 * start of hash_page, since we can still get DSI
189 * exceptions on a 603.
191 hash_page
[0] = 0x4e800020;
192 flush_icache_range((unsigned long) &hash_page
[0],
193 (unsigned long) &hash_page
[1]);
197 if ( ppc_md
.progress
) ppc_md
.progress("hash:enter", 0x105);
199 #define LG_HPTEG_SIZE 6 /* 64 bytes per HPTEG */
200 #define SDR1_LOW_BITS ((n_hpteg - 1) >> 10)
201 #define MIN_N_HPTEG 1024 /* min 64kB hash table */
204 * Allow 1 HPTE (1/8 HPTEG) for each page of memory.
205 * This is less than the recommended amount, but then
208 n_hpteg
= total_memory
/ (PAGE_SIZE
* 8);
209 if (n_hpteg
< MIN_N_HPTEG
)
210 n_hpteg
= MIN_N_HPTEG
;
211 lg_n_hpteg
= __ilog2(n_hpteg
);
212 if (n_hpteg
& (n_hpteg
- 1)) {
213 ++lg_n_hpteg
; /* round up if not power of 2 */
214 n_hpteg
= 1 << lg_n_hpteg
;
216 Hash_size
= n_hpteg
<< LG_HPTEG_SIZE
;
219 * Find some memory for the hash table.
221 if ( ppc_md
.progress
) ppc_md
.progress("hash:find piece", 0x322);
222 Hash
= mem_pieces_find(Hash_size
, Hash_size
);
223 cacheable_memzero(Hash
, Hash_size
);
224 _SDR1
= __pa(Hash
) | SDR1_LOW_BITS
;
226 Hash_end
= (PTE
*) ((unsigned long)Hash
+ Hash_size
);
228 printk("Total memory = %ldMB; using %ldkB for hash table (at %p)\n",
229 total_memory
>> 20, Hash_size
>> 10, Hash
);
233 * Patch up the instructions in hashtable.S:create_hpte
235 if ( ppc_md
.progress
) ppc_md
.progress("hash:patch", 0x345);
236 Hash_mask
= n_hpteg
- 1;
237 hmask
= Hash_mask
>> (16 - LG_HPTEG_SIZE
);
238 mb2
= mb
= 32 - LG_HPTEG_SIZE
- lg_n_hpteg
;
240 mb2
= 16 - LG_HPTEG_SIZE
;
242 hash_page_patch_A
[0] = (hash_page_patch_A
[0] & ~0xffff)
243 | ((unsigned int)(Hash
) >> 16);
244 hash_page_patch_A
[1] = (hash_page_patch_A
[1] & ~0x7c0) | (mb
<< 6);
245 hash_page_patch_A
[2] = (hash_page_patch_A
[2] & ~0x7c0) | (mb2
<< 6);
246 hash_page_patch_B
[0] = (hash_page_patch_B
[0] & ~0xffff) | hmask
;
247 hash_page_patch_C
[0] = (hash_page_patch_C
[0] & ~0xffff) | hmask
;
250 * Ensure that the locations we've patched have been written
251 * out from the data cache and invalidated in the instruction
252 * cache, on those machines with split caches.
254 flush_icache_range((unsigned long) &hash_page_patch_A
[0],
255 (unsigned long) &hash_page_patch_C
[1]);
258 * Patch up the instructions in hashtable.S:flush_hash_page
260 flush_hash_patch_A
[0] = (flush_hash_patch_A
[0] & ~0xffff)
261 | ((unsigned int)(Hash
) >> 16);
262 flush_hash_patch_A
[1] = (flush_hash_patch_A
[1] & ~0x7c0) | (mb
<< 6);
263 flush_hash_patch_A
[2] = (flush_hash_patch_A
[2] & ~0x7c0) | (mb2
<< 6);
264 flush_hash_patch_B
[0] = (flush_hash_patch_B
[0] & ~0xffff) | hmask
;
265 flush_icache_range((unsigned long) &flush_hash_patch_A
[0],
266 (unsigned long) &flush_hash_patch_B
[1]);
268 if ( ppc_md
.progress
) ppc_md
.progress("hash:done", 0x205);