Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 | /* SPDX-License-Identifier: GPL-2.0 */ #ifndef _ASM_UACCESS_H #define _ASM_UACCESS_H /* * User space memory access functions */ #include <linux/compiler.h> #include <linux/string.h> #include <linux/mm_types.h> #include <asm/asi.h> #include <asm/spitfire.h> #include <asm/pgtable.h> #include <asm/processor.h> #include <asm-generic/access_ok.h> /* * Sparc64 is segmented, though more like the M68K than the I386. * We use the secondary ASI to address user memory, which references a * completely different VM map, thus there is zero chance of the user * doing something queer and tricking us into poking kernel memory. */ /* * Test whether a block of memory is a valid user space address. * Returns 0 if the range is valid, nonzero otherwise. */ static inline bool __chk_range_not_ok(unsigned long addr, unsigned long size, unsigned long limit) { if (__builtin_constant_p(size)) return addr > limit - size; addr += size; if (addr < size) return true; return addr > limit; } #define __range_not_ok(addr, size, limit) \ ({ \ __chk_user_ptr(addr); \ __chk_range_not_ok((unsigned long __force)(addr), size, limit); \ }) void __retl_efault(void); /* Uh, these should become the main single-value transfer routines.. * They automatically use the right size if we just have the right * pointer type.. * * This gets kind of ugly. We want to return _two_ values in "get_user()" * and yet we don't want to do any pointers, because that is too much * of a performance impact. Thus we have a few rather ugly macros here, * and hide all the ugliness from the user. */ #define put_user(x, ptr) ({ \ unsigned long __pu_addr = (unsigned long)(ptr); \ __chk_user_ptr(ptr); \ __put_user_nocheck((__typeof__(*(ptr)))(x), __pu_addr, sizeof(*(ptr)));\ }) #define get_user(x, ptr) ({ \ unsigned long __gu_addr = (unsigned long)(ptr); \ __chk_user_ptr(ptr); \ __get_user_nocheck((x), __gu_addr, sizeof(*(ptr)), __typeof__(*(ptr)));\ }) #define __put_user(x, ptr) put_user(x, ptr) #define __get_user(x, ptr) get_user(x, ptr) struct __large_struct { unsigned long buf[100]; }; #define __m(x) ((struct __large_struct *)(x)) #define __put_kernel_nofault(dst, src, type, label) \ do { \ type *addr = (type __force *)(dst); \ type data = *(type *)src; \ register int __pu_ret; \ switch (sizeof(type)) { \ case 1: __put_kernel_asm(data, b, addr, __pu_ret); break; \ case 2: __put_kernel_asm(data, h, addr, __pu_ret); break; \ case 4: __put_kernel_asm(data, w, addr, __pu_ret); break; \ case 8: __put_kernel_asm(data, x, addr, __pu_ret); break; \ default: __pu_ret = __put_user_bad(); break; \ } \ if (__pu_ret) \ goto label; \ } while (0) #define __put_kernel_asm(x, size, addr, ret) \ __asm__ __volatile__( \ "/* Put kernel asm, inline. */\n" \ "1:\t" "st"#size " %1, [%2]\n\t" \ "clr %0\n" \ "2:\n\n\t" \ ".section .fixup,#alloc,#execinstr\n\t" \ ".align 4\n" \ "3:\n\t" \ "sethi %%hi(2b), %0\n\t" \ "jmpl %0 + %%lo(2b), %%g0\n\t" \ " mov %3, %0\n\n\t" \ ".previous\n\t" \ ".section __ex_table,\"a\"\n\t" \ ".align 4\n\t" \ ".word 1b, 3b\n\t" \ ".previous\n\n\t" \ : "=r" (ret) : "r" (x), "r" (__m(addr)), \ "i" (-EFAULT)) #define __put_user_nocheck(data, addr, size) ({ \ register int __pu_ret; \ switch (size) { \ case 1: __put_user_asm(data, b, addr, __pu_ret); break; \ case 2: __put_user_asm(data, h, addr, __pu_ret); break; \ case 4: __put_user_asm(data, w, addr, __pu_ret); break; \ case 8: __put_user_asm(data, x, addr, __pu_ret); break; \ default: __pu_ret = __put_user_bad(); break; \ } \ __pu_ret; \ }) #define __put_user_asm(x, size, addr, ret) \ __asm__ __volatile__( \ "/* Put user asm, inline. */\n" \ "1:\t" "st"#size "a %1, [%2] %%asi\n\t" \ "clr %0\n" \ "2:\n\n\t" \ ".section .fixup,#alloc,#execinstr\n\t" \ ".align 4\n" \ "3:\n\t" \ "sethi %%hi(2b), %0\n\t" \ "jmpl %0 + %%lo(2b), %%g0\n\t" \ " mov %3, %0\n\n\t" \ ".previous\n\t" \ ".section __ex_table,\"a\"\n\t" \ ".align 4\n\t" \ ".word 1b, 3b\n\t" \ ".previous\n\n\t" \ : "=r" (ret) : "r" (x), "r" (__m(addr)), \ "i" (-EFAULT)) int __put_user_bad(void); #define __get_kernel_nofault(dst, src, type, label) \ do { \ type *addr = (type __force *)(src); \ register int __gu_ret; \ register unsigned long __gu_val; \ switch (sizeof(type)) { \ case 1: __get_kernel_asm(__gu_val, ub, addr, __gu_ret); break; \ case 2: __get_kernel_asm(__gu_val, uh, addr, __gu_ret); break; \ case 4: __get_kernel_asm(__gu_val, uw, addr, __gu_ret); break; \ case 8: __get_kernel_asm(__gu_val, x, addr, __gu_ret); break; \ default: \ __gu_val = 0; \ __gu_ret = __get_user_bad(); \ break; \ } \ if (__gu_ret) \ goto label; \ *(type *)dst = (__force type) __gu_val; \ } while (0) #define __get_kernel_asm(x, size, addr, ret) \ __asm__ __volatile__( \ "/* Get kernel asm, inline. */\n" \ "1:\t" "ld"#size " [%2], %1\n\t" \ "clr %0\n" \ "2:\n\n\t" \ ".section .fixup,#alloc,#execinstr\n\t" \ ".align 4\n" \ "3:\n\t" \ "sethi %%hi(2b), %0\n\t" \ "clr %1\n\t" \ "jmpl %0 + %%lo(2b), %%g0\n\t" \ " mov %3, %0\n\n\t" \ ".previous\n\t" \ ".section __ex_table,\"a\"\n\t" \ ".align 4\n\t" \ ".word 1b, 3b\n\n\t" \ ".previous\n\t" \ : "=r" (ret), "=r" (x) : "r" (__m(addr)), \ "i" (-EFAULT)) #define __get_user_nocheck(data, addr, size, type) ({ \ register int __gu_ret; \ register unsigned long __gu_val; \ switch (size) { \ case 1: __get_user_asm(__gu_val, ub, addr, __gu_ret); break; \ case 2: __get_user_asm(__gu_val, uh, addr, __gu_ret); break; \ case 4: __get_user_asm(__gu_val, uw, addr, __gu_ret); break; \ case 8: __get_user_asm(__gu_val, x, addr, __gu_ret); break; \ default: \ __gu_val = 0; \ __gu_ret = __get_user_bad(); \ break; \ } \ data = (__force type) __gu_val; \ __gu_ret; \ }) #define __get_user_asm(x, size, addr, ret) \ __asm__ __volatile__( \ "/* Get user asm, inline. */\n" \ "1:\t" "ld"#size "a [%2] %%asi, %1\n\t" \ "clr %0\n" \ "2:\n\n\t" \ ".section .fixup,#alloc,#execinstr\n\t" \ ".align 4\n" \ "3:\n\t" \ "sethi %%hi(2b), %0\n\t" \ "clr %1\n\t" \ "jmpl %0 + %%lo(2b), %%g0\n\t" \ " mov %3, %0\n\n\t" \ ".previous\n\t" \ ".section __ex_table,\"a\"\n\t" \ ".align 4\n\t" \ ".word 1b, 3b\n\n\t" \ ".previous\n\t" \ : "=r" (ret), "=r" (x) : "r" (__m(addr)), \ "i" (-EFAULT)) int __get_user_bad(void); unsigned long __must_check raw_copy_from_user(void *to, const void __user *from, unsigned long size); unsigned long __must_check raw_copy_to_user(void __user *to, const void *from, unsigned long size); #define INLINE_COPY_FROM_USER #define INLINE_COPY_TO_USER unsigned long __must_check raw_copy_in_user(void __user *to, const void __user *from, unsigned long size); unsigned long __must_check __clear_user(void __user *, unsigned long); #define clear_user __clear_user __must_check long strnlen_user(const char __user *str, long n); struct pt_regs; unsigned long compute_effective_address(struct pt_regs *, unsigned int insn, unsigned int rd); #endif /* _ASM_UACCESS_H */ |