pmb.c 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400
  1. /*
  2. * arch/sh/mm/pmb.c
  3. *
  4. * Privileged Space Mapping Buffer (PMB) Support.
  5. *
  6. * Copyright (C) 2005, 2006 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/module.h>
  19. #include <linux/slab.h>
  20. #include <linux/bitops.h>
  21. #include <linux/debugfs.h>
  22. #include <linux/fs.h>
  23. #include <linux/seq_file.h>
  24. #include <linux/err.h>
  25. #include <asm/system.h>
  26. #include <asm/uaccess.h>
  27. #include <asm/pgtable.h>
  28. #include <asm/mmu.h>
  29. #include <asm/io.h>
  30. #define NR_PMB_ENTRIES 16
  31. static struct kmem_cache *pmb_cache;
  32. static unsigned long pmb_map;
  33. static struct pmb_entry pmb_init_map[] = {
  34. /* vpn ppn flags (ub/sz/c/wt) */
  35. /* P1 Section Mappings */
  36. { 0x80000000, 0x00000000, PMB_SZ_64M | PMB_C, },
  37. { 0x84000000, 0x04000000, PMB_SZ_64M | PMB_C, },
  38. { 0x88000000, 0x08000000, PMB_SZ_128M | PMB_C, },
  39. { 0x90000000, 0x10000000, PMB_SZ_64M | PMB_C, },
  40. { 0x94000000, 0x14000000, PMB_SZ_64M | PMB_C, },
  41. { 0x98000000, 0x18000000, PMB_SZ_64M | PMB_C, },
  42. /* P2 Section Mappings */
  43. { 0xa0000000, 0x00000000, PMB_UB | PMB_SZ_64M | PMB_WT, },
  44. { 0xa4000000, 0x04000000, PMB_UB | PMB_SZ_64M | PMB_WT, },
  45. { 0xa8000000, 0x08000000, PMB_UB | PMB_SZ_128M | PMB_WT, },
  46. { 0xb0000000, 0x10000000, PMB_UB | PMB_SZ_64M | PMB_WT, },
  47. { 0xb4000000, 0x14000000, PMB_UB | PMB_SZ_64M | PMB_WT, },
  48. { 0xb8000000, 0x18000000, PMB_UB | PMB_SZ_64M | PMB_WT, },
  49. };
  50. static inline unsigned long mk_pmb_entry(unsigned int entry)
  51. {
  52. return (entry & PMB_E_MASK) << PMB_E_SHIFT;
  53. }
  54. static inline unsigned long mk_pmb_addr(unsigned int entry)
  55. {
  56. return mk_pmb_entry(entry) | PMB_ADDR;
  57. }
  58. static inline unsigned long mk_pmb_data(unsigned int entry)
  59. {
  60. return mk_pmb_entry(entry) | PMB_DATA;
  61. }
  62. struct pmb_entry *pmb_alloc(unsigned long vpn, unsigned long ppn,
  63. unsigned long flags)
  64. {
  65. struct pmb_entry *pmbe;
  66. pmbe = kmem_cache_alloc(pmb_cache, GFP_KERNEL);
  67. if (!pmbe)
  68. return ERR_PTR(-ENOMEM);
  69. pmbe->vpn = vpn;
  70. pmbe->ppn = ppn;
  71. pmbe->flags = flags;
  72. return pmbe;
  73. }
  74. void pmb_free(struct pmb_entry *pmbe)
  75. {
  76. kmem_cache_free(pmb_cache, pmbe);
  77. }
  78. /*
  79. * Must be in P2 for __set_pmb_entry()
  80. */
  81. int __set_pmb_entry(unsigned long vpn, unsigned long ppn,
  82. unsigned long flags, int *entry)
  83. {
  84. unsigned int pos = *entry;
  85. if (unlikely(pos == PMB_NO_ENTRY))
  86. pos = find_first_zero_bit(&pmb_map, NR_PMB_ENTRIES);
  87. repeat:
  88. if (unlikely(pos > NR_PMB_ENTRIES))
  89. return -ENOSPC;
  90. if (test_and_set_bit(pos, &pmb_map)) {
  91. pos = find_first_zero_bit(&pmb_map, NR_PMB_ENTRIES);
  92. goto repeat;
  93. }
  94. ctrl_outl(vpn | PMB_V, mk_pmb_addr(pos));
  95. #ifdef CONFIG_SH_WRITETHROUGH
  96. /*
  97. * When we are in 32-bit address extended mode, CCR.CB becomes
  98. * invalid, so care must be taken to manually adjust cacheable
  99. * translations.
  100. */
  101. if (likely(flags & PMB_C))
  102. flags |= PMB_WT;
  103. #endif
  104. ctrl_outl(ppn | flags | PMB_V, mk_pmb_data(pos));
  105. *entry = pos;
  106. return 0;
  107. }
  108. int set_pmb_entry(struct pmb_entry *pmbe)
  109. {
  110. int ret;
  111. jump_to_P2();
  112. ret = __set_pmb_entry(pmbe->vpn, pmbe->ppn, pmbe->flags, &pmbe->entry);
  113. back_to_P1();
  114. return ret;
  115. }
  116. void clear_pmb_entry(struct pmb_entry *pmbe)
  117. {
  118. unsigned int entry = pmbe->entry;
  119. unsigned long addr;
  120. /*
  121. * Don't allow clearing of wired init entries, P1 or P2 access
  122. * without a corresponding mapping in the PMB will lead to reset
  123. * by the TLB.
  124. */
  125. if (unlikely(entry < ARRAY_SIZE(pmb_init_map) ||
  126. entry >= NR_PMB_ENTRIES))
  127. return;
  128. jump_to_P2();
  129. /* Clear V-bit */
  130. addr = mk_pmb_addr(entry);
  131. ctrl_outl(ctrl_inl(addr) & ~PMB_V, addr);
  132. addr = mk_pmb_data(entry);
  133. ctrl_outl(ctrl_inl(addr) & ~PMB_V, addr);
  134. back_to_P1();
  135. clear_bit(entry, &pmb_map);
  136. }
  137. static DEFINE_SPINLOCK(pmb_list_lock);
  138. static struct pmb_entry *pmb_list;
  139. static inline void pmb_list_add(struct pmb_entry *pmbe)
  140. {
  141. struct pmb_entry **p, *tmp;
  142. p = &pmb_list;
  143. while ((tmp = *p) != NULL)
  144. p = &tmp->next;
  145. pmbe->next = tmp;
  146. *p = pmbe;
  147. }
  148. static inline void pmb_list_del(struct pmb_entry *pmbe)
  149. {
  150. struct pmb_entry **p, *tmp;
  151. for (p = &pmb_list; (tmp = *p); p = &tmp->next)
  152. if (tmp == pmbe) {
  153. *p = tmp->next;
  154. return;
  155. }
  156. }
  157. static struct {
  158. unsigned long size;
  159. int flag;
  160. } pmb_sizes[] = {
  161. { .size = 0x20000000, .flag = PMB_SZ_512M, },
  162. { .size = 0x08000000, .flag = PMB_SZ_128M, },
  163. { .size = 0x04000000, .flag = PMB_SZ_64M, },
  164. { .size = 0x01000000, .flag = PMB_SZ_16M, },
  165. };
  166. long pmb_remap(unsigned long vaddr, unsigned long phys,
  167. unsigned long size, unsigned long flags)
  168. {
  169. struct pmb_entry *pmbp;
  170. unsigned long wanted;
  171. int pmb_flags, i;
  172. /* Convert typical pgprot value to the PMB equivalent */
  173. if (flags & _PAGE_CACHABLE) {
  174. if (flags & _PAGE_WT)
  175. pmb_flags = PMB_WT;
  176. else
  177. pmb_flags = PMB_C;
  178. } else
  179. pmb_flags = PMB_WT | PMB_UB;
  180. pmbp = NULL;
  181. wanted = size;
  182. again:
  183. for (i = 0; i < ARRAY_SIZE(pmb_sizes); i++) {
  184. struct pmb_entry *pmbe;
  185. int ret;
  186. if (size < pmb_sizes[i].size)
  187. continue;
  188. pmbe = pmb_alloc(vaddr, phys, pmb_flags | pmb_sizes[i].flag);
  189. if (IS_ERR(pmbe))
  190. return PTR_ERR(pmbe);
  191. ret = set_pmb_entry(pmbe);
  192. if (ret != 0) {
  193. pmb_free(pmbe);
  194. return -EBUSY;
  195. }
  196. phys += pmb_sizes[i].size;
  197. vaddr += pmb_sizes[i].size;
  198. size -= pmb_sizes[i].size;
  199. /*
  200. * Link adjacent entries that span multiple PMB entries
  201. * for easier tear-down.
  202. */
  203. if (likely(pmbp))
  204. pmbp->link = pmbe;
  205. pmbp = pmbe;
  206. }
  207. if (size >= 0x1000000)
  208. goto again;
  209. return wanted - size;
  210. }
  211. void pmb_unmap(unsigned long addr)
  212. {
  213. struct pmb_entry **p, *pmbe;
  214. for (p = &pmb_list; (pmbe = *p); p = &pmbe->next)
  215. if (pmbe->vpn == addr)
  216. break;
  217. if (unlikely(!pmbe))
  218. return;
  219. WARN_ON(!test_bit(pmbe->entry, &pmb_map));
  220. do {
  221. struct pmb_entry *pmblink = pmbe;
  222. clear_pmb_entry(pmbe);
  223. pmbe = pmblink->link;
  224. pmb_free(pmblink);
  225. } while (pmbe);
  226. }
  227. static void pmb_cache_ctor(void *pmb, struct kmem_cache *cachep, unsigned long flags)
  228. {
  229. struct pmb_entry *pmbe = pmb;
  230. memset(pmb, 0, sizeof(struct pmb_entry));
  231. spin_lock_irq(&pmb_list_lock);
  232. pmbe->entry = PMB_NO_ENTRY;
  233. pmb_list_add(pmbe);
  234. spin_unlock_irq(&pmb_list_lock);
  235. }
  236. static void pmb_cache_dtor(void *pmb, struct kmem_cache *cachep, unsigned long flags)
  237. {
  238. spin_lock_irq(&pmb_list_lock);
  239. pmb_list_del(pmb);
  240. spin_unlock_irq(&pmb_list_lock);
  241. }
  242. static int __init pmb_init(void)
  243. {
  244. unsigned int nr_entries = ARRAY_SIZE(pmb_init_map);
  245. unsigned int entry;
  246. BUG_ON(unlikely(nr_entries >= NR_PMB_ENTRIES));
  247. pmb_cache = kmem_cache_create("pmb", sizeof(struct pmb_entry),
  248. 0, 0, pmb_cache_ctor, pmb_cache_dtor);
  249. BUG_ON(!pmb_cache);
  250. jump_to_P2();
  251. /*
  252. * Ordering is important, P2 must be mapped in the PMB before we
  253. * can set PMB.SE, and P1 must be mapped before we jump back to
  254. * P1 space.
  255. */
  256. for (entry = 0; entry < nr_entries; entry++) {
  257. struct pmb_entry *pmbe = pmb_init_map + entry;
  258. __set_pmb_entry(pmbe->vpn, pmbe->ppn, pmbe->flags, &entry);
  259. }
  260. ctrl_outl(0, PMB_IRMCR);
  261. /* PMB.SE and UB[7] */
  262. ctrl_outl((1 << 31) | (1 << 7), PMB_PASCR);
  263. back_to_P1();
  264. return 0;
  265. }
  266. arch_initcall(pmb_init);
  267. static int pmb_seq_show(struct seq_file *file, void *iter)
  268. {
  269. int i;
  270. seq_printf(file, "V: Valid, C: Cacheable, WT: Write-Through\n"
  271. "CB: Copy-Back, B: Buffered, UB: Unbuffered\n");
  272. seq_printf(file, "ety vpn ppn size flags\n");
  273. for (i = 0; i < NR_PMB_ENTRIES; i++) {
  274. unsigned long addr, data;
  275. unsigned int size;
  276. char *sz_str = NULL;
  277. addr = ctrl_inl(mk_pmb_addr(i));
  278. data = ctrl_inl(mk_pmb_data(i));
  279. size = data & PMB_SZ_MASK;
  280. sz_str = (size == PMB_SZ_16M) ? " 16MB":
  281. (size == PMB_SZ_64M) ? " 64MB":
  282. (size == PMB_SZ_128M) ? "128MB":
  283. "512MB";
  284. /* 02: V 0x88 0x08 128MB C CB B */
  285. seq_printf(file, "%02d: %c 0x%02lx 0x%02lx %s %c %s %s\n",
  286. i, ((addr & PMB_V) && (data & PMB_V)) ? 'V' : ' ',
  287. (addr >> 24) & 0xff, (data >> 24) & 0xff,
  288. sz_str, (data & PMB_C) ? 'C' : ' ',
  289. (data & PMB_WT) ? "WT" : "CB",
  290. (data & PMB_UB) ? "UB" : " B");
  291. }
  292. return 0;
  293. }
  294. static int pmb_debugfs_open(struct inode *inode, struct file *file)
  295. {
  296. return single_open(file, pmb_seq_show, NULL);
  297. }
  298. static struct file_operations pmb_debugfs_fops = {
  299. .owner = THIS_MODULE,
  300. .open = pmb_debugfs_open,
  301. .read = seq_read,
  302. .llseek = seq_lseek,
  303. .release = seq_release,
  304. };
  305. static int __init pmb_debugfs_init(void)
  306. {
  307. struct dentry *dentry;
  308. dentry = debugfs_create_file("pmb", S_IFREG | S_IRUGO,
  309. NULL, NULL, &pmb_debugfs_fops);
  310. if (IS_ERR(dentry))
  311. return PTR_ERR(dentry);
  312. return 0;
  313. }
  314. postcore_initcall(pmb_debugfs_init);