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