ppc_mmu.c 7.8 KB

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