blob: 0d414c28eb2c8e679d3a39563fb666753e4fcd3d [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * linux/arch/arm/mm/fault-armv.c
3 *
4 * Copyright (C) 1995 Linus Torvalds
5 * Modifications for ARM processor (c) 1995-2002 Russell King
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License version 2 as
9 * published by the Free Software Foundation.
10 */
11#include <linux/module.h>
12#include <linux/sched.h>
13#include <linux/kernel.h>
14#include <linux/mm.h>
15#include <linux/bitops.h>
16#include <linux/vmalloc.h>
17#include <linux/init.h>
18#include <linux/pagemap.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090019#include <linux/gfp.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070020
Russell King09d9bae2008-09-05 14:08:44 +010021#include <asm/bugs.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070022#include <asm/cacheflush.h>
Russell King46097c72008-08-10 18:10:19 +010023#include <asm/cachetype.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070024#include <asm/pgtable.h>
25#include <asm/tlbflush.h>
26
Russell King7b0a1002009-10-24 14:11:59 +010027#include "mm.h"
28
Russell Kingbb30f362008-09-06 20:04:59 +010029static unsigned long shared_pte_mask = L_PTE_MT_BUFFERABLE;
Linus Torvalds1da177e2005-04-16 15:20:36 -070030
31/*
32 * We take the easy way out of this problem - we make the
33 * PTE uncacheable. However, we leave the write buffer on.
Hugh Dickins69b04752005-10-29 18:16:36 -070034 *
35 * Note that the pte lock held when calling update_mmu_cache must also
36 * guard the pte (somewhere else in the same mm) that we modify here.
37 * Therefore those configurations which might call adjust_pte (those
38 * without CONFIG_CPU_CACHE_VIPT) cannot support split page_table_lock.
Linus Torvalds1da177e2005-04-16 15:20:36 -070039 */
Russell Kingc26c20b2009-12-18 16:21:35 +000040static int do_adjust_pte(struct vm_area_struct *vma, unsigned long address,
Russell Kinged42aca2009-12-18 16:31:38 +000041 unsigned long pfn, pte_t *ptep)
Linus Torvalds1da177e2005-04-16 15:20:36 -070042{
Russell Kingc26c20b2009-12-18 16:21:35 +000043 pte_t entry = *ptep;
Russell King53cdb272008-07-27 10:35:54 +010044 int ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -070045
Linus Torvalds1da177e2005-04-16 15:20:36 -070046 /*
Russell King53cdb272008-07-27 10:35:54 +010047 * If this page is present, it's actually being shared.
48 */
49 ret = pte_present(entry);
50
51 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -070052 * If this page isn't present, or is already setup to
53 * fault (ie, is old), we can safely ignore any issues.
54 */
Russell Kingbb30f362008-09-06 20:04:59 +010055 if (ret && (pte_val(entry) & L_PTE_MT_MASK) != shared_pte_mask) {
Nicolas Pitre08e445b2009-01-16 23:02:54 +010056 flush_cache_page(vma, address, pfn);
57 outer_flush_range((pfn << PAGE_SHIFT),
58 (pfn << PAGE_SHIFT) + PAGE_SIZE);
Russell Kingbb30f362008-09-06 20:04:59 +010059 pte_val(entry) &= ~L_PTE_MT_MASK;
60 pte_val(entry) |= shared_pte_mask;
Russell Kingc26c20b2009-12-18 16:21:35 +000061 set_pte_at(vma->vm_mm, address, ptep, entry);
Linus Torvalds1da177e2005-04-16 15:20:36 -070062 flush_tlb_page(vma, address);
Linus Torvalds1da177e2005-04-16 15:20:36 -070063 }
Russell Kingc26c20b2009-12-18 16:21:35 +000064
65 return ret;
66}
67
Russell Kinged42aca2009-12-18 16:31:38 +000068static int adjust_pte(struct vm_area_struct *vma, unsigned long address,
69 unsigned long pfn)
Russell Kingc26c20b2009-12-18 16:21:35 +000070{
Russell King56dd4702009-12-18 16:24:34 +000071 spinlock_t *ptl;
Russell Kingc26c20b2009-12-18 16:21:35 +000072 pgd_t *pgd;
73 pmd_t *pmd;
74 pte_t *pte;
75 int ret;
76
77 pgd = pgd_offset(vma->vm_mm, address);
Russell Kingf8a85f12009-12-18 16:23:44 +000078 if (pgd_none_or_clear_bad(pgd))
79 return 0;
Russell Kingc26c20b2009-12-18 16:21:35 +000080
81 pmd = pmd_offset(pgd, address);
Russell Kingf8a85f12009-12-18 16:23:44 +000082 if (pmd_none_or_clear_bad(pmd))
83 return 0;
Russell Kingc26c20b2009-12-18 16:21:35 +000084
Russell King56dd4702009-12-18 16:24:34 +000085 /*
86 * This is called while another page table is mapped, so we
87 * must use the nested version. This also means we need to
88 * open-code the spin-locking.
89 */
90 ptl = pte_lockptr(vma->vm_mm, pmd);
91 pte = pte_offset_map_nested(pmd, address);
92 spin_lock(ptl);
Russell Kingc26c20b2009-12-18 16:21:35 +000093
Russell Kinged42aca2009-12-18 16:31:38 +000094 ret = do_adjust_pte(vma, address, pfn, pte);
Russell Kingc26c20b2009-12-18 16:21:35 +000095
Russell King56dd4702009-12-18 16:24:34 +000096 spin_unlock(ptl);
97 pte_unmap_nested(pte);
Russell Kingc26c20b2009-12-18 16:21:35 +000098
Linus Torvalds1da177e2005-04-16 15:20:36 -070099 return ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700100}
101
102static void
Russell Kingae140202009-12-18 16:43:57 +0000103make_coherent(struct address_space *mapping, struct vm_area_struct *vma,
104 unsigned long addr, pte_t *ptep, unsigned long pfn)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700106 struct mm_struct *mm = vma->vm_mm;
107 struct vm_area_struct *mpnt;
108 struct prio_tree_iter iter;
109 unsigned long offset;
110 pgoff_t pgoff;
111 int aliases = 0;
112
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113 pgoff = vma->vm_pgoff + ((addr - vma->vm_start) >> PAGE_SHIFT);
114
115 /*
116 * If we have any shared mappings that are in the same mm
117 * space, then we need to handle them specially to maintain
118 * cache coherency.
119 */
120 flush_dcache_mmap_lock(mapping);
121 vma_prio_tree_foreach(mpnt, &iter, &mapping->i_mmap, pgoff, pgoff) {
122 /*
123 * If this VMA is not in our MM, we can ignore it.
124 * Note that we intentionally mask out the VMA
125 * that we are fixing up.
126 */
127 if (mpnt->vm_mm != mm || mpnt == vma)
128 continue;
129 if (!(mpnt->vm_flags & VM_MAYSHARE))
130 continue;
131 offset = (pgoff - mpnt->vm_pgoff) << PAGE_SHIFT;
Russell Kinged42aca2009-12-18 16:31:38 +0000132 aliases += adjust_pte(mpnt, mpnt->vm_start + offset, pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133 }
134 flush_dcache_mmap_unlock(mapping);
135 if (aliases)
Russell Kingae140202009-12-18 16:43:57 +0000136 do_adjust_pte(vma, addr, pfn, ptep);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137 else
Russell King8830f042005-06-20 09:51:03 +0100138 flush_cache_page(vma, addr, pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139}
140
141/*
142 * Take care of architecture specific things when placing a new PTE into
143 * a page table, or changing an existing PTE. Basically, there are two
144 * things that we need to take care of:
145 *
146 * 1. If PG_dcache_dirty is set for the page, we need to ensure
147 * that any cache entries for the kernels virtual memory
148 * range are written back to the page.
149 * 2. If we have multiple shared mappings of the same space in
150 * an object, we need to deal with the cache aliasing issues.
151 *
Hugh Dickins69b04752005-10-29 18:16:36 -0700152 * Note that the pte lock will be held.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153 */
Russell King4b3073e2009-12-18 16:40:18 +0000154void update_mmu_cache(struct vm_area_struct *vma, unsigned long addr,
155 pte_t *ptep)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700156{
Russell King4b3073e2009-12-18 16:40:18 +0000157 unsigned long pfn = pte_pfn(*ptep);
Russell King8830f042005-06-20 09:51:03 +0100158 struct address_space *mapping;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159 struct page *page;
160
161 if (!pfn_valid(pfn))
162 return;
Russell King8830f042005-06-20 09:51:03 +0100163
Russell King421fe932009-10-25 10:23:04 +0000164 /*
165 * The zero page is never written to, so never has any dirty
166 * cache lines, and therefore never needs to be flushed.
167 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700168 page = pfn_to_page(pfn);
Russell King421fe932009-10-25 10:23:04 +0000169 if (page == ZERO_PAGE(0))
170 return;
171
Russell King8830f042005-06-20 09:51:03 +0100172 mapping = page_mapping(page);
Catalin Marinas826cbda2008-06-13 10:28:36 +0100173#ifndef CONFIG_SMP
Nitin Gupta787b2fa2009-10-12 14:20:23 +0530174 if (test_and_clear_bit(PG_dcache_dirty, &page->flags))
175 __flush_dcache_page(mapping, page);
Catalin Marinas826cbda2008-06-13 10:28:36 +0100176#endif
Nitin Gupta787b2fa2009-10-12 14:20:23 +0530177 if (mapping) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178 if (cache_is_vivt())
Russell Kingae140202009-12-18 16:43:57 +0000179 make_coherent(mapping, vma, addr, ptep, pfn);
Catalin Marinas826cbda2008-06-13 10:28:36 +0100180 else if (vma->vm_flags & VM_EXEC)
181 __flush_icache_all();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182 }
183}
184
185/*
186 * Check whether the write buffer has physical address aliasing
187 * issues. If it has, we need to avoid them for the case where
188 * we have several shared mappings of the same object in user
189 * space.
190 */
191static int __init check_writebuffer(unsigned long *p1, unsigned long *p2)
192{
193 register unsigned long zero = 0, one = 1, val;
194
195 local_irq_disable();
196 mb();
197 *p1 = one;
198 mb();
199 *p2 = zero;
200 mb();
201 val = *p1;
202 mb();
203 local_irq_enable();
204 return val != zero;
205}
206
207void __init check_writebuffer_bugs(void)
208{
209 struct page *page;
210 const char *reason;
211 unsigned long v = 1;
212
213 printk(KERN_INFO "CPU: Testing write buffer coherency: ");
214
215 page = alloc_page(GFP_KERNEL);
216 if (page) {
217 unsigned long *p1, *p2;
Russell King52e8bfd2009-12-23 19:54:31 +0000218 pgprot_t prot = __pgprot_modify(PAGE_KERNEL,
219 L_PTE_MT_MASK, L_PTE_MT_BUFFERABLE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700220
221 p1 = vmap(&page, 1, VM_IOREMAP, prot);
222 p2 = vmap(&page, 1, VM_IOREMAP, prot);
223
224 if (p1 && p2) {
225 v = check_writebuffer(p1, p2);
226 reason = "enabling work-around";
227 } else {
228 reason = "unable to map memory\n";
229 }
230
231 vunmap(p1);
232 vunmap(p2);
233 put_page(page);
234 } else {
235 reason = "unable to grab page\n";
236 }
237
238 if (v) {
239 printk("failed, %s\n", reason);
Russell Kingbb30f362008-09-06 20:04:59 +0100240 shared_pte_mask = L_PTE_MT_UNCACHED;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241 } else {
242 printk("ok\n");
243 }
244}