mmu_context_nohash.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464
  1. /*
  2. * This file contains the routines for handling the MMU on those
  3. * PowerPC implementations where the MMU is not using the hash
  4. * table, such as 8xx, 4xx, BookE's etc...
  5. *
  6. * Copyright 2008 Ben Herrenschmidt <benh@kernel.crashing.org>
  7. * IBM Corp.
  8. *
  9. * Derived from previous arch/powerpc/mm/mmu_context.c
  10. * and arch/powerpc/include/asm/mmu_context.h
  11. *
  12. * This program is free software; you can redistribute it and/or
  13. * modify it under the terms of the GNU General Public License
  14. * as published by the Free Software Foundation; either version
  15. * 2 of the License, or (at your option) any later version.
  16. *
  17. * TODO:
  18. *
  19. * - The global context lock will not scale very well
  20. * - The maps should be dynamically allocated to allow for processors
  21. * that support more PID bits at runtime
  22. * - Implement flush_tlb_mm() by making the context stale and picking
  23. * a new one
  24. * - More aggressively clear stale map bits and maybe find some way to
  25. * also clear mm->cpu_vm_mask bits when processes are migrated
  26. */
  27. //#define DEBUG_MAP_CONSISTENCY
  28. //#define DEBUG_CLAMP_LAST_CONTEXT 31
  29. //#define DEBUG_HARDER
  30. /* We don't use DEBUG because it tends to be compiled in always nowadays
  31. * and this would generate way too much output
  32. */
  33. #ifdef DEBUG_HARDER
  34. #define pr_hard(args...) printk(KERN_DEBUG args)
  35. #define pr_hardcont(args...) printk(KERN_CONT args)
  36. #else
  37. #define pr_hard(args...) do { } while(0)
  38. #define pr_hardcont(args...) do { } while(0)
  39. #endif
  40. #include <linux/kernel.h>
  41. #include <linux/mm.h>
  42. #include <linux/init.h>
  43. #include <linux/spinlock.h>
  44. #include <linux/bootmem.h>
  45. #include <linux/notifier.h>
  46. #include <linux/cpu.h>
  47. #include <linux/slab.h>
  48. #include <asm/mmu_context.h>
  49. #include <asm/tlbflush.h>
  50. static unsigned int first_context, last_context;
  51. static unsigned int next_context, nr_free_contexts;
  52. static unsigned long *context_map;
  53. static unsigned long *stale_map[NR_CPUS];
  54. static struct mm_struct **context_mm;
  55. static DEFINE_RAW_SPINLOCK(context_lock);
  56. #define CTX_MAP_SIZE \
  57. (sizeof(unsigned long) * (last_context / BITS_PER_LONG + 1))
  58. /* Steal a context from a task that has one at the moment.
  59. *
  60. * This is used when we are running out of available PID numbers
  61. * on the processors.
  62. *
  63. * This isn't an LRU system, it just frees up each context in
  64. * turn (sort-of pseudo-random replacement :). This would be the
  65. * place to implement an LRU scheme if anyone was motivated to do it.
  66. * -- paulus
  67. *
  68. * For context stealing, we use a slightly different approach for
  69. * SMP and UP. Basically, the UP one is simpler and doesn't use
  70. * the stale map as we can just flush the local CPU
  71. * -- benh
  72. */
  73. #ifdef CONFIG_SMP
  74. static unsigned int steal_context_smp(unsigned int id)
  75. {
  76. struct mm_struct *mm;
  77. unsigned int cpu, max, i;
  78. max = last_context - first_context;
  79. /* Attempt to free next_context first and then loop until we manage */
  80. while (max--) {
  81. /* Pick up the victim mm */
  82. mm = context_mm[id];
  83. /* We have a candidate victim, check if it's active, on SMP
  84. * we cannot steal active contexts
  85. */
  86. if (mm->context.active) {
  87. id++;
  88. if (id > last_context)
  89. id = first_context;
  90. continue;
  91. }
  92. pr_hardcont(" | steal %d from 0x%p", id, mm);
  93. /* Mark this mm has having no context anymore */
  94. mm->context.id = MMU_NO_CONTEXT;
  95. /* Mark it stale on all CPUs that used this mm. For threaded
  96. * implementations, we set it on all threads on each core
  97. * represented in the mask. A future implementation will use
  98. * a core map instead but this will do for now.
  99. */
  100. for_each_cpu(cpu, mm_cpumask(mm)) {
  101. for (i = cpu_first_thread_sibling(cpu);
  102. i <= cpu_last_thread_sibling(cpu); i++)
  103. __set_bit(id, stale_map[i]);
  104. cpu = i - 1;
  105. }
  106. return id;
  107. }
  108. /* This will happen if you have more CPUs than available contexts,
  109. * all we can do here is wait a bit and try again
  110. */
  111. raw_spin_unlock(&context_lock);
  112. cpu_relax();
  113. raw_spin_lock(&context_lock);
  114. /* This will cause the caller to try again */
  115. return MMU_NO_CONTEXT;
  116. }
  117. #endif /* CONFIG_SMP */
  118. /* Note that this will also be called on SMP if all other CPUs are
  119. * offlined, which means that it may be called for cpu != 0. For
  120. * this to work, we somewhat assume that CPUs that are onlined
  121. * come up with a fully clean TLB (or are cleaned when offlined)
  122. */
  123. static unsigned int steal_context_up(unsigned int id)
  124. {
  125. struct mm_struct *mm;
  126. int cpu = smp_processor_id();
  127. /* Pick up the victim mm */
  128. mm = context_mm[id];
  129. pr_hardcont(" | steal %d from 0x%p", id, mm);
  130. /* Flush the TLB for that context */
  131. local_flush_tlb_mm(mm);
  132. /* Mark this mm has having no context anymore */
  133. mm->context.id = MMU_NO_CONTEXT;
  134. /* XXX This clear should ultimately be part of local_flush_tlb_mm */
  135. __clear_bit(id, stale_map[cpu]);
  136. return id;
  137. }
  138. #ifdef DEBUG_MAP_CONSISTENCY
  139. static void context_check_map(void)
  140. {
  141. unsigned int id, nrf, nact;
  142. nrf = nact = 0;
  143. for (id = first_context; id <= last_context; id++) {
  144. int used = test_bit(id, context_map);
  145. if (!used)
  146. nrf++;
  147. if (used != (context_mm[id] != NULL))
  148. pr_err("MMU: Context %d is %s and MM is %p !\n",
  149. id, used ? "used" : "free", context_mm[id]);
  150. if (context_mm[id] != NULL)
  151. nact += context_mm[id]->context.active;
  152. }
  153. if (nrf != nr_free_contexts) {
  154. pr_err("MMU: Free context count out of sync ! (%d vs %d)\n",
  155. nr_free_contexts, nrf);
  156. nr_free_contexts = nrf;
  157. }
  158. if (nact > num_online_cpus())
  159. pr_err("MMU: More active contexts than CPUs ! (%d vs %d)\n",
  160. nact, num_online_cpus());
  161. if (first_context > 0 && !test_bit(0, context_map))
  162. pr_err("MMU: Context 0 has been freed !!!\n");
  163. }
  164. #else
  165. static void context_check_map(void) { }
  166. #endif
  167. void switch_mmu_context(struct mm_struct *prev, struct mm_struct *next)
  168. {
  169. unsigned int i, id, cpu = smp_processor_id();
  170. unsigned long *map;
  171. /* No lockless fast path .. yet */
  172. raw_spin_lock(&context_lock);
  173. pr_hard("[%d] activating context for mm @%p, active=%d, id=%d",
  174. cpu, next, next->context.active, next->context.id);
  175. #ifdef CONFIG_SMP
  176. /* Mark us active and the previous one not anymore */
  177. next->context.active++;
  178. if (prev) {
  179. pr_hardcont(" (old=0x%p a=%d)", prev, prev->context.active);
  180. WARN_ON(prev->context.active < 1);
  181. prev->context.active--;
  182. }
  183. again:
  184. #endif /* CONFIG_SMP */
  185. /* If we already have a valid assigned context, skip all that */
  186. id = next->context.id;
  187. if (likely(id != MMU_NO_CONTEXT)) {
  188. #ifdef DEBUG_MAP_CONSISTENCY
  189. if (context_mm[id] != next)
  190. pr_err("MMU: mm 0x%p has id %d but context_mm[%d] says 0x%p\n",
  191. next, id, id, context_mm[id]);
  192. #endif
  193. goto ctxt_ok;
  194. }
  195. /* We really don't have a context, let's try to acquire one */
  196. id = next_context;
  197. if (id > last_context)
  198. id = first_context;
  199. map = context_map;
  200. /* No more free contexts, let's try to steal one */
  201. if (nr_free_contexts == 0) {
  202. #ifdef CONFIG_SMP
  203. if (num_online_cpus() > 1) {
  204. id = steal_context_smp(id);
  205. if (id == MMU_NO_CONTEXT)
  206. goto again;
  207. goto stolen;
  208. }
  209. #endif /* CONFIG_SMP */
  210. id = steal_context_up(id);
  211. goto stolen;
  212. }
  213. nr_free_contexts--;
  214. /* We know there's at least one free context, try to find it */
  215. while (__test_and_set_bit(id, map)) {
  216. id = find_next_zero_bit(map, last_context+1, id);
  217. if (id > last_context)
  218. id = first_context;
  219. }
  220. stolen:
  221. next_context = id + 1;
  222. context_mm[id] = next;
  223. next->context.id = id;
  224. pr_hardcont(" | new id=%d,nrf=%d", id, nr_free_contexts);
  225. context_check_map();
  226. ctxt_ok:
  227. /* If that context got marked stale on this CPU, then flush the
  228. * local TLB for it and unmark it before we use it
  229. */
  230. if (test_bit(id, stale_map[cpu])) {
  231. pr_hardcont(" | stale flush %d [%d..%d]",
  232. id, cpu_first_thread_sibling(cpu),
  233. cpu_last_thread_sibling(cpu));
  234. local_flush_tlb_mm(next);
  235. /* XXX This clear should ultimately be part of local_flush_tlb_mm */
  236. for (i = cpu_first_thread_sibling(cpu);
  237. i <= cpu_last_thread_sibling(cpu); i++) {
  238. __clear_bit(id, stale_map[i]);
  239. }
  240. }
  241. /* Flick the MMU and release lock */
  242. pr_hardcont(" -> %d\n", id);
  243. set_context(id, next->pgd);
  244. raw_spin_unlock(&context_lock);
  245. }
  246. /*
  247. * Set up the context for a new address space.
  248. */
  249. int init_new_context(struct task_struct *t, struct mm_struct *mm)
  250. {
  251. pr_hard("initing context for mm @%p\n", mm);
  252. mm->context.id = MMU_NO_CONTEXT;
  253. mm->context.active = 0;
  254. #ifdef CONFIG_PPC_MM_SLICES
  255. if (slice_mm_new_context(mm))
  256. slice_set_user_psize(mm, mmu_virtual_psize);
  257. #endif
  258. return 0;
  259. }
  260. /*
  261. * We're finished using the context for an address space.
  262. */
  263. void destroy_context(struct mm_struct *mm)
  264. {
  265. unsigned long flags;
  266. unsigned int id;
  267. if (mm->context.id == MMU_NO_CONTEXT)
  268. return;
  269. WARN_ON(mm->context.active != 0);
  270. raw_spin_lock_irqsave(&context_lock, flags);
  271. id = mm->context.id;
  272. if (id != MMU_NO_CONTEXT) {
  273. __clear_bit(id, context_map);
  274. mm->context.id = MMU_NO_CONTEXT;
  275. #ifdef DEBUG_MAP_CONSISTENCY
  276. mm->context.active = 0;
  277. #endif
  278. context_mm[id] = NULL;
  279. nr_free_contexts++;
  280. }
  281. raw_spin_unlock_irqrestore(&context_lock, flags);
  282. }
  283. #ifdef CONFIG_SMP
  284. static int __cpuinit mmu_context_cpu_notify(struct notifier_block *self,
  285. unsigned long action, void *hcpu)
  286. {
  287. unsigned int cpu = (unsigned int)(long)hcpu;
  288. #ifdef CONFIG_HOTPLUG_CPU
  289. struct task_struct *p;
  290. #endif
  291. /* We don't touch CPU 0 map, it's allocated at aboot and kept
  292. * around forever
  293. */
  294. if (cpu == boot_cpuid)
  295. return NOTIFY_OK;
  296. switch (action) {
  297. case CPU_UP_PREPARE:
  298. case CPU_UP_PREPARE_FROZEN:
  299. pr_devel("MMU: Allocating stale context map for CPU %d\n", cpu);
  300. stale_map[cpu] = kzalloc(CTX_MAP_SIZE, GFP_KERNEL);
  301. break;
  302. #ifdef CONFIG_HOTPLUG_CPU
  303. case CPU_UP_CANCELED:
  304. case CPU_UP_CANCELED_FROZEN:
  305. case CPU_DEAD:
  306. case CPU_DEAD_FROZEN:
  307. pr_devel("MMU: Freeing stale context map for CPU %d\n", cpu);
  308. kfree(stale_map[cpu]);
  309. stale_map[cpu] = NULL;
  310. /* We also clear the cpu_vm_mask bits of CPUs going away */
  311. read_lock(&tasklist_lock);
  312. for_each_process(p) {
  313. if (p->mm)
  314. cpumask_clear_cpu(cpu, mm_cpumask(p->mm));
  315. }
  316. read_unlock(&tasklist_lock);
  317. break;
  318. #endif /* CONFIG_HOTPLUG_CPU */
  319. }
  320. return NOTIFY_OK;
  321. }
  322. static struct notifier_block __cpuinitdata mmu_context_cpu_nb = {
  323. .notifier_call = mmu_context_cpu_notify,
  324. };
  325. #endif /* CONFIG_SMP */
  326. /*
  327. * Initialize the context management stuff.
  328. */
  329. void __init mmu_context_init(void)
  330. {
  331. /* Mark init_mm as being active on all possible CPUs since
  332. * we'll get called with prev == init_mm the first time
  333. * we schedule on a given CPU
  334. */
  335. init_mm.context.active = NR_CPUS;
  336. /*
  337. * The MPC8xx has only 16 contexts. We rotate through them on each
  338. * task switch. A better way would be to keep track of tasks that
  339. * own contexts, and implement an LRU usage. That way very active
  340. * tasks don't always have to pay the TLB reload overhead. The
  341. * kernel pages are mapped shared, so the kernel can run on behalf
  342. * of any task that makes a kernel entry. Shared does not mean they
  343. * are not protected, just that the ASID comparison is not performed.
  344. * -- Dan
  345. *
  346. * The IBM4xx has 256 contexts, so we can just rotate through these
  347. * as a way of "switching" contexts. If the TID of the TLB is zero,
  348. * the PID/TID comparison is disabled, so we can use a TID of zero
  349. * to represent all kernel pages as shared among all contexts.
  350. * -- Dan
  351. *
  352. * The IBM 47x core supports 16-bit PIDs, thus 65535 contexts. We
  353. * should normally never have to steal though the facility is
  354. * present if needed.
  355. * -- BenH
  356. */
  357. if (mmu_has_feature(MMU_FTR_TYPE_8xx)) {
  358. first_context = 0;
  359. last_context = 15;
  360. } else if (mmu_has_feature(MMU_FTR_TYPE_47x)) {
  361. first_context = 1;
  362. last_context = 65535;
  363. } else
  364. #ifdef CONFIG_PPC_BOOK3E_MMU
  365. if (mmu_has_feature(MMU_FTR_TYPE_3E)) {
  366. u32 mmucfg = mfspr(SPRN_MMUCFG);
  367. u32 pid_bits = (mmucfg & MMUCFG_PIDSIZE_MASK)
  368. >> MMUCFG_PIDSIZE_SHIFT;
  369. first_context = 1;
  370. last_context = (1UL << (pid_bits + 1)) - 1;
  371. } else
  372. #endif
  373. {
  374. first_context = 1;
  375. last_context = 255;
  376. }
  377. #ifdef DEBUG_CLAMP_LAST_CONTEXT
  378. last_context = DEBUG_CLAMP_LAST_CONTEXT;
  379. #endif
  380. /*
  381. * Allocate the maps used by context management
  382. */
  383. context_map = alloc_bootmem(CTX_MAP_SIZE);
  384. context_mm = alloc_bootmem(sizeof(void *) * (last_context + 1));
  385. #ifndef CONFIG_SMP
  386. stale_map[0] = alloc_bootmem(CTX_MAP_SIZE);
  387. #else
  388. stale_map[boot_cpuid] = alloc_bootmem(CTX_MAP_SIZE);
  389. register_cpu_notifier(&mmu_context_cpu_nb);
  390. #endif
  391. printk(KERN_INFO
  392. "MMU: Allocated %zu bytes of context maps for %d contexts\n",
  393. 2 * CTX_MAP_SIZE + (sizeof(void *) * (last_context + 1)),
  394. last_context - first_context + 1);
  395. /*
  396. * Some processors have too few contexts to reserve one for
  397. * init_mm, and require using context 0 for a normal task.
  398. * Other processors reserve the use of context zero for the kernel.
  399. * This code assumes first_context < 32.
  400. */
  401. context_map[0] = (1 << first_context) - 1;
  402. next_context = first_context;
  403. nr_free_contexts = last_context - first_context + 1;
  404. }