[linux-block.git] / arch / cris / include / asm / uaccess.h

/* SPDX-License-Identifier: GPL-2.0 */
/*
 * Authors:    Bjorn Wesen (bjornw@axis.com)
 *	       Hans-Peter Nilsson (hp@axis.com)
 */

/* Asm:s have been tweaked (within the domain of correctness) to give
   satisfactory results for "gcc version 2.96 20000427 (experimental)".

   Check regularly...

   Register $r9 is chosen for temporaries, being a call-clobbered register
   first in line to be used (notably for local blocks), not colliding with
   parameter registers.  */

#ifndef _CRIS_UACCESS_H
#define _CRIS_UACCESS_H

#include <asm/processor.h>
#include <asm/page.h>

/*
 * The fs value determines whether argument validity checking should be
 * performed or not.  If get_fs() == USER_DS, checking is performed, with
 * get_fs() == KERNEL_DS, checking is bypassed.
 *
 * For historical reasons, these macros are grossly misnamed.
 */

#define MAKE_MM_SEG(s)	((mm_segment_t) { (s) })

/* addr_limit is the maximum accessible address for the task. we misuse
 * the KERNEL_DS and USER_DS values to both assign and compare the
 * addr_limit values through the equally misnamed get/set_fs macros.
 * (see above)
 */

#define KERNEL_DS	MAKE_MM_SEG(0xFFFFFFFF)
#define USER_DS		MAKE_MM_SEG(TASK_SIZE)

#define get_ds()	(KERNEL_DS)
#define get_fs()	(current_thread_info()->addr_limit)
#define set_fs(x)	(current_thread_info()->addr_limit = (x))

#define segment_eq(a, b)	((a).seg == (b).seg)

#define __kernel_ok (uaccess_kernel())
#define __user_ok(addr, size) \
	(((size) <= TASK_SIZE) && ((addr) <= TASK_SIZE-(size)))
#define __access_ok(addr, size) (__kernel_ok || __user_ok((addr), (size)))
#define access_ok(type, addr, size) __access_ok((unsigned long)(addr), (size))

#include <arch/uaccess.h>
#include <asm/extable.h>

/*
 * These are 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.
 *
 * The "__xxx" versions of the user access functions are versions that
 * do not verify the address space, that must have been done previously
 * with a separate "access_ok()" call (this is used when we do multiple
 * accesses to the same area of user memory).
 *
 * As we use the same address space for kernel and user data on
 * CRIS, we can just do these as direct assignments.  (Of course, the
 * exception handling means that it's no longer "just"...)
 */
#define get_user(x, ptr) \
	__get_user_check((x), (ptr), sizeof(*(ptr)))
#define put_user(x, ptr) \
	__put_user_check((__typeof__(*(ptr)))(x), (ptr), sizeof(*(ptr)))

#define __get_user(x, ptr) \
	__get_user_nocheck((x), (ptr), sizeof(*(ptr)))
#define __put_user(x, ptr) \
	__put_user_nocheck((__typeof__(*(ptr)))(x), (ptr), sizeof(*(ptr)))

extern long __put_user_bad(void);

#define __put_user_size(x, ptr, size, retval)				\
do {									\
	retval = 0;							\
	switch (size) {							\
	case 1:								\
		__put_user_asm(x, ptr, retval, "move.b");		\
		break;							\
	case 2:								\
		__put_user_asm(x, ptr, retval, "move.w");		\
		break;							\
	case 4:								\
		__put_user_asm(x, ptr, retval, "move.d");		\
		break;							\
	case 8:								\
		__put_user_asm_64(x, ptr, retval);			\
		break;							\
	default:							\
		__put_user_bad();					\
	}								\
} while (0)

#define __get_user_size(x, ptr, size, retval)				\
do {									\
	retval = 0;							\
	switch (size) {							\
	case 1:								\
		__get_user_asm(x, ptr, retval, "move.b");		\
		break;							\
	case 2:								\
		__get_user_asm(x, ptr, retval, "move.w");		\
		break;							\
	case 4:								\
		__get_user_asm(x, ptr, retval, "move.d");		\
		break;							\
	case 8:								\
		__get_user_asm_64(x, ptr, retval);			\
		break;							\
	default:							\
		(x) = __get_user_bad();					\
	}								\
} while (0)

#define __put_user_nocheck(x, ptr, size)		\
({							\
	long __pu_err;					\
	__put_user_size((x), (ptr), (size), __pu_err);	\
	__pu_err;					\
})

#define __put_user_check(x, ptr, size)					\
({									\
	long __pu_err = -EFAULT;					\
	__typeof__(*(ptr)) *__pu_addr = (ptr);				\
	if (access_ok(VERIFY_WRITE, __pu_addr, size))			\
		__put_user_size((x), __pu_addr, (size), __pu_err);	\
	__pu_err;							\
})

struct __large_struct { unsigned long buf[100]; };
#define __m(x) (*(struct __large_struct *)(x))


#define __get_user_nocheck(x, ptr, size)			\
({								\
	long __gu_err, __gu_val;				\
	__get_user_size(__gu_val, (ptr), (size), __gu_err);	\
	(x) = (__force __typeof__(*(ptr)))__gu_val;		\
	__gu_err;						\
})

#define __get_user_check(x, ptr, size)					\
({									\
	long __gu_err = -EFAULT, __gu_val = 0;				\
	const __typeof__(*(ptr)) *__gu_addr = (ptr);			\
	if (access_ok(VERIFY_READ, __gu_addr, size))			\
		__get_user_size(__gu_val, __gu_addr, (size), __gu_err);	\
	(x) = (__force __typeof__(*(ptr)))__gu_val;			\
	__gu_err;							\
})

extern long __get_user_bad(void);

/* More complex functions.  Most are inline, but some call functions that
   live in lib/usercopy.c  */

extern unsigned long __copy_user(void __user *to, const void *from, unsigned long n);
extern unsigned long __copy_user_in(void *to, const void __user *from, unsigned long n);
extern unsigned long __do_clear_user(void __user *to, unsigned long n);

static inline long
strncpy_from_user(char *dst, const char __user *src, long count)
{
	long res = -EFAULT;

	if (access_ok(VERIFY_READ, src, 1))
		res = __do_strncpy_from_user(dst, src, count);
	return res;
}


/* Note that these expand awfully if made into switch constructs, so
   don't do that.  */

static inline unsigned long
__constant_copy_from_user(void *to, const void __user *from, unsigned long n)
{
	unsigned long ret = 0;

	if (n == 0)
		;
	else if (n == 1)
		__asm_copy_from_user_1(to, from, ret);
	else if (n == 2)
		__asm_copy_from_user_2(to, from, ret);
	else if (n == 3)
		__asm_copy_from_user_3(to, from, ret);
	else if (n == 4)
		__asm_copy_from_user_4(to, from, ret);
	else if (n == 5)
		__asm_copy_from_user_5(to, from, ret);
	else if (n == 6)
		__asm_copy_from_user_6(to, from, ret);
	else if (n == 7)
		__asm_copy_from_user_7(to, from, ret);
	else if (n == 8)
		__asm_copy_from_user_8(to, from, ret);
	else if (n == 9)
		__asm_copy_from_user_9(to, from, ret);
	else if (n == 10)
		__asm_copy_from_user_10(to, from, ret);
	else if (n == 11)
		__asm_copy_from_user_11(to, from, ret);
	else if (n == 12)
		__asm_copy_from_user_12(to, from, ret);
	else if (n == 13)
		__asm_copy_from_user_13(to, from, ret);
	else if (n == 14)
		__asm_copy_from_user_14(to, from, ret);
	else if (n == 15)
		__asm_copy_from_user_15(to, from, ret);
	else if (n == 16)
		__asm_copy_from_user_16(to, from, ret);
	else if (n == 20)
		__asm_copy_from_user_20(to, from, ret);
	else if (n == 24)
		__asm_copy_from_user_24(to, from, ret);
	else
		ret = __copy_user_in(to, from, n);

	return ret;
}

/* Ditto, don't make a switch out of this.  */

static inline unsigned long
__constant_copy_to_user(void __user *to, const void *from, unsigned long n)
{
	unsigned long ret = 0;

	if (n == 0)
		;
	else if (n == 1)
		__asm_copy_to_user_1(to, from, ret);
	else if (n == 2)
		__asm_copy_to_user_2(to, from, ret);
	else if (n == 3)
		__asm_copy_to_user_3(to, from, ret);
	else if (n == 4)
		__asm_copy_to_user_4(to, from, ret);
	else if (n == 5)
		__asm_copy_to_user_5(to, from, ret);
	else if (n == 6)
		__asm_copy_to_user_6(to, from, ret);
	else if (n == 7)
		__asm_copy_to_user_7(to, from, ret);
	else if (n == 8)
		__asm_copy_to_user_8(to, from, ret);
	else if (n == 9)
		__asm_copy_to_user_9(to, from, ret);
	else if (n == 10)
		__asm_copy_to_user_10(to, from, ret);
	else if (n == 11)
		__asm_copy_to_user_11(to, from, ret);
	else if (n == 12)
		__asm_copy_to_user_12(to, from, ret);
	else if (n == 13)
		__asm_copy_to_user_13(to, from, ret);
	else if (n == 14)
		__asm_copy_to_user_14(to, from, ret);
	else if (n == 15)
		__asm_copy_to_user_15(to, from, ret);
	else if (n == 16)
		__asm_copy_to_user_16(to, from, ret);
	else if (n == 20)
		__asm_copy_to_user_20(to, from, ret);
	else if (n == 24)
		__asm_copy_to_user_24(to, from, ret);
	else
		ret = __copy_user(to, from, n);

	return ret;
}

/* No switch, please.  */

static inline unsigned long
__constant_clear_user(void __user *to, unsigned long n)
{
	unsigned long ret = 0;

	if (n == 0)
		;
	else if (n == 1)
		__asm_clear_1(to, ret);
	else if (n == 2)
		__asm_clear_2(to, ret);
	else if (n == 3)
		__asm_clear_3(to, ret);
	else if (n == 4)
		__asm_clear_4(to, ret);
	else if (n == 8)
		__asm_clear_8(to, ret);
	else if (n == 12)
		__asm_clear_12(to, ret);
	else if (n == 16)
		__asm_clear_16(to, ret);
	else if (n == 20)
		__asm_clear_20(to, ret);
	else if (n == 24)
		__asm_clear_24(to, ret);
	else
		ret = __do_clear_user(to, n);

	return ret;
}


static inline size_t clear_user(void __user *to, size_t n)
{
	if (unlikely(!access_ok(VERIFY_WRITE, to, n)))
		return n;
	if (__builtin_constant_p(n))
		return __constant_clear_user(to, n);
	else
		return __do_clear_user(to, n);
}

static inline unsigned long
raw_copy_from_user(void *to, const void __user *from, unsigned long n)
{
	if (__builtin_constant_p(n))
		return __constant_copy_from_user(to, from, n);
	else
		return __copy_user_in(to, from, n);
}

static inline unsigned long
raw_copy_to_user(void __user *to, const void *from, unsigned long n)
{
	if (__builtin_constant_p(n))
		return __constant_copy_to_user(to, from, n);
	else
		return __copy_user(to, from, n);
}

#define INLINE_COPY_FROM_USER
#define INLINE_COPY_TO_USER

static inline unsigned long
__clear_user(void __user *to, unsigned long n)
{
	return __do_clear_user(to, n);
}

#endif	/* _CRIS_UACCESS_H */
Commit	Line	Data
b2441318	1	/* SPDX-License-Identifier: GPL-2.0 */
9987c19e	2	/*
1da177e4 LT	3	* Authors: Bjorn Wesen (bjornw@axis.com)
1da177e4 LT	4	* Hans-Peter Nilsson (hp@axis.com)
1da177e4 LT	5	*/
	6
	7	/* Asm:s have been tweaked (within the domain of correctness) to give
	8	satisfactory results for "gcc version 2.96 20000427 (experimental)".
	9
	10	Check regularly...
	11
	12	Register $r9 is chosen for temporaries, being a call-clobbered register
	13	first in line to be used (notably for local blocks), not colliding with
	14	parameter registers. */
	15
	16	#ifndef _CRIS_UACCESS_H
	17	#define _CRIS_UACCESS_H
	18
1da177e4 LT	19	#include <asm/processor.h>
	20	#include <asm/page.h>
	21
1da177e4 LT	22	/*
	23	* The fs value determines whether argument validity checking should be
	24	* performed or not. If get_fs() == USER_DS, checking is performed, with
	25	* get_fs() == KERNEL_DS, checking is bypassed.
	26	*
	27	* For historical reasons, these macros are grossly misnamed.
	28	*/
	29
	30	#define MAKE_MM_SEG(s) ((mm_segment_t) { (s) })
	31
	32	/* addr_limit is the maximum accessible address for the task. we misuse
9987c19e	33	* the KERNEL_DS and USER_DS values to both assign and compare the
1da177e4 LT	34	* addr_limit values through the equally misnamed get/set_fs macros.
	35	* (see above)
	36	*/
	37
	38	#define KERNEL_DS MAKE_MM_SEG(0xFFFFFFFF)
	39	#define USER_DS MAKE_MM_SEG(TASK_SIZE)
	40
	41	#define get_ds() (KERNEL_DS)
	42	#define get_fs() (current_thread_info()->addr_limit)
	43	#define set_fs(x) (current_thread_info()->addr_limit = (x))
	44
83f1588e	45	#define segment_eq(a, b) ((a).seg == (b).seg)
1da177e4	46
db68ce10	47	#define __kernel_ok (uaccess_kernel())
83f1588e	48	#define __user_ok(addr, size) \
9987c19e	49	(((size) <= TASK_SIZE) && ((addr) <= TASK_SIZE-(size)))
83f1588e MT	50	#define __access_ok(addr, size) (__kernel_ok \|\| __user_ok((addr), (size)))
83f1588e MT	51	#define access_ok(type, addr, size) __access_ok((unsigned long)(addr), (size))
1da177e4	52
556dcee7	53	#include <arch/uaccess.h>
a8be3445	54	#include <asm/extable.h>
1da177e4 LT	55
	56	/*
	57	* These are the main single-value transfer routines. They automatically
	58	* use the right size if we just have the right pointer type.
	59	*
	60	* This gets kind of ugly. We want to return _two_ values in "get_user()"
	61	* and yet we don't want to do any pointers, because that is too much
	62	* of a performance impact. Thus we have a few rather ugly macros here,
	63	* and hide all the ugliness from the user.
	64	*
	65	* The "__xxx" versions of the user access functions are versions that
	66	* do not verify the address space, that must have been done previously
	67	* with a separate "access_ok()" call (this is used when we do multiple
	68	* accesses to the same area of user memory).
	69	*
	70	* As we use the same address space for kernel and user data on
	71	* CRIS, we can just do these as direct assignments. (Of course, the
	72	* exception handling means that it's no longer "just"...)
	73	*/
83f1588e	74	#define get_user(x, ptr) \
9987c19e	75	__get_user_check((x), (ptr), sizeof(*(ptr)))
83f1588e	76	#define put_user(x, ptr) \
9987c19e	77	__put_user_check((__typeof__((ptr)))(x), (ptr), sizeof((ptr)))
1da177e4	78
83f1588e	79	#define __get_user(x, ptr) \
9987c19e	80	__get_user_nocheck((x), (ptr), sizeof(*(ptr)))
83f1588e	81	#define __put_user(x, ptr) \
9987c19e	82	__put_user_nocheck((__typeof__((ptr)))(x), (ptr), sizeof((ptr)))
1da177e4 LT	83
	84	extern long __put_user_bad(void);
	85
83f1588e MT	86	#define __put_user_size(x, ptr, size, retval) \
	87	do { \
	88	retval = 0; \
	89	switch (size) { \
9987c19e JN	90	case 1: \
	91	__put_user_asm(x, ptr, retval, "move.b"); \
	92	break; \
	93	case 2: \
	94	__put_user_asm(x, ptr, retval, "move.w"); \
	95	break; \
	96	case 4: \
	97	__put_user_asm(x, ptr, retval, "move.d"); \
	98	break; \
	99	case 8: \
	100	__put_user_asm_64(x, ptr, retval); \
	101	break; \
	102	default: \
	103	__put_user_bad(); \
83f1588e	104	} \
1da177e4 LT	105	} while (0)
1da177e4 LT	106
83f1588e MT	107	#define __get_user_size(x, ptr, size, retval) \
	108	do { \
	109	retval = 0; \
	110	switch (size) { \
9987c19e JN	111	case 1: \
	112	__get_user_asm(x, ptr, retval, "move.b"); \
	113	break; \
	114	case 2: \
	115	__get_user_asm(x, ptr, retval, "move.w"); \
	116	break; \
	117	case 4: \
	118	__get_user_asm(x, ptr, retval, "move.d"); \
	119	break; \
	120	case 8: \
	121	__get_user_asm_64(x, ptr, retval); \
	122	break; \
	123	default: \
	124	(x) = __get_user_bad(); \
83f1588e	125	} \
1da177e4 LT	126	} while (0)
1da177e4 LT	127
83f1588e	128	#define __put_user_nocheck(x, ptr, size) \
1da177e4 LT	129	({ \
1da177e4 LT	130	long __pu_err; \
83f1588e	131	__put_user_size((x), (ptr), (size), __pu_err); \
1da177e4 LT	132	__pu_err; \
	133	})
	134
83f1588e MT	135	#define __put_user_check(x, ptr, size) \
	136	({ \
	137	long __pu_err = -EFAULT; \
	138	__typeof__((ptr)) __pu_addr = (ptr); \
	139	if (access_ok(VERIFY_WRITE, __pu_addr, size)) \
	140	__put_user_size((x), __pu_addr, (size), __pu_err); \
	141	__pu_err; \
1da177e4 LT	142	})
	143
	144	struct __large_struct { unsigned long buf[100]; };
	145	#define __m(x) ((struct __large_struct )(x))
	146
	147
	148
83f1588e	149	#define __get_user_nocheck(x, ptr, size) \
1da177e4 LT	150	({ \
1da177e4 LT	151	long __gu_err, __gu_val; \
83f1588e	152	__get_user_size(__gu_val, (ptr), (size), __gu_err); \
458e3192	153	(x) = (__force __typeof__(*(ptr)))__gu_val; \
1da177e4 LT	154	__gu_err; \
	155	})
	156
83f1588e	157	#define __get_user_check(x, ptr, size) \
1da177e4 LT	158	({ \
	159	long __gu_err = -EFAULT, __gu_val = 0; \
	160	const __typeof__((ptr)) __gu_addr = (ptr); \
83f1588e MT	161	if (access_ok(VERIFY_READ, __gu_addr, size)) \
83f1588e MT	162	__get_user_size(__gu_val, __gu_addr, (size), __gu_err); \
458e3192	163	(x) = (__force __typeof__(*(ptr)))__gu_val; \
1da177e4 LT	164	__gu_err; \
	165	})
	166
	167	extern long __get_user_bad(void);
	168
	169	/* More complex functions. Most are inline, but some call functions that
	170	live in lib/usercopy.c */
	171
07f2402b	172	extern unsigned long __copy_user(void __user to, const void from, unsigned long n);
b71f1bf5	173	extern unsigned long __copy_user_in(void to, const void __user from, unsigned long n);
07f2402b	174	extern unsigned long __do_clear_user(void __user *to, unsigned long n);
1da177e4	175
d9b5444e	176	static inline long
1da177e4 LT	177	strncpy_from_user(char dst, const char __user src, long count)
	178	{
	179	long res = -EFAULT;
9987c19e	180
1da177e4 LT	181	if (access_ok(VERIFY_READ, src, 1))
	182	res = __do_strncpy_from_user(dst, src, count);
	183	return res;
	184	}
	185
	186
07f2402b	187	/* Note that these expand awfully if made into switch constructs, so
1da177e4 LT	188	don't do that. */
1da177e4 LT	189
d9b5444e	190	static inline unsigned long
1da177e4 LT	191	__constant_copy_from_user(void to, const void __user from, unsigned long n)
	192	{
	193	unsigned long ret = 0;
9987c19e	194
1da177e4 LT	195	if (n == 0)
	196	;
	197	else if (n == 1)
	198	__asm_copy_from_user_1(to, from, ret);
	199	else if (n == 2)
	200	__asm_copy_from_user_2(to, from, ret);
	201	else if (n == 3)
	202	__asm_copy_from_user_3(to, from, ret);
	203	else if (n == 4)
	204	__asm_copy_from_user_4(to, from, ret);
	205	else if (n == 5)
	206	__asm_copy_from_user_5(to, from, ret);
	207	else if (n == 6)
	208	__asm_copy_from_user_6(to, from, ret);
	209	else if (n == 7)
	210	__asm_copy_from_user_7(to, from, ret);
	211	else if (n == 8)
	212	__asm_copy_from_user_8(to, from, ret);
	213	else if (n == 9)
	214	__asm_copy_from_user_9(to, from, ret);
	215	else if (n == 10)
	216	__asm_copy_from_user_10(to, from, ret);
	217	else if (n == 11)
	218	__asm_copy_from_user_11(to, from, ret);
	219	else if (n == 12)
	220	__asm_copy_from_user_12(to, from, ret);
	221	else if (n == 13)
	222	__asm_copy_from_user_13(to, from, ret);
	223	else if (n == 14)
	224	__asm_copy_from_user_14(to, from, ret);
	225	else if (n == 15)
	226	__asm_copy_from_user_15(to, from, ret);
	227	else if (n == 16)
	228	__asm_copy_from_user_16(to, from, ret);
	229	else if (n == 20)
	230	__asm_copy_from_user_20(to, from, ret);
	231	else if (n == 24)
	232	__asm_copy_from_user_24(to, from, ret);
	233	else
b71f1bf5	234	ret = __copy_user_in(to, from, n);
1da177e4 LT	235
	236	return ret;
	237	}
	238
	239	/* Ditto, don't make a switch out of this. */
	240
d9b5444e	241	static inline unsigned long
1da177e4 LT	242	__constant_copy_to_user(void __user to, const void from, unsigned long n)
	243	{
	244	unsigned long ret = 0;
9987c19e	245
1da177e4 LT	246	if (n == 0)
	247	;
	248	else if (n == 1)
	249	__asm_copy_to_user_1(to, from, ret);
	250	else if (n == 2)
	251	__asm_copy_to_user_2(to, from, ret);
	252	else if (n == 3)
	253	__asm_copy_to_user_3(to, from, ret);
	254	else if (n == 4)
	255	__asm_copy_to_user_4(to, from, ret);
	256	else if (n == 5)
	257	__asm_copy_to_user_5(to, from, ret);
	258	else if (n == 6)
	259	__asm_copy_to_user_6(to, from, ret);
	260	else if (n == 7)
	261	__asm_copy_to_user_7(to, from, ret);
	262	else if (n == 8)
	263	__asm_copy_to_user_8(to, from, ret);
	264	else if (n == 9)
	265	__asm_copy_to_user_9(to, from, ret);
	266	else if (n == 10)
	267	__asm_copy_to_user_10(to, from, ret);
	268	else if (n == 11)
	269	__asm_copy_to_user_11(to, from, ret);
	270	else if (n == 12)
	271	__asm_copy_to_user_12(to, from, ret);
	272	else if (n == 13)
	273	__asm_copy_to_user_13(to, from, ret);
	274	else if (n == 14)
	275	__asm_copy_to_user_14(to, from, ret);
	276	else if (n == 15)
	277	__asm_copy_to_user_15(to, from, ret);
	278	else if (n == 16)
	279	__asm_copy_to_user_16(to, from, ret);
	280	else if (n == 20)
	281	__asm_copy_to_user_20(to, from, ret);
	282	else if (n == 24)
	283	__asm_copy_to_user_24(to, from, ret);
	284	else
eb47e029	285	ret = __copy_user(to, from, n);
1da177e4 LT	286
	287	return ret;
	288	}
	289
	290	/* No switch, please. */
	291
d9b5444e	292	static inline unsigned long
1da177e4 LT	293	__constant_clear_user(void __user *to, unsigned long n)
	294	{
	295	unsigned long ret = 0;
9987c19e	296
1da177e4 LT	297	if (n == 0)
	298	;
	299	else if (n == 1)
	300	__asm_clear_1(to, ret);
	301	else if (n == 2)
	302	__asm_clear_2(to, ret);
	303	else if (n == 3)
	304	__asm_clear_3(to, ret);
	305	else if (n == 4)
	306	__asm_clear_4(to, ret);
	307	else if (n == 8)
	308	__asm_clear_8(to, ret);
	309	else if (n == 12)
	310	__asm_clear_12(to, ret);
	311	else if (n == 16)
	312	__asm_clear_16(to, ret);
	313	else if (n == 20)
	314	__asm_clear_20(to, ret);
	315	else if (n == 24)
	316	__asm_clear_24(to, ret);
	317	else
eb47e029	318	ret = __do_clear_user(to, n);
1da177e4 LT	319
	320	return ret;
	321	}
	322
	323
eb47e029 AV	324	static inline size_t clear_user(void __user *to, size_t n)
	325	{
	326	if (unlikely(!access_ok(VERIFY_WRITE, to, n)))
	327	return n;
	328	if (__builtin_constant_p(n))
	329	return __constant_clear_user(to, n);
	330	else
	331	return __do_clear_user(to, n);
	332	}
1da177e4	333
0c7e9a87 AV	334	static inline unsigned long
0c7e9a87 AV	335	raw_copy_from_user(void to, const void __user from, unsigned long n)
eb47e029	336	{
0c7e9a87 AV	337	if (__builtin_constant_p(n))
	338	return __constant_copy_from_user(to, from, n);
	339	else
	340	return __copy_user_in(to, from, n);
eb47e029	341	}
1da177e4	342
0c7e9a87 AV	343	static inline unsigned long
0c7e9a87 AV	344	raw_copy_to_user(void __user to, const void from, unsigned long n)
eb47e029	345	{
eb47e029 AV	346	if (__builtin_constant_p(n))
	347	return __constant_copy_to_user(to, from, n);
	348	else
	349	return __copy_user(to, from, n);
	350	}
1da177e4	351
0c7e9a87 AV	352	#define INLINE_COPY_FROM_USER
0c7e9a87 AV	353	#define INLINE_COPY_TO_USER
1da177e4	354
d9b5444e	355	static inline unsigned long
0c7e9a87	356	__clear_user(void __user *to, unsigned long n)
1da177e4	357	{
83f1588e	358	return __do_clear_user(to, n);
1da177e4 LT	359	}
1da177e4 LT	360
1da177e4	361	#endif /* _CRIS_UACCESS_H */