2 * Lockless get_user_pages_fast for SuperH
4 * Copyright (C) 2009 - 2010 Paul Mundt
6 * Cloned from the x86 and PowerPC versions, by:
8 * Copyright (C) 2008 Nick Piggin
9 * Copyright (C) 2008 Novell Inc.
11 #include <linux/sched.h>
13 #include <linux/vmstat.h>
14 #include <linux/highmem.h>
15 #include <asm/pgtable.h>
17 static inline pte_t gup_get_pte(pte_t *ptep)
20 return READ_ONCE(*ptep);
23 * With get_user_pages_fast, we walk down the pagetables without
24 * taking any locks. For this we would like to load the pointers
25 * atomically, but that is not possible with 64-bit PTEs. What
26 * we do have is the guarantee that a pte will only either go
27 * from not present to present, or present to not present or both
28 * -- it will not switch to a completely different present page
29 * without a TLB flush in between; something that we are blocking
30 * by holding interrupts off.
32 * Setting ptes from not present to present goes:
37 * And present to not present goes:
42 * We must ensure here that the load of pte_low sees l iff pte_high
43 * sees h. We load pte_high *after* loading pte_low, which ensures we
44 * don't see an older value of pte_high. *Then* we recheck pte_low,
45 * which ensures that we haven't picked up a changed pte high. We might
46 * have got rubbish values from pte_low and pte_high, but we are
47 * guaranteed that pte_low will not have the present bit set *unless*
48 * it is 'l'. And get_user_pages_fast only operates on present ptes, so
51 * gup_get_pte should not be used or copied outside gup.c without being
52 * very careful -- it does not atomically load the pte or anything that
53 * is likely to be useful for you.
58 pte.pte_low = ptep->pte_low;
60 pte.pte_high = ptep->pte_high;
62 if (unlikely(pte.pte_low != ptep->pte_low))
70 * The performance critical leaf functions are made noinline otherwise gcc
71 * inlines everything into a single function which results in too much
74 static noinline int gup_pte_range(pmd_t pmd, unsigned long addr,
75 unsigned long end, int write, struct page **pages, int *nr)
81 result = _PAGE_PRESENT | _PAGE_EXT(_PAGE_EXT_KERN_READ | _PAGE_EXT_USER_READ);
83 result |= _PAGE_EXT(_PAGE_EXT_KERN_WRITE | _PAGE_EXT_USER_WRITE);
84 #elif defined(CONFIG_SUPERH64)
85 result = _PAGE_PRESENT | _PAGE_USER | _PAGE_READ;
87 result |= _PAGE_WRITE;
89 result = _PAGE_PRESENT | _PAGE_USER;
94 mask = result | _PAGE_SPECIAL;
96 ptep = pte_offset_map(&pmd, addr);
98 pte_t pte = gup_get_pte(ptep);
101 if ((pte_val(pte) & mask) != result) {
105 VM_BUG_ON(!pfn_valid(pte_pfn(pte)));
106 page = pte_page(pte);
108 __flush_anon_page(page, addr);
109 flush_dcache_page(page);
113 } while (ptep++, addr += PAGE_SIZE, addr != end);
119 static int gup_pmd_range(pud_t pud, unsigned long addr, unsigned long end,
120 int write, struct page **pages, int *nr)
125 pmdp = pmd_offset(&pud, addr);
129 next = pmd_addr_end(addr, end);
132 if (!gup_pte_range(pmd, addr, next, write, pages, nr))
134 } while (pmdp++, addr = next, addr != end);
139 static int gup_pud_range(pgd_t pgd, unsigned long addr, unsigned long end,
140 int write, struct page **pages, int *nr)
145 pudp = pud_offset(&pgd, addr);
149 next = pud_addr_end(addr, end);
152 if (!gup_pmd_range(pud, addr, next, write, pages, nr))
154 } while (pudp++, addr = next, addr != end);
160 * Like get_user_pages_fast() except its IRQ-safe in that it won't fall
161 * back to the regular GUP.
163 int __get_user_pages_fast(unsigned long start, int nr_pages, int write,
166 struct mm_struct *mm = current->mm;
167 unsigned long addr, len, end;
175 len = (unsigned long) nr_pages << PAGE_SHIFT;
177 if (unlikely(!access_ok(write ? VERIFY_WRITE : VERIFY_READ,
178 (void __user *)start, len)))
182 * This doesn't prevent pagetable teardown, but does prevent
183 * the pagetables and pages from being freed.
185 local_irq_save(flags);
186 pgdp = pgd_offset(mm, addr);
190 next = pgd_addr_end(addr, end);
193 if (!gup_pud_range(pgd, addr, next, write, pages, &nr))
195 } while (pgdp++, addr = next, addr != end);
196 local_irq_restore(flags);
202 * get_user_pages_fast() - pin user pages in memory
203 * @start: starting user address
204 * @nr_pages: number of pages from start to pin
205 * @write: whether pages will be written to
206 * @pages: array that receives pointers to the pages pinned.
207 * Should be at least nr_pages long.
209 * Attempt to pin user pages in memory without taking mm->mmap_sem.
210 * If not successful, it will fall back to taking the lock and
211 * calling get_user_pages().
213 * Returns number of pages pinned. This may be fewer than the number
214 * requested. If nr_pages is 0 or negative, returns 0. If no pages
215 * were pinned, returns -errno.
217 int get_user_pages_fast(unsigned long start, int nr_pages, int write,
220 struct mm_struct *mm = current->mm;
221 unsigned long addr, len, end;
228 len = (unsigned long) nr_pages << PAGE_SHIFT;
235 pgdp = pgd_offset(mm, addr);
239 next = pgd_addr_end(addr, end);
242 if (!gup_pud_range(pgd, addr, next, write, pages, &nr))
244 } while (pgdp++, addr = next, addr != end);
247 VM_BUG_ON(nr != (end - start) >> PAGE_SHIFT);
256 /* Try to get the remaining pages with get_user_pages */
257 start += nr << PAGE_SHIFT;
260 ret = get_user_pages_unlocked(current, mm, start,
261 (end - start) >> PAGE_SHIFT, write, 0, pages);
263 /* Have to be a bit careful with return values */