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...
6 * Copyright 2008 Ben Herrenschmidt <benh@kernel.crashing.org>
9 * Derived from previous arch/powerpc/mm/mmu_context.c
10 * and arch/powerpc/include/asm/mmu_context.h
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.
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
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
28 //#define DEBUG_MAP_CONSISTENCY
29 //#define DEBUG_CLAMP_LAST_CONTEXT 31
30 //#define DEBUG_HARDER
32 /* We don't use DEBUG because it tends to be compiled in always nowadays
33 * and this would generate way too much output
36 #define pr_hard(args...) printk(KERN_DEBUG args)
37 #define pr_hardcont(args...) printk(KERN_CONT args)
39 #define pr_hard(args...) do { } while(0)
40 #define pr_hardcont(args...) do { } while(0)
43 #include <linux/kernel.h>
45 #include <linux/init.h>
46 #include <linux/spinlock.h>
47 #include <linux/bootmem.h>
48 #include <linux/notifier.h>
49 #include <linux/cpu.h>
50 #include <linux/slab.h>
52 #include <asm/mmu_context.h>
53 #include <asm/tlbflush.h>
57 static unsigned int first_context
, last_context
;
58 static unsigned int next_context
, nr_free_contexts
;
59 static unsigned long *context_map
;
60 static unsigned long *stale_map
[NR_CPUS
];
61 static struct mm_struct
**context_mm
;
62 static DEFINE_RAW_SPINLOCK(context_lock
);
63 static bool no_selective_tlbil
;
65 #define CTX_MAP_SIZE \
66 (sizeof(unsigned long) * (last_context / BITS_PER_LONG + 1))
69 /* Steal a context from a task that has one at the moment.
71 * This is used when we are running out of available PID numbers
74 * This isn't an LRU system, it just frees up each context in
75 * turn (sort-of pseudo-random replacement :). This would be the
76 * place to implement an LRU scheme if anyone was motivated to do it.
79 * For context stealing, we use a slightly different approach for
80 * SMP and UP. Basically, the UP one is simpler and doesn't use
81 * the stale map as we can just flush the local CPU
85 static unsigned int steal_context_smp(unsigned int id
)
88 unsigned int cpu
, max
, i
;
90 max
= last_context
- first_context
;
92 /* Attempt to free next_context first and then loop until we manage */
94 /* Pick up the victim mm */
97 /* We have a candidate victim, check if it's active, on SMP
98 * we cannot steal active contexts
100 if (mm
->context
.active
) {
102 if (id
> last_context
)
106 pr_hardcont(" | steal %d from 0x%p", id
, mm
);
108 /* Mark this mm has having no context anymore */
109 mm
->context
.id
= MMU_NO_CONTEXT
;
111 /* Mark it stale on all CPUs that used this mm. For threaded
112 * implementations, we set it on all threads on each core
113 * represented in the mask. A future implementation will use
114 * a core map instead but this will do for now.
116 for_each_cpu(cpu
, mm_cpumask(mm
)) {
117 for (i
= cpu_first_thread_sibling(cpu
);
118 i
<= cpu_last_thread_sibling(cpu
); i
++) {
120 __set_bit(id
, stale_map
[i
]);
127 /* This will happen if you have more CPUs than available contexts,
128 * all we can do here is wait a bit and try again
130 raw_spin_unlock(&context_lock
);
132 raw_spin_lock(&context_lock
);
134 /* This will cause the caller to try again */
135 return MMU_NO_CONTEXT
;
137 #endif /* CONFIG_SMP */
139 static unsigned int steal_all_contexts(void)
141 struct mm_struct
*mm
;
142 int cpu
= smp_processor_id();
145 for (id
= first_context
; id
<= last_context
; id
++) {
146 /* Pick up the victim mm */
149 pr_hardcont(" | steal %d from 0x%p", id
, mm
);
151 /* Mark this mm as having no context anymore */
152 mm
->context
.id
= MMU_NO_CONTEXT
;
153 if (id
!= first_context
) {
154 context_mm
[id
] = NULL
;
155 __clear_bit(id
, context_map
);
156 #ifdef DEBUG_MAP_CONSISTENCY
157 mm
->context
.active
= 0;
160 __clear_bit(id
, stale_map
[cpu
]);
163 /* Flush the TLB for all contexts (not to be used on SMP) */
166 nr_free_contexts
= last_context
- first_context
;
168 return first_context
;
171 /* Note that this will also be called on SMP if all other CPUs are
172 * offlined, which means that it may be called for cpu != 0. For
173 * this to work, we somewhat assume that CPUs that are onlined
174 * come up with a fully clean TLB (or are cleaned when offlined)
176 static unsigned int steal_context_up(unsigned int id
)
178 struct mm_struct
*mm
;
179 int cpu
= smp_processor_id();
181 /* Pick up the victim mm */
184 pr_hardcont(" | steal %d from 0x%p", id
, mm
);
186 /* Flush the TLB for that context */
187 local_flush_tlb_mm(mm
);
189 /* Mark this mm has having no context anymore */
190 mm
->context
.id
= MMU_NO_CONTEXT
;
192 /* XXX This clear should ultimately be part of local_flush_tlb_mm */
193 __clear_bit(id
, stale_map
[cpu
]);
198 #ifdef DEBUG_MAP_CONSISTENCY
199 static void context_check_map(void)
201 unsigned int id
, nrf
, nact
;
204 for (id
= first_context
; id
<= last_context
; id
++) {
205 int used
= test_bit(id
, context_map
);
208 if (used
!= (context_mm
[id
] != NULL
))
209 pr_err("MMU: Context %d is %s and MM is %p !\n",
210 id
, used
? "used" : "free", context_mm
[id
]);
211 if (context_mm
[id
] != NULL
)
212 nact
+= context_mm
[id
]->context
.active
;
214 if (nrf
!= nr_free_contexts
) {
215 pr_err("MMU: Free context count out of sync ! (%d vs %d)\n",
216 nr_free_contexts
, nrf
);
217 nr_free_contexts
= nrf
;
219 if (nact
> num_online_cpus())
220 pr_err("MMU: More active contexts than CPUs ! (%d vs %d)\n",
221 nact
, num_online_cpus());
222 if (first_context
> 0 && !test_bit(0, context_map
))
223 pr_err("MMU: Context 0 has been freed !!!\n");
226 static void context_check_map(void) { }
229 void switch_mmu_context(struct mm_struct
*prev
, struct mm_struct
*next
,
230 struct task_struct
*tsk
)
232 unsigned int i
, id
, cpu
= smp_processor_id();
235 /* No lockless fast path .. yet */
236 raw_spin_lock(&context_lock
);
238 pr_hard("[%d] activating context for mm @%p, active=%d, id=%d",
239 cpu
, next
, next
->context
.active
, next
->context
.id
);
242 /* Mark us active and the previous one not anymore */
243 next
->context
.active
++;
245 pr_hardcont(" (old=0x%p a=%d)", prev
, prev
->context
.active
);
246 WARN_ON(prev
->context
.active
< 1);
247 prev
->context
.active
--;
251 #endif /* CONFIG_SMP */
253 /* If we already have a valid assigned context, skip all that */
254 id
= next
->context
.id
;
255 if (likely(id
!= MMU_NO_CONTEXT
)) {
256 #ifdef DEBUG_MAP_CONSISTENCY
257 if (context_mm
[id
] != next
)
258 pr_err("MMU: mm 0x%p has id %d but context_mm[%d] says 0x%p\n",
259 next
, id
, id
, context_mm
[id
]);
264 /* We really don't have a context, let's try to acquire one */
266 if (id
> last_context
)
270 /* No more free contexts, let's try to steal one */
271 if (nr_free_contexts
== 0) {
273 if (num_online_cpus() > 1) {
274 id
= steal_context_smp(id
);
275 if (id
== MMU_NO_CONTEXT
)
279 #endif /* CONFIG_SMP */
280 if (no_selective_tlbil
)
281 id
= steal_all_contexts();
283 id
= steal_context_up(id
);
288 /* We know there's at least one free context, try to find it */
289 while (__test_and_set_bit(id
, map
)) {
290 id
= find_next_zero_bit(map
, last_context
+1, id
);
291 if (id
> last_context
)
295 next_context
= id
+ 1;
296 context_mm
[id
] = next
;
297 next
->context
.id
= id
;
298 pr_hardcont(" | new id=%d,nrf=%d", id
, nr_free_contexts
);
303 /* If that context got marked stale on this CPU, then flush the
304 * local TLB for it and unmark it before we use it
306 if (test_bit(id
, stale_map
[cpu
])) {
307 pr_hardcont(" | stale flush %d [%d..%d]",
308 id
, cpu_first_thread_sibling(cpu
),
309 cpu_last_thread_sibling(cpu
));
311 local_flush_tlb_mm(next
);
313 /* XXX This clear should ultimately be part of local_flush_tlb_mm */
314 for (i
= cpu_first_thread_sibling(cpu
);
315 i
<= cpu_last_thread_sibling(cpu
); i
++) {
317 __clear_bit(id
, stale_map
[i
]);
321 /* Flick the MMU and release lock */
322 pr_hardcont(" -> %d\n", id
);
323 set_context(id
, next
->pgd
);
324 raw_spin_unlock(&context_lock
);
328 * Set up the context for a new address space.
330 int init_new_context(struct task_struct
*t
, struct mm_struct
*mm
)
332 pr_hard("initing context for mm @%p\n", mm
);
334 mm
->context
.id
= MMU_NO_CONTEXT
;
335 mm
->context
.active
= 0;
340 * We're finished using the context for an address space.
342 void destroy_context(struct mm_struct
*mm
)
347 if (mm
->context
.id
== MMU_NO_CONTEXT
)
350 WARN_ON(mm
->context
.active
!= 0);
352 raw_spin_lock_irqsave(&context_lock
, flags
);
354 if (id
!= MMU_NO_CONTEXT
) {
355 __clear_bit(id
, context_map
);
356 mm
->context
.id
= MMU_NO_CONTEXT
;
357 #ifdef DEBUG_MAP_CONSISTENCY
358 mm
->context
.active
= 0;
360 context_mm
[id
] = NULL
;
363 raw_spin_unlock_irqrestore(&context_lock
, flags
);
367 static int mmu_ctx_cpu_prepare(unsigned int cpu
)
369 /* We don't touch CPU 0 map, it's allocated at aboot and kept
372 if (cpu
== boot_cpuid
)
375 pr_devel("MMU: Allocating stale context map for CPU %d\n", cpu
);
376 stale_map
[cpu
] = kzalloc(CTX_MAP_SIZE
, GFP_KERNEL
);
380 static int mmu_ctx_cpu_dead(unsigned int cpu
)
382 #ifdef CONFIG_HOTPLUG_CPU
383 if (cpu
== boot_cpuid
)
386 pr_devel("MMU: Freeing stale context map for CPU %d\n", cpu
);
387 kfree(stale_map
[cpu
]);
388 stale_map
[cpu
] = NULL
;
390 /* We also clear the cpu_vm_mask bits of CPUs going away */
391 clear_tasks_mm_cpumask(cpu
);
396 #endif /* CONFIG_SMP */
399 * Initialize the context management stuff.
401 void __init
mmu_context_init(void)
403 /* Mark init_mm as being active on all possible CPUs since
404 * we'll get called with prev == init_mm the first time
405 * we schedule on a given CPU
407 init_mm
.context
.active
= NR_CPUS
;
410 * The MPC8xx has only 16 contexts. We rotate through them on each
411 * task switch. A better way would be to keep track of tasks that
412 * own contexts, and implement an LRU usage. That way very active
413 * tasks don't always have to pay the TLB reload overhead. The
414 * kernel pages are mapped shared, so the kernel can run on behalf
415 * of any task that makes a kernel entry. Shared does not mean they
416 * are not protected, just that the ASID comparison is not performed.
419 * The IBM4xx has 256 contexts, so we can just rotate through these
420 * as a way of "switching" contexts. If the TID of the TLB is zero,
421 * the PID/TID comparison is disabled, so we can use a TID of zero
422 * to represent all kernel pages as shared among all contexts.
425 * The IBM 47x core supports 16-bit PIDs, thus 65535 contexts. We
426 * should normally never have to steal though the facility is
430 if (mmu_has_feature(MMU_FTR_TYPE_8xx
)) {
433 no_selective_tlbil
= true;
434 } else if (mmu_has_feature(MMU_FTR_TYPE_47x
)) {
436 last_context
= 65535;
437 no_selective_tlbil
= false;
441 no_selective_tlbil
= false;
444 #ifdef DEBUG_CLAMP_LAST_CONTEXT
445 last_context
= DEBUG_CLAMP_LAST_CONTEXT
;
448 * Allocate the maps used by context management
450 context_map
= memblock_virt_alloc(CTX_MAP_SIZE
, 0);
451 context_mm
= memblock_virt_alloc(sizeof(void *) * (last_context
+ 1), 0);
453 stale_map
[0] = memblock_virt_alloc(CTX_MAP_SIZE
, 0);
455 stale_map
[boot_cpuid
] = memblock_virt_alloc(CTX_MAP_SIZE
, 0);
457 cpuhp_setup_state_nocalls(CPUHP_POWERPC_MMU_CTX_PREPARE
,
458 "powerpc/mmu/ctx:prepare",
459 mmu_ctx_cpu_prepare
, mmu_ctx_cpu_dead
);
463 "MMU: Allocated %zu bytes of context maps for %d contexts\n",
464 2 * CTX_MAP_SIZE
+ (sizeof(void *) * (last_context
+ 1)),
465 last_context
- first_context
+ 1);
468 * Some processors have too few contexts to reserve one for
469 * init_mm, and require using context 0 for a normal task.
470 * Other processors reserve the use of context zero for the kernel.
471 * This code assumes first_context < 32.
473 context_map
[0] = (1 << first_context
) - 1;
474 next_context
= first_context
;
475 nr_free_contexts
= last_context
- first_context
+ 1;