ppc_mmu_32.c 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291
  1. /*
  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. * 8260, and POWER3 implementations but excludes the 8xx and 4xx.
  6. * -- paulus
  7. *
  8. * Derived from arch/ppc/mm/init.c:
  9. * Copyright (C) 1995-1996 Gary Thomas (gdt@linuxppc.org)
  10. *
  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).
  15. *
  16. * Derived from "arch/i386/mm/init.c"
  17. * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
  18. *
  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.
  23. *
  24. */
  25. #include <linux/kernel.h>
  26. #include <linux/mm.h>
  27. #include <linux/init.h>
  28. #include <linux/highmem.h>
  29. #include <asm/prom.h>
  30. #include <asm/mmu.h>
  31. #include <asm/machdep.h>
  32. #include <asm/lmb.h>
  33. #include "mmu_decl.h"
  34. PTE *Hash, *Hash_end;
  35. unsigned long Hash_size, Hash_mask;
  36. unsigned long _SDR1;
  37. union ubat { /* BAT register values to be loaded */
  38. BAT bat;
  39. u32 word[2];
  40. } BATS[8][2]; /* 8 pairs of IBAT, DBAT */
  41. struct batrange { /* stores address ranges mapped by BATs */
  42. unsigned long start;
  43. unsigned long limit;
  44. unsigned long phys;
  45. } bat_addrs[8];
  46. /*
  47. * Return PA for this VA if it is mapped by a BAT, or 0
  48. */
  49. unsigned long v_mapped_by_bats(unsigned long va)
  50. {
  51. int b;
  52. for (b = 0; b < 4; ++b)
  53. if (va >= bat_addrs[b].start && va < bat_addrs[b].limit)
  54. return bat_addrs[b].phys + (va - bat_addrs[b].start);
  55. return 0;
  56. }
  57. /*
  58. * Return VA for a given PA or 0 if not mapped
  59. */
  60. unsigned long p_mapped_by_bats(unsigned long pa)
  61. {
  62. int b;
  63. for (b = 0; b < 4; ++b)
  64. if (pa >= bat_addrs[b].phys
  65. && pa < (bat_addrs[b].limit-bat_addrs[b].start)
  66. +bat_addrs[b].phys)
  67. return bat_addrs[b].start+(pa-bat_addrs[b].phys);
  68. return 0;
  69. }
  70. unsigned long __init mmu_mapin_ram(void)
  71. {
  72. #ifdef CONFIG_POWER4
  73. return 0;
  74. #else
  75. unsigned long tot, bl, done;
  76. unsigned long max_size = (256<<20);
  77. unsigned long align;
  78. if (__map_without_bats) {
  79. printk(KERN_DEBUG "RAM mapped without BATs\n");
  80. return 0;
  81. }
  82. /* Set up BAT2 and if necessary BAT3 to cover RAM. */
  83. /* Make sure we don't map a block larger than the
  84. smallest alignment of the physical address. */
  85. /* alignment of PPC_MEMSTART */
  86. align = ~(PPC_MEMSTART-1) & PPC_MEMSTART;
  87. /* set BAT block size to MIN(max_size, align) */
  88. if (align && align < max_size)
  89. max_size = align;
  90. tot = total_lowmem;
  91. for (bl = 128<<10; bl < max_size; bl <<= 1) {
  92. if (bl * 2 > tot)
  93. break;
  94. }
  95. setbat(2, KERNELBASE, PPC_MEMSTART, bl, _PAGE_RAM);
  96. done = (unsigned long)bat_addrs[2].limit - KERNELBASE + 1;
  97. if ((done < tot) && !bat_addrs[3].limit) {
  98. /* use BAT3 to cover a bit more */
  99. tot -= done;
  100. for (bl = 128<<10; bl < max_size; bl <<= 1)
  101. if (bl * 2 > tot)
  102. break;
  103. setbat(3, KERNELBASE+done, PPC_MEMSTART+done, bl, _PAGE_RAM);
  104. done = (unsigned long)bat_addrs[3].limit - KERNELBASE + 1;
  105. }
  106. return done;
  107. #endif
  108. }
  109. /*
  110. * Set up one of the I/D BAT (block address translation) register pairs.
  111. * The parameters are not checked; in particular size must be a power
  112. * of 2 between 128k and 256M.
  113. */
  114. void __init setbat(int index, unsigned long virt, unsigned long phys,
  115. unsigned int size, int flags)
  116. {
  117. unsigned int bl;
  118. int wimgxpp;
  119. union ubat *bat = BATS[index];
  120. if (((flags & _PAGE_NO_CACHE) == 0) &&
  121. cpu_has_feature(CPU_FTR_NEED_COHERENT))
  122. flags |= _PAGE_COHERENT;
  123. bl = (size >> 17) - 1;
  124. if (PVR_VER(mfspr(SPRN_PVR)) != 1) {
  125. /* 603, 604, etc. */
  126. /* Do DBAT first */
  127. wimgxpp = flags & (_PAGE_WRITETHRU | _PAGE_NO_CACHE
  128. | _PAGE_COHERENT | _PAGE_GUARDED);
  129. wimgxpp |= (flags & _PAGE_RW)? BPP_RW: BPP_RX;
  130. bat[1].word[0] = virt | (bl << 2) | 2; /* Vs=1, Vp=0 */
  131. bat[1].word[1] = phys | wimgxpp;
  132. #ifndef CONFIG_KGDB /* want user access for breakpoints */
  133. if (flags & _PAGE_USER)
  134. #endif
  135. bat[1].bat.batu.vp = 1;
  136. if (flags & _PAGE_GUARDED) {
  137. /* G bit must be zero in IBATs */
  138. bat[0].word[0] = bat[0].word[1] = 0;
  139. } else {
  140. /* make IBAT same as DBAT */
  141. bat[0] = bat[1];
  142. }
  143. } else {
  144. /* 601 cpu */
  145. if (bl > BL_8M)
  146. bl = BL_8M;
  147. wimgxpp = flags & (_PAGE_WRITETHRU | _PAGE_NO_CACHE
  148. | _PAGE_COHERENT);
  149. wimgxpp |= (flags & _PAGE_RW)?
  150. ((flags & _PAGE_USER)? PP_RWRW: PP_RWXX): PP_RXRX;
  151. bat->word[0] = virt | wimgxpp | 4; /* Ks=0, Ku=1 */
  152. bat->word[1] = phys | bl | 0x40; /* V=1 */
  153. }
  154. bat_addrs[index].start = virt;
  155. bat_addrs[index].limit = virt + ((bl + 1) << 17) - 1;
  156. bat_addrs[index].phys = phys;
  157. }
  158. /*
  159. * Preload a translation in the hash table
  160. */
  161. void hash_preload(struct mm_struct *mm, unsigned long ea,
  162. unsigned long access, unsigned long trap)
  163. {
  164. pmd_t *pmd;
  165. if (Hash == 0)
  166. return;
  167. pmd = pmd_offset(pud_offset(pgd_offset(mm, ea), ea), ea);
  168. if (!pmd_none(*pmd))
  169. add_hash_page(mm->context.id, ea, pmd_val(*pmd));
  170. }
  171. /*
  172. * Initialize the hash table and patch the instructions in hashtable.S.
  173. */
  174. void __init MMU_init_hw(void)
  175. {
  176. unsigned int hmask, mb, mb2;
  177. unsigned int n_hpteg, lg_n_hpteg;
  178. extern unsigned int hash_page_patch_A[];
  179. extern unsigned int hash_page_patch_B[], hash_page_patch_C[];
  180. extern unsigned int hash_page[];
  181. extern unsigned int flush_hash_patch_A[], flush_hash_patch_B[];
  182. if (!cpu_has_feature(CPU_FTR_HPTE_TABLE)) {
  183. /*
  184. * Put a blr (procedure return) instruction at the
  185. * start of hash_page, since we can still get DSI
  186. * exceptions on a 603.
  187. */
  188. hash_page[0] = 0x4e800020;
  189. flush_icache_range((unsigned long) &hash_page[0],
  190. (unsigned long) &hash_page[1]);
  191. return;
  192. }
  193. if ( ppc_md.progress ) ppc_md.progress("hash:enter", 0x105);
  194. #define LG_HPTEG_SIZE 6 /* 64 bytes per HPTEG */
  195. #define SDR1_LOW_BITS ((n_hpteg - 1) >> 10)
  196. #define MIN_N_HPTEG 1024 /* min 64kB hash table */
  197. /*
  198. * Allow 1 HPTE (1/8 HPTEG) for each page of memory.
  199. * This is less than the recommended amount, but then
  200. * Linux ain't AIX.
  201. */
  202. n_hpteg = total_memory / (PAGE_SIZE * 8);
  203. if (n_hpteg < MIN_N_HPTEG)
  204. n_hpteg = MIN_N_HPTEG;
  205. lg_n_hpteg = __ilog2(n_hpteg);
  206. if (n_hpteg & (n_hpteg - 1)) {
  207. ++lg_n_hpteg; /* round up if not power of 2 */
  208. n_hpteg = 1 << lg_n_hpteg;
  209. }
  210. Hash_size = n_hpteg << LG_HPTEG_SIZE;
  211. /*
  212. * Find some memory for the hash table.
  213. */
  214. if ( ppc_md.progress ) ppc_md.progress("hash:find piece", 0x322);
  215. Hash = __va(lmb_alloc_base(Hash_size, Hash_size,
  216. __initial_memory_limit));
  217. cacheable_memzero(Hash, Hash_size);
  218. _SDR1 = __pa(Hash) | SDR1_LOW_BITS;
  219. Hash_end = (PTE *) ((unsigned long)Hash + Hash_size);
  220. printk("Total memory = %ldMB; using %ldkB for hash table (at %p)\n",
  221. total_memory >> 20, Hash_size >> 10, Hash);
  222. /*
  223. * Patch up the instructions in hashtable.S:create_hpte
  224. */
  225. if ( ppc_md.progress ) ppc_md.progress("hash:patch", 0x345);
  226. Hash_mask = n_hpteg - 1;
  227. hmask = Hash_mask >> (16 - LG_HPTEG_SIZE);
  228. mb2 = mb = 32 - LG_HPTEG_SIZE - lg_n_hpteg;
  229. if (lg_n_hpteg > 16)
  230. mb2 = 16 - LG_HPTEG_SIZE;
  231. hash_page_patch_A[0] = (hash_page_patch_A[0] & ~0xffff)
  232. | ((unsigned int)(Hash) >> 16);
  233. hash_page_patch_A[1] = (hash_page_patch_A[1] & ~0x7c0) | (mb << 6);
  234. hash_page_patch_A[2] = (hash_page_patch_A[2] & ~0x7c0) | (mb2 << 6);
  235. hash_page_patch_B[0] = (hash_page_patch_B[0] & ~0xffff) | hmask;
  236. hash_page_patch_C[0] = (hash_page_patch_C[0] & ~0xffff) | hmask;
  237. /*
  238. * Ensure that the locations we've patched have been written
  239. * out from the data cache and invalidated in the instruction
  240. * cache, on those machines with split caches.
  241. */
  242. flush_icache_range((unsigned long) &hash_page_patch_A[0],
  243. (unsigned long) &hash_page_patch_C[1]);
  244. /*
  245. * Patch up the instructions in hashtable.S:flush_hash_page
  246. */
  247. flush_hash_patch_A[0] = (flush_hash_patch_A[0] & ~0xffff)
  248. | ((unsigned int)(Hash) >> 16);
  249. flush_hash_patch_A[1] = (flush_hash_patch_A[1] & ~0x7c0) | (mb << 6);
  250. flush_hash_patch_A[2] = (flush_hash_patch_A[2] & ~0x7c0) | (mb2 << 6);
  251. flush_hash_patch_B[0] = (flush_hash_patch_B[0] & ~0xffff) | hmask;
  252. flush_icache_range((unsigned long) &flush_hash_patch_A[0],
  253. (unsigned long) &flush_hash_patch_B[1]);
  254. if ( ppc_md.progress ) ppc_md.progress("hash:done", 0x205);
  255. }