ppc_mmu.c 7.8 KB

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