2 * linux/arch/arm/lib/uaccess_with_memcpy.c
4 * Written by: Lennert Buytenhek and Nicolas Pitre
5 * Copyright (C) 2009 Marvell Semiconductor
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.
12 #include <linux/kernel.h>
13 #include <linux/ctype.h>
14 #include <linux/uaccess.h>
15 #include <linux/rwsem.h>
17 #include <linux/sched.h>
18 #include <linux/hardirq.h> /* for in_atomic() */
19 #include <linux/gfp.h>
20 #include <linux/highmem.h>
21 #include <linux/hugetlb.h>
22 #include <asm/current.h>
26 pin_page_for_write(const void __user
*_addr
, pte_t
**ptep
, spinlock_t
**ptlp
)
28 unsigned long addr
= (unsigned long)_addr
;
35 pgd
= pgd_offset(current
->mm
, addr
);
36 if (unlikely(pgd_none(*pgd
) || pgd_bad(*pgd
)))
39 pud
= pud_offset(pgd
, addr
);
40 if (unlikely(pud_none(*pud
) || pud_bad(*pud
)))
43 pmd
= pmd_offset(pud
, addr
);
44 if (unlikely(pmd_none(*pmd
)))
48 * A pmd can be bad if it refers to a HugeTLB or THP page.
50 * Both THP and HugeTLB pages have the same pmd layout
51 * and should not be manipulated by the pte functions.
53 * Lock the page table for the destination and check
54 * to see that it's still huge and whether or not we will
55 * need to fault on write.
57 if (unlikely(pmd_thp_or_huge(*pmd
))) {
58 ptl
= ¤t
->mm
->page_table_lock
;
60 if (unlikely(!pmd_thp_or_huge(*pmd
)
61 || pmd_hugewillfault(*pmd
))) {
71 if (unlikely(pmd_bad(*pmd
)))
74 pte
= pte_offset_map_lock(current
->mm
, pmd
, addr
, &ptl
);
75 if (unlikely(!pte_present(*pte
) || !pte_young(*pte
) ||
76 !pte_write(*pte
) || !pte_dirty(*pte
))) {
77 pte_unmap_unlock(pte
, ptl
);
87 static unsigned long noinline
88 __copy_to_user_memcpy(void __user
*to
, const void *from
, unsigned long n
)
90 unsigned long ua_flags
;
93 if (uaccess_kernel()) {
94 memcpy((void *)to
, from
, n
);
98 /* the mmap semaphore is taken only if not in an atomic context */
99 atomic
= faulthandler_disabled();
102 down_read(¤t
->mm
->mmap_sem
);
108 while (!pin_page_for_write(to
, &pte
, &ptl
)) {
110 up_read(¤t
->mm
->mmap_sem
);
111 if (__put_user(0, (char __user
*)to
))
114 down_read(¤t
->mm
->mmap_sem
);
117 tocopy
= (~(unsigned long)to
& ~PAGE_MASK
) + 1;
121 ua_flags
= uaccess_save_and_enable();
122 memcpy((void *)to
, from
, tocopy
);
123 uaccess_restore(ua_flags
);
129 pte_unmap_unlock(pte
, ptl
);
134 up_read(¤t
->mm
->mmap_sem
);
141 arm_copy_to_user(void __user
*to
, const void *from
, unsigned long n
)
144 * This test is stubbed out of the main function above to keep
145 * the overhead for small copies low by avoiding a large
146 * register dump on the stack just to reload them right away.
147 * With frame pointer disabled, tail call optimization kicks in
148 * as well making this test almost invisible.
151 unsigned long ua_flags
= uaccess_save_and_enable();
152 n
= __copy_to_user_std(to
, from
, n
);
153 uaccess_restore(ua_flags
);
155 n
= __copy_to_user_memcpy(uaccess_mask_range_ptr(to
, n
),
161 static unsigned long noinline
162 __clear_user_memset(void __user
*addr
, unsigned long n
)
164 unsigned long ua_flags
;
166 if (uaccess_kernel()) {
167 memset((void *)addr
, 0, n
);
171 down_read(¤t
->mm
->mmap_sem
);
177 while (!pin_page_for_write(addr
, &pte
, &ptl
)) {
178 up_read(¤t
->mm
->mmap_sem
);
179 if (__put_user(0, (char __user
*)addr
))
181 down_read(¤t
->mm
->mmap_sem
);
184 tocopy
= (~(unsigned long)addr
& ~PAGE_MASK
) + 1;
188 ua_flags
= uaccess_save_and_enable();
189 memset((void *)addr
, 0, tocopy
);
190 uaccess_restore(ua_flags
);
195 pte_unmap_unlock(pte
, ptl
);
199 up_read(¤t
->mm
->mmap_sem
);
205 unsigned long arm_clear_user(void __user
*addr
, unsigned long n
)
207 /* See rational for this in __copy_to_user() above. */
209 unsigned long ua_flags
= uaccess_save_and_enable();
210 n
= __clear_user_std(addr
, n
);
211 uaccess_restore(ua_flags
);
213 n
= __clear_user_memset(addr
, n
);
221 * This code is disabled by default, but kept around in case the chosen
222 * thresholds need to be revalidated. Some overhead (small but still)
223 * would be implied by a runtime determined variable threshold, and
224 * so far the measurement on concerned targets didn't show a worthwhile
227 * Note that a fairly precise sched_clock() implementation is needed
228 * for results to make some sense.
231 #include <linux/vmalloc.h>
233 static int __init
test_size_treshold(void)
235 struct page
*src_page
, *dst_page
;
236 void *user_ptr
, *kernel_ptr
;
237 unsigned long long t0
, t1
, t2
;
241 src_page
= alloc_page(GFP_KERNEL
);
244 dst_page
= alloc_page(GFP_KERNEL
);
247 kernel_ptr
= page_address(src_page
);
248 user_ptr
= vmap(&dst_page
, 1, VM_IOREMAP
, __pgprot(__P010
));
252 /* warm up the src page dcache */
253 ret
= __copy_to_user_memcpy(user_ptr
, kernel_ptr
, PAGE_SIZE
);
255 for (size
= PAGE_SIZE
; size
>= 4; size
/= 2) {
257 ret
|= __copy_to_user_memcpy(user_ptr
, kernel_ptr
, size
);
259 ret
|= __copy_to_user_std(user_ptr
, kernel_ptr
, size
);
261 printk("copy_to_user: %d %llu %llu\n", size
, t1
- t0
, t2
- t1
);
264 for (size
= PAGE_SIZE
; size
>= 4; size
/= 2) {
266 ret
|= __clear_user_memset(user_ptr
, size
);
268 ret
|= __clear_user_std(user_ptr
, size
);
270 printk("clear_user: %d %llu %llu\n", size
, t1
- t0
, t2
- t1
);
285 subsys_initcall(test_size_treshold
);