blob: 6839f8fcf76b2d7e819a185ed4dfe7b390acc16d [file] [log] [blame]
David Brazdil0f672f62019-12-10 10:32:29 +00001/* SPDX-License-Identifier: GPL-2.0-or-later */
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002/*
3 * OpenRISC Linux
4 *
5 * Linux architectural port borrowing liberally from similar works of
6 * others. All original copyrights apply as per the original source
7 * declaration.
8 *
9 * OpenRISC implementation:
10 * Copyright (C) 2003 Matjaz Breskvar <phoenix@bsemi.com>
11 * Copyright (C) 2010-2011 Jonas Bonn <jonas@southpole.se>
12 * et al.
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000013 */
14
15#ifndef __ASM_OPENRISC_UACCESS_H
16#define __ASM_OPENRISC_UACCESS_H
17
18/*
19 * User space memory access functions
20 */
21#include <linux/prefetch.h>
22#include <linux/string.h>
23#include <asm/page.h>
24#include <asm/extable.h>
25
26/*
27 * The fs value determines whether argument validity checking should be
28 * performed or not. If get_fs() == USER_DS, checking is performed, with
29 * get_fs() == KERNEL_DS, checking is bypassed.
30 *
31 * For historical reasons, these macros are grossly misnamed.
32 */
33
34/* addr_limit is the maximum accessible address for the task. we misuse
35 * the KERNEL_DS and USER_DS values to both assign and compare the
36 * addr_limit values through the equally misnamed get/set_fs macros.
37 * (see above)
38 */
39
40#define KERNEL_DS (~0UL)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000041
42#define USER_DS (TASK_SIZE)
43#define get_fs() (current_thread_info()->addr_limit)
44#define set_fs(x) (current_thread_info()->addr_limit = (x))
45
46#define segment_eq(a, b) ((a) == (b))
47
48/* Ensure that the range from addr to addr+size is all within the process'
49 * address space
50 */
51#define __range_ok(addr, size) (size <= get_fs() && addr <= (get_fs()-size))
52
53/* Ensure that addr is below task's addr_limit */
54#define __addr_ok(addr) ((unsigned long) addr < get_fs())
55
David Brazdil0f672f62019-12-10 10:32:29 +000056#define access_ok(addr, size) \
57({ \
58 unsigned long __ao_addr = (unsigned long)(addr); \
59 unsigned long __ao_size = (unsigned long)(size); \
60 __range_ok(__ao_addr, __ao_size); \
61})
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000062
63/*
64 * These are the main single-value transfer routines. They automatically
65 * use the right size if we just have the right pointer type.
66 *
67 * This gets kind of ugly. We want to return _two_ values in "get_user()"
68 * and yet we don't want to do any pointers, because that is too much
69 * of a performance impact. Thus we have a few rather ugly macros here,
70 * and hide all the uglyness from the user.
71 *
72 * The "__xxx" versions of the user access functions are versions that
73 * do not verify the address space, that must have been done previously
74 * with a separate "access_ok()" call (this is used when we do multiple
75 * accesses to the same area of user memory).
76 *
77 * As we use the same address space for kernel and user data on the
78 * PowerPC, we can just do these as direct assignments. (Of course, the
79 * exception handling means that it's no longer "just"...)
80 */
81#define get_user(x, ptr) \
82 __get_user_check((x), (ptr), sizeof(*(ptr)))
83#define put_user(x, ptr) \
84 __put_user_check((__typeof__(*(ptr)))(x), (ptr), sizeof(*(ptr)))
85
86#define __get_user(x, ptr) \
87 __get_user_nocheck((x), (ptr), sizeof(*(ptr)))
88#define __put_user(x, ptr) \
89 __put_user_nocheck((__typeof__(*(ptr)))(x), (ptr), sizeof(*(ptr)))
90
91extern long __put_user_bad(void);
92
93#define __put_user_nocheck(x, ptr, size) \
94({ \
95 long __pu_err; \
96 __put_user_size((x), (ptr), (size), __pu_err); \
97 __pu_err; \
98})
99
100#define __put_user_check(x, ptr, size) \
101({ \
102 long __pu_err = -EFAULT; \
103 __typeof__(*(ptr)) *__pu_addr = (ptr); \
David Brazdil0f672f62019-12-10 10:32:29 +0000104 if (access_ok(__pu_addr, size)) \
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000105 __put_user_size((x), __pu_addr, (size), __pu_err); \
106 __pu_err; \
107})
108
109#define __put_user_size(x, ptr, size, retval) \
110do { \
111 retval = 0; \
112 switch (size) { \
113 case 1: __put_user_asm(x, ptr, retval, "l.sb"); break; \
114 case 2: __put_user_asm(x, ptr, retval, "l.sh"); break; \
115 case 4: __put_user_asm(x, ptr, retval, "l.sw"); break; \
116 case 8: __put_user_asm2(x, ptr, retval); break; \
117 default: __put_user_bad(); \
118 } \
119} while (0)
120
121struct __large_struct {
122 unsigned long buf[100];
123};
124#define __m(x) (*(struct __large_struct *)(x))
125
126/*
127 * We don't tell gcc that we are accessing memory, but this is OK
128 * because we do not write to any memory gcc knows about, so there
129 * are no aliasing issues.
130 */
131#define __put_user_asm(x, addr, err, op) \
132 __asm__ __volatile__( \
133 "1: "op" 0(%2),%1\n" \
134 "2:\n" \
135 ".section .fixup,\"ax\"\n" \
136 "3: l.addi %0,r0,%3\n" \
137 " l.j 2b\n" \
138 " l.nop\n" \
139 ".previous\n" \
140 ".section __ex_table,\"a\"\n" \
141 " .align 2\n" \
142 " .long 1b,3b\n" \
143 ".previous" \
144 : "=r"(err) \
145 : "r"(x), "r"(addr), "i"(-EFAULT), "0"(err))
146
147#define __put_user_asm2(x, addr, err) \
148 __asm__ __volatile__( \
149 "1: l.sw 0(%2),%1\n" \
150 "2: l.sw 4(%2),%H1\n" \
151 "3:\n" \
152 ".section .fixup,\"ax\"\n" \
153 "4: l.addi %0,r0,%3\n" \
154 " l.j 3b\n" \
155 " l.nop\n" \
156 ".previous\n" \
157 ".section __ex_table,\"a\"\n" \
158 " .align 2\n" \
159 " .long 1b,4b\n" \
160 " .long 2b,4b\n" \
161 ".previous" \
162 : "=r"(err) \
163 : "r"(x), "r"(addr), "i"(-EFAULT), "0"(err))
164
165#define __get_user_nocheck(x, ptr, size) \
166({ \
Olivier Deprez0e641232021-09-23 10:07:05 +0200167 long __gu_err; \
168 __get_user_size((x), (ptr), (size), __gu_err); \
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000169 __gu_err; \
170})
171
172#define __get_user_check(x, ptr, size) \
173({ \
Olivier Deprez0e641232021-09-23 10:07:05 +0200174 long __gu_err = -EFAULT; \
175 const __typeof__(*(ptr)) *__gu_addr = (ptr); \
176 if (access_ok(__gu_addr, size)) \
177 __get_user_size((x), __gu_addr, (size), __gu_err); \
178 else \
179 (x) = (__typeof__(*(ptr))) 0; \
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000180 __gu_err; \
181})
182
183extern long __get_user_bad(void);
184
185#define __get_user_size(x, ptr, size, retval) \
186do { \
187 retval = 0; \
188 switch (size) { \
189 case 1: __get_user_asm(x, ptr, retval, "l.lbz"); break; \
190 case 2: __get_user_asm(x, ptr, retval, "l.lhz"); break; \
191 case 4: __get_user_asm(x, ptr, retval, "l.lwz"); break; \
192 case 8: __get_user_asm2(x, ptr, retval); break; \
Olivier Deprez0e641232021-09-23 10:07:05 +0200193 default: (x) = (__typeof__(*(ptr)))__get_user_bad(); \
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000194 } \
195} while (0)
196
197#define __get_user_asm(x, addr, err, op) \
Olivier Deprez0e641232021-09-23 10:07:05 +0200198{ \
199 unsigned long __gu_tmp; \
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000200 __asm__ __volatile__( \
201 "1: "op" %1,0(%2)\n" \
202 "2:\n" \
203 ".section .fixup,\"ax\"\n" \
204 "3: l.addi %0,r0,%3\n" \
205 " l.addi %1,r0,0\n" \
206 " l.j 2b\n" \
207 " l.nop\n" \
208 ".previous\n" \
209 ".section __ex_table,\"a\"\n" \
210 " .align 2\n" \
211 " .long 1b,3b\n" \
212 ".previous" \
Olivier Deprez0e641232021-09-23 10:07:05 +0200213 : "=r"(err), "=r"(__gu_tmp) \
214 : "r"(addr), "i"(-EFAULT), "0"(err)); \
215 (x) = (__typeof__(*(addr)))__gu_tmp; \
216}
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000217
218#define __get_user_asm2(x, addr, err) \
Olivier Deprez0e641232021-09-23 10:07:05 +0200219{ \
220 unsigned long long __gu_tmp; \
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000221 __asm__ __volatile__( \
222 "1: l.lwz %1,0(%2)\n" \
223 "2: l.lwz %H1,4(%2)\n" \
224 "3:\n" \
225 ".section .fixup,\"ax\"\n" \
226 "4: l.addi %0,r0,%3\n" \
227 " l.addi %1,r0,0\n" \
228 " l.addi %H1,r0,0\n" \
229 " l.j 3b\n" \
230 " l.nop\n" \
231 ".previous\n" \
232 ".section __ex_table,\"a\"\n" \
233 " .align 2\n" \
234 " .long 1b,4b\n" \
235 " .long 2b,4b\n" \
236 ".previous" \
Olivier Deprez0e641232021-09-23 10:07:05 +0200237 : "=r"(err), "=&r"(__gu_tmp) \
238 : "r"(addr), "i"(-EFAULT), "0"(err)); \
239 (x) = (__typeof__(*(addr)))( \
240 (__typeof__((x)-(x)))__gu_tmp); \
241}
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000242
243/* more complex routines */
244
245extern unsigned long __must_check
246__copy_tofrom_user(void *to, const void *from, unsigned long size);
247static inline unsigned long
248raw_copy_from_user(void *to, const void __user *from, unsigned long size)
249{
250 return __copy_tofrom_user(to, (__force const void *)from, size);
251}
252static inline unsigned long
253raw_copy_to_user(void *to, const void __user *from, unsigned long size)
254{
255 return __copy_tofrom_user((__force void *)to, from, size);
256}
257#define INLINE_COPY_FROM_USER
258#define INLINE_COPY_TO_USER
259
260extern unsigned long __clear_user(void *addr, unsigned long size);
261
262static inline __must_check unsigned long
263clear_user(void *addr, unsigned long size)
264{
David Brazdil0f672f62019-12-10 10:32:29 +0000265 if (likely(access_ok(addr, size)))
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000266 size = __clear_user(addr, size);
267 return size;
268}
269
270#define user_addr_max() \
271 (uaccess_kernel() ? ~0UL : TASK_SIZE)
272
273extern long strncpy_from_user(char *dest, const char __user *src, long count);
274
275extern __must_check long strnlen_user(const char __user *str, long n);
276
277#endif /* __ASM_OPENRISC_UACCESS_H */