[GitHub/mt8127/android_kernel_alcatel_ttab.git] / include / asm-cris / uaccess.h

/* 
 * 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

#ifndef __ASSEMBLY__
#include <linux/sched.h>
#include <linux/errno.h>
#include <asm/processor.h>
#include <asm/page.h>

#define VERIFY_READ	0
#define VERIFY_WRITE	1

/*
 * 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 (segment_eq(get_fs(), KERNEL_DS))
#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 <asm/arch/uaccess.h>

/*
 * The exception table consists of pairs of addresses: the first is the
 * address of an instruction that is allowed to fault, and the second is
 * the address at which the program should continue.  No registers are
 * modified, so it is entirely up to the continuation code to figure out
 * what to do.
 *
 * All the routines below use bits of fixup code that are out of line
 * with the main instruction path.  This means when everything is well,
 * we don't even have to jump over them.  Further, they do not intrude
 * on our cache or tlb entries.
 */

struct exception_table_entry
{
	unsigned long insn, fixup;
};

/*
 * 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) = (__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) = (__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_zeroing(void *to, const void __user *from, unsigned long n);
extern unsigned long __do_clear_user(void __user *to, unsigned long n);

static inline unsigned long
__generic_copy_to_user(void __user *to, const void *from, unsigned long n)
{
	if (access_ok(VERIFY_WRITE, to, n))
		return __copy_user(to,from,n);
	return n;
}

static inline unsigned long
__generic_copy_from_user(void *to, const void __user *from, unsigned long n)
{
	if (access_ok(VERIFY_READ, from, n))
		return __copy_user_zeroing(to,from,n);
	return n;
}

static inline unsigned long
__generic_clear_user(void __user *to, unsigned long n)
{
	if (access_ok(VERIFY_WRITE, to, n))
		return __do_clear_user(to,n);
	return n;
}

static inline long
__strncpy_from_user(char *dst, const char __user *src, long count)
{
	return __do_strncpy_from_user(dst, src, count);
}

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 = __generic_copy_from_user(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 = __generic_copy_to_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 = __generic_clear_user(to, n);

	return ret;
}


#define clear_user(to, n)			\
(__builtin_constant_p(n) ?			\
 __constant_clear_user(to, n) :			\
 __generic_clear_user(to, n))

#define copy_from_user(to, from, n)		\
(__builtin_constant_p(n) ?			\
 __constant_copy_from_user(to, from, n) :	\
 __generic_copy_from_user(to, from, n))

#define copy_to_user(to, from, n)		\
(__builtin_constant_p(n) ?			\
 __constant_copy_to_user(to, from, n) :		\
 __generic_copy_to_user(to, from, n))

/* We let the __ versions of copy_from/to_user inline, because they're often
 * used in fast paths and have only a small space overhead.
 */

static inline unsigned long
__generic_copy_from_user_nocheck(void *to, const void __user *from,
				 unsigned long n)
{
	return __copy_user_zeroing(to,from,n);
}

static inline unsigned long
__generic_copy_to_user_nocheck(void __user *to, const void *from,
			       unsigned long n)
{
	return __copy_user(to,from,n);
}

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

/* without checking */

#define __copy_to_user(to,from,n)   __generic_copy_to_user_nocheck((to),(from),(n))
#define __copy_from_user(to,from,n) __generic_copy_from_user_nocheck((to),(from),(n))
#define __copy_to_user_inatomic __copy_to_user
#define __copy_from_user_inatomic __copy_from_user
#define __clear_user(to,n) __generic_clear_user_nocheck((to),(n))

#define strlen_user(str)	strnlen_user((str), 0x7ffffffe)

#endif  /* __ASSEMBLY__ */

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