pmb.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464
  1. /*
  2. * arch/sh/mm/pmb.c
  3. *
  4. * Privileged Space Mapping Buffer (PMB) Support.
  5. *
  6. * Copyright (C) 2005, 2006, 2007 Paul Mundt
  7. *
  8. * P1/P2 Section mapping definitions from map32.h, which was:
  9. *
  10. * Copyright 2003 (c) Lineo Solutions,Inc.
  11. *
  12. * This file is subject to the terms and conditions of the GNU General Public
  13. * License. See the file "COPYING" in the main directory of this archive
  14. * for more details.
  15. */
  16. #include <linux/init.h>
  17. #include <linux/kernel.h>
  18. #include <linux/sysdev.h>
  19. #include <linux/cpu.h>
  20. #include <linux/module.h>
  21. #include <linux/slab.h>
  22. #include <linux/bitops.h>
  23. #include <linux/debugfs.h>
  24. #include <linux/fs.h>
  25. #include <linux/seq_file.h>
  26. #include <linux/err.h>
  27. #include <asm/system.h>
  28. #include <asm/uaccess.h>
  29. #include <asm/pgtable.h>
  30. #include <asm/mmu.h>
  31. #include <asm/io.h>
  32. #include <asm/mmu_context.h>
  33. #define NR_PMB_ENTRIES 16
  34. static void __pmb_unmap(struct pmb_entry *);
  35. static struct kmem_cache *pmb_cache;
  36. static unsigned long pmb_map;
  37. static struct pmb_entry pmb_init_map[] = {
  38. /* vpn ppn flags (ub/sz/c/wt) */
  39. /* P1 Section Mappings */
  40. { 0x80000000, 0x00000000, PMB_SZ_64M | PMB_C, },
  41. { 0x84000000, 0x04000000, PMB_SZ_64M | PMB_C, },
  42. { 0x88000000, 0x08000000, PMB_SZ_128M | PMB_C, },
  43. { 0x90000000, 0x10000000, PMB_SZ_64M | PMB_C, },
  44. { 0x94000000, 0x14000000, PMB_SZ_64M | PMB_C, },
  45. { 0x98000000, 0x18000000, PMB_SZ_64M | PMB_C, },
  46. /* P2 Section Mappings */
  47. { 0xa0000000, 0x00000000, PMB_UB | PMB_SZ_64M | PMB_WT, },
  48. { 0xa4000000, 0x04000000, PMB_UB | PMB_SZ_64M | PMB_WT, },
  49. { 0xa8000000, 0x08000000, PMB_UB | PMB_SZ_128M | PMB_WT, },
  50. { 0xb0000000, 0x10000000, PMB_UB | PMB_SZ_64M | PMB_WT, },
  51. { 0xb4000000, 0x14000000, PMB_UB | PMB_SZ_64M | PMB_WT, },
  52. { 0xb8000000, 0x18000000, PMB_UB | PMB_SZ_64M | PMB_WT, },
  53. };
  54. static inline unsigned long mk_pmb_entry(unsigned int entry)
  55. {
  56. return (entry & PMB_E_MASK) << PMB_E_SHIFT;
  57. }
  58. static inline unsigned long mk_pmb_addr(unsigned int entry)
  59. {
  60. return mk_pmb_entry(entry) | PMB_ADDR;
  61. }
  62. static inline unsigned long mk_pmb_data(unsigned int entry)
  63. {
  64. return mk_pmb_entry(entry) | PMB_DATA;
  65. }
  66. static DEFINE_SPINLOCK(pmb_list_lock);
  67. static struct pmb_entry *pmb_list;
  68. static inline void pmb_list_add(struct pmb_entry *pmbe)
  69. {
  70. struct pmb_entry **p, *tmp;
  71. p = &pmb_list;
  72. while ((tmp = *p) != NULL)
  73. p = &tmp->next;
  74. pmbe->next = tmp;
  75. *p = pmbe;
  76. }
  77. static inline void pmb_list_del(struct pmb_entry *pmbe)
  78. {
  79. struct pmb_entry **p, *tmp;
  80. for (p = &pmb_list; (tmp = *p); p = &tmp->next)
  81. if (tmp == pmbe) {
  82. *p = tmp->next;
  83. return;
  84. }
  85. }
  86. static int pmb_alloc_entry(void)
  87. {
  88. unsigned int pos;
  89. repeat:
  90. pos = find_first_zero_bit(&pmb_map, NR_PMB_ENTRIES);
  91. if (unlikely(pos > NR_PMB_ENTRIES))
  92. return -ENOSPC;
  93. if (test_and_set_bit(pos, &pmb_map))
  94. goto repeat;
  95. return pos;
  96. }
  97. static struct pmb_entry *pmb_alloc(unsigned long vpn, unsigned long ppn,
  98. unsigned long flags)
  99. {
  100. struct pmb_entry *pmbe;
  101. int pos;
  102. pos = pmb_alloc_entry();
  103. if (pos < 0)
  104. return ERR_PTR(pos);
  105. pmbe = kmem_cache_alloc(pmb_cache, GFP_KERNEL);
  106. if (!pmbe)
  107. return ERR_PTR(-ENOMEM);
  108. pmbe->vpn = vpn;
  109. pmbe->ppn = ppn;
  110. pmbe->flags = flags;
  111. pmbe->entry = pos;
  112. spin_lock_irq(&pmb_list_lock);
  113. pmb_list_add(pmbe);
  114. spin_unlock_irq(&pmb_list_lock);
  115. return pmbe;
  116. }
  117. static void pmb_free(struct pmb_entry *pmbe)
  118. {
  119. spin_lock_irq(&pmb_list_lock);
  120. pmb_list_del(pmbe);
  121. spin_unlock_irq(&pmb_list_lock);
  122. kmem_cache_free(pmb_cache, pmbe);
  123. }
  124. /*
  125. * Must be in P2 for __set_pmb_entry()
  126. */
  127. static void __set_pmb_entry(unsigned long vpn, unsigned long ppn,
  128. unsigned long flags, int pos)
  129. {
  130. ctrl_outl(vpn | PMB_V, mk_pmb_addr(pos));
  131. #ifdef CONFIG_CACHE_WRITETHROUGH
  132. /*
  133. * When we are in 32-bit address extended mode, CCR.CB becomes
  134. * invalid, so care must be taken to manually adjust cacheable
  135. * translations.
  136. */
  137. if (likely(flags & PMB_C))
  138. flags |= PMB_WT;
  139. #endif
  140. ctrl_outl(ppn | flags | PMB_V, mk_pmb_data(pos));
  141. }
  142. static void __uses_jump_to_uncached set_pmb_entry(struct pmb_entry *pmbe)
  143. {
  144. jump_to_uncached();
  145. __set_pmb_entry(pmbe->vpn, pmbe->ppn, pmbe->flags, pmbe->entry);
  146. back_to_cached();
  147. }
  148. static void __uses_jump_to_uncached clear_pmb_entry(struct pmb_entry *pmbe)
  149. {
  150. unsigned int entry = pmbe->entry;
  151. unsigned long addr;
  152. /*
  153. * Don't allow clearing of wired init entries, P1 or P2 access
  154. * without a corresponding mapping in the PMB will lead to reset
  155. * by the TLB.
  156. */
  157. if (unlikely(entry < ARRAY_SIZE(pmb_init_map) ||
  158. entry >= NR_PMB_ENTRIES))
  159. return;
  160. jump_to_uncached();
  161. /* Clear V-bit */
  162. addr = mk_pmb_addr(entry);
  163. ctrl_outl(ctrl_inl(addr) & ~PMB_V, addr);
  164. addr = mk_pmb_data(entry);
  165. ctrl_outl(ctrl_inl(addr) & ~PMB_V, addr);
  166. back_to_cached();
  167. clear_bit(entry, &pmb_map);
  168. }
  169. static struct {
  170. unsigned long size;
  171. int flag;
  172. } pmb_sizes[] = {
  173. { .size = 0x20000000, .flag = PMB_SZ_512M, },
  174. { .size = 0x08000000, .flag = PMB_SZ_128M, },
  175. { .size = 0x04000000, .flag = PMB_SZ_64M, },
  176. { .size = 0x01000000, .flag = PMB_SZ_16M, },
  177. };
  178. long pmb_remap(unsigned long vaddr, unsigned long phys,
  179. unsigned long size, unsigned long flags)
  180. {
  181. struct pmb_entry *pmbp, *pmbe;
  182. unsigned long wanted;
  183. int pmb_flags, i;
  184. long err;
  185. /* Convert typical pgprot value to the PMB equivalent */
  186. if (flags & _PAGE_CACHABLE) {
  187. if (flags & _PAGE_WT)
  188. pmb_flags = PMB_WT;
  189. else
  190. pmb_flags = PMB_C;
  191. } else
  192. pmb_flags = PMB_WT | PMB_UB;
  193. pmbp = NULL;
  194. wanted = size;
  195. again:
  196. for (i = 0; i < ARRAY_SIZE(pmb_sizes); i++) {
  197. if (size < pmb_sizes[i].size)
  198. continue;
  199. pmbe = pmb_alloc(vaddr, phys, pmb_flags | pmb_sizes[i].flag);
  200. if (IS_ERR(pmbe)) {
  201. err = PTR_ERR(pmbe);
  202. goto out;
  203. }
  204. set_pmb_entry(pmbe);
  205. phys += pmb_sizes[i].size;
  206. vaddr += pmb_sizes[i].size;
  207. size -= pmb_sizes[i].size;
  208. /*
  209. * Link adjacent entries that span multiple PMB entries
  210. * for easier tear-down.
  211. */
  212. if (likely(pmbp))
  213. pmbp->link = pmbe;
  214. pmbp = pmbe;
  215. /*
  216. * Instead of trying smaller sizes on every iteration
  217. * (even if we succeed in allocating space), try using
  218. * pmb_sizes[i].size again.
  219. */
  220. i--;
  221. }
  222. if (size >= 0x1000000)
  223. goto again;
  224. return wanted - size;
  225. out:
  226. if (pmbp)
  227. __pmb_unmap(pmbp);
  228. return err;
  229. }
  230. void pmb_unmap(unsigned long addr)
  231. {
  232. struct pmb_entry **p, *pmbe;
  233. for (p = &pmb_list; (pmbe = *p); p = &pmbe->next)
  234. if (pmbe->vpn == addr)
  235. break;
  236. if (unlikely(!pmbe))
  237. return;
  238. __pmb_unmap(pmbe);
  239. }
  240. static void __pmb_unmap(struct pmb_entry *pmbe)
  241. {
  242. WARN_ON(!test_bit(pmbe->entry, &pmb_map));
  243. do {
  244. struct pmb_entry *pmblink = pmbe;
  245. /*
  246. * We may be called before this pmb_entry has been
  247. * entered into the PMB table via set_pmb_entry(), but
  248. * that's OK because we've allocated a unique slot for
  249. * this entry in pmb_alloc() (even if we haven't filled
  250. * it yet).
  251. *
  252. * Therefore, calling clear_pmb_entry() is safe as no
  253. * other mapping can be using that slot.
  254. */
  255. clear_pmb_entry(pmbe);
  256. pmbe = pmblink->link;
  257. pmb_free(pmblink);
  258. } while (pmbe);
  259. }
  260. static void pmb_cache_ctor(void *pmb)
  261. {
  262. memset(pmb, 0, sizeof(struct pmb_entry));
  263. }
  264. int __uses_jump_to_uncached pmb_init(void)
  265. {
  266. unsigned int nr_entries = ARRAY_SIZE(pmb_init_map);
  267. unsigned int entry, i;
  268. BUG_ON(unlikely(nr_entries >= NR_PMB_ENTRIES));
  269. pmb_cache = kmem_cache_create("pmb", sizeof(struct pmb_entry), 0,
  270. SLAB_PANIC, pmb_cache_ctor);
  271. jump_to_uncached();
  272. /*
  273. * Ordering is important, P2 must be mapped in the PMB before we
  274. * can set PMB.SE, and P1 must be mapped before we jump back to
  275. * P1 space.
  276. */
  277. for (entry = 0; entry < nr_entries; entry++) {
  278. struct pmb_entry *pmbe = pmb_init_map + entry;
  279. __set_pmb_entry(pmbe->vpn, pmbe->ppn, pmbe->flags, entry);
  280. }
  281. ctrl_outl(0, PMB_IRMCR);
  282. /* PMB.SE and UB[7] */
  283. ctrl_outl((1 << 31) | (1 << 7), PMB_PASCR);
  284. /* Flush out the TLB */
  285. i = ctrl_inl(MMUCR);
  286. i |= MMUCR_TI;
  287. ctrl_outl(i, MMUCR);
  288. back_to_cached();
  289. return 0;
  290. }
  291. static int pmb_seq_show(struct seq_file *file, void *iter)
  292. {
  293. int i;
  294. seq_printf(file, "V: Valid, C: Cacheable, WT: Write-Through\n"
  295. "CB: Copy-Back, B: Buffered, UB: Unbuffered\n");
  296. seq_printf(file, "ety vpn ppn size flags\n");
  297. for (i = 0; i < NR_PMB_ENTRIES; i++) {
  298. unsigned long addr, data;
  299. unsigned int size;
  300. char *sz_str = NULL;
  301. addr = ctrl_inl(mk_pmb_addr(i));
  302. data = ctrl_inl(mk_pmb_data(i));
  303. size = data & PMB_SZ_MASK;
  304. sz_str = (size == PMB_SZ_16M) ? " 16MB":
  305. (size == PMB_SZ_64M) ? " 64MB":
  306. (size == PMB_SZ_128M) ? "128MB":
  307. "512MB";
  308. /* 02: V 0x88 0x08 128MB C CB B */
  309. seq_printf(file, "%02d: %c 0x%02lx 0x%02lx %s %c %s %s\n",
  310. i, ((addr & PMB_V) && (data & PMB_V)) ? 'V' : ' ',
  311. (addr >> 24) & 0xff, (data >> 24) & 0xff,
  312. sz_str, (data & PMB_C) ? 'C' : ' ',
  313. (data & PMB_WT) ? "WT" : "CB",
  314. (data & PMB_UB) ? "UB" : " B");
  315. }
  316. return 0;
  317. }
  318. static int pmb_debugfs_open(struct inode *inode, struct file *file)
  319. {
  320. return single_open(file, pmb_seq_show, NULL);
  321. }
  322. static const struct file_operations pmb_debugfs_fops = {
  323. .owner = THIS_MODULE,
  324. .open = pmb_debugfs_open,
  325. .read = seq_read,
  326. .llseek = seq_lseek,
  327. .release = single_release,
  328. };
  329. static int __init pmb_debugfs_init(void)
  330. {
  331. struct dentry *dentry;
  332. dentry = debugfs_create_file("pmb", S_IFREG | S_IRUGO,
  333. sh_debugfs_root, NULL, &pmb_debugfs_fops);
  334. if (!dentry)
  335. return -ENOMEM;
  336. if (IS_ERR(dentry))
  337. return PTR_ERR(dentry);
  338. return 0;
  339. }
  340. postcore_initcall(pmb_debugfs_init);
  341. #ifdef CONFIG_PM
  342. static int pmb_sysdev_suspend(struct sys_device *dev, pm_message_t state)
  343. {
  344. static pm_message_t prev_state;
  345. /* Restore the PMB after a resume from hibernation */
  346. if (state.event == PM_EVENT_ON &&
  347. prev_state.event == PM_EVENT_FREEZE) {
  348. struct pmb_entry *pmbe;
  349. spin_lock_irq(&pmb_list_lock);
  350. for (pmbe = pmb_list; pmbe; pmbe = pmbe->next)
  351. set_pmb_entry(pmbe);
  352. spin_unlock_irq(&pmb_list_lock);
  353. }
  354. prev_state = state;
  355. return 0;
  356. }
  357. static int pmb_sysdev_resume(struct sys_device *dev)
  358. {
  359. return pmb_sysdev_suspend(dev, PMSG_ON);
  360. }
  361. static struct sysdev_driver pmb_sysdev_driver = {
  362. .suspend = pmb_sysdev_suspend,
  363. .resume = pmb_sysdev_resume,
  364. };
  365. static int __init pmb_sysdev_init(void)
  366. {
  367. return sysdev_driver_register(&cpu_sysdev_class, &pmb_sysdev_driver);
  368. }
  369. subsys_initcall(pmb_sysdev_init);
  370. #endif