2 * MMU context allocation for 64-bit kernels.
4 * Copyright (C) 2004 Anton Blanchard, IBM Corp. <anton@samba.org>
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
13 #include <linux/sched.h>
14 #include <linux/kernel.h>
15 #include <linux/errno.h>
16 #include <linux/string.h>
17 #include <linux/types.h>
19 #include <linux/pkeys.h>
20 #include <linux/spinlock.h>
21 #include <linux/idr.h>
22 #include <linux/export.h>
23 #include <linux/gfp.h>
24 #include <linux/slab.h>
26 #include <asm/mmu_context.h>
27 #include <asm/pgalloc.h>
29 static DEFINE_SPINLOCK(mmu_context_lock);
30 static DEFINE_IDA(mmu_context_ida);
32 static int alloc_context_id(int min_id, int max_id)
37 if (!ida_pre_get(&mmu_context_ida, GFP_KERNEL))
40 spin_lock(&mmu_context_lock);
41 err = ida_get_new_above(&mmu_context_ida, min_id, &index);
42 spin_unlock(&mmu_context_lock);
50 spin_lock(&mmu_context_lock);
51 ida_remove(&mmu_context_ida, index);
52 spin_unlock(&mmu_context_lock);
59 void hash__reserve_context_id(int id)
64 if (!ida_pre_get(&mmu_context_ida, GFP_KERNEL))
67 spin_lock(&mmu_context_lock);
68 rc = ida_get_new_above(&mmu_context_ida, id, &result);
69 spin_unlock(&mmu_context_lock);
70 } while (rc == -EAGAIN);
72 WARN(result != id, "mmu: Failed to reserve context id %d (rc %d)\n", id, result);
75 int hash__alloc_context_id(void)
79 if (mmu_has_feature(MMU_FTR_68_BIT_VA))
80 max = MAX_USER_CONTEXT;
82 max = MAX_USER_CONTEXT_65BIT_VA;
84 return alloc_context_id(MIN_USER_CONTEXT, max);
86 EXPORT_SYMBOL_GPL(hash__alloc_context_id);
88 static int hash__init_new_context(struct mm_struct *mm)
92 index = hash__alloc_context_id();
97 * The old code would re-promote on fork, we don't do that when using
98 * slices as it could cause problem promoting slices that have been
101 * For book3s we have MMU_NO_CONTEXT set to be ~0. Hence check
102 * explicitly against context.id == 0. This ensures that we properly
103 * initialize context slice details for newly allocated mm's (which will
104 * have id == 0) and don't alter context slice inherited via fork (which
105 * will have id != 0).
107 * We should not be calling init_new_context() on init_mm. Hence a
108 * check against 0 is OK.
110 if (mm->context.id == 0)
111 slice_init_new_context_exec(mm);
113 subpage_prot_init_new_context(mm);
119 static int radix__init_new_context(struct mm_struct *mm)
121 unsigned long rts_field;
124 max_id = (1 << mmu_pid_bits) - 1;
125 index = alloc_context_id(mmu_base_pid, max_id);
130 * set the process table entry,
132 rts_field = radix__get_tree_size();
133 process_tb[index].prtb0 = cpu_to_be64(rts_field | __pa(mm->pgd) | RADIX_PGD_INDEX_SIZE);
136 * Order the above store with subsequent update of the PID
137 * register (at which point HW can start loading/caching
138 * the entry) and the corresponding load by the MMU from
141 asm volatile("ptesync;isync" : : : "memory");
143 mm->context.npu_context = NULL;
148 int init_new_context(struct task_struct *tsk, struct mm_struct *mm)
153 index = radix__init_new_context(mm);
155 index = hash__init_new_context(mm);
160 mm->context.id = index;
162 #ifdef CONFIG_PPC_64K_PAGES
163 mm->context.pte_frag = NULL;
165 #ifdef CONFIG_SPAPR_TCE_IOMMU
168 atomic_set(&mm->context.active_cpus, 0);
169 atomic_set(&mm->context.copros, 0);
174 void __destroy_context(int context_id)
176 spin_lock(&mmu_context_lock);
177 ida_remove(&mmu_context_ida, context_id);
178 spin_unlock(&mmu_context_lock);
180 EXPORT_SYMBOL_GPL(__destroy_context);
182 static void destroy_contexts(mm_context_t *ctx)
184 int index, context_id;
186 spin_lock(&mmu_context_lock);
187 for (index = 0; index < ARRAY_SIZE(ctx->extended_id); index++) {
188 context_id = ctx->extended_id[index];
190 ida_remove(&mmu_context_ida, context_id);
192 spin_unlock(&mmu_context_lock);
195 #ifdef CONFIG_PPC_64K_PAGES
196 static void destroy_pagetable_page(struct mm_struct *mm)
202 pte_frag = mm->context.pte_frag;
206 page = virt_to_page(pte_frag);
207 /* drop all the pending references */
208 count = ((unsigned long)pte_frag & ~PAGE_MASK) >> PTE_FRAG_SIZE_SHIFT;
209 /* We allow PTE_FRAG_NR fragments from a PTE page */
210 if (page_ref_sub_and_test(page, PTE_FRAG_NR - count)) {
211 pgtable_page_dtor(page);
212 free_unref_page(page);
217 static inline void destroy_pagetable_page(struct mm_struct *mm)
223 void destroy_context(struct mm_struct *mm)
225 #ifdef CONFIG_SPAPR_TCE_IOMMU
226 WARN_ON_ONCE(!list_empty(&mm->context.iommu_group_mem_list));
229 WARN_ON(process_tb[mm->context.id].prtb0 != 0);
231 subpage_prot_free(mm);
232 destroy_pagetable_page(mm);
233 destroy_contexts(&mm->context);
234 mm->context.id = MMU_NO_CONTEXT;
237 void arch_exit_mmap(struct mm_struct *mm)
239 if (radix_enabled()) {
241 * Radix doesn't have a valid bit in the process table
242 * entries. However we know that at least P9 implementation
243 * will avoid caching an entry with an invalid RTS field,
244 * and 0 is invalid. So this will do.
246 * This runs before the "fullmm" tlb flush in exit_mmap,
247 * which does a RIC=2 tlbie to clear the process table
248 * entry. See the "fullmm" comments in tlb-radix.c.
250 * No barrier required here after the store because
251 * this process will do the invalidate, which starts with
254 process_tb[mm->context.id].prtb0 = 0;
258 #ifdef CONFIG_PPC_RADIX_MMU
259 void radix__switch_mmu_context(struct mm_struct *prev, struct mm_struct *next)
262 if (cpu_has_feature(CPU_FTR_POWER9_DD1)) {
264 mtspr(SPRN_PID, next->context.id);
266 asm volatile(PPC_INVALIDATE_ERAT : : :"memory");
268 mtspr(SPRN_PID, next->context.id);