Many source files in the tree are missing licensing information, which makes it harder for compliance tools to determine the correct license. By default all files without license information are under the default license of the kernel, which is GPL version 2. Update the files which contain no license information with the 'GPL-2.0' SPDX license identifier. The SPDX identifier is a legally binding shorthand, which can be used instead of the full boiler plate text. This patch is based on work done by Thomas Gleixner and Kate Stewart and Philippe Ombredanne. How this work was done: Patches were generated and checked against linux-4.14-rc6 for a subset of the use cases: - file had no licensing information it it. - file was a */uapi/* one with no licensing information in it, - file was a */uapi/* one with existing licensing information, Further patches will be generated in subsequent months to fix up cases where non-standard license headers were used, and references to license had to be inferred by heuristics based on keywords. The analysis to determine which SPDX License Identifier to be applied to a file was done in a spreadsheet of side by side results from of the output of two independent scanners (ScanCode & Windriver) producing SPDX tag:value files created by Philippe Ombredanne. Philippe prepared the base worksheet, and did an initial spot review of a few 1000 files. The 4.13 kernel was the starting point of the analysis with 60,537 files assessed. Kate Stewart did a file by file comparison of the scanner results in the spreadsheet to determine which SPDX license identifier(s) to be applied to the file. She confirmed any determination that was not immediately clear with lawyers working with the Linux Foundation. Criteria used to select files for SPDX license identifier tagging was: - Files considered eligible had to be source code files. - Make and config files were included as candidates if they contained >5 lines of source - File already had some variant of a license header in it (even if <5 lines). All documentation files were explicitly excluded. The following heuristics were used to determine which SPDX license identifiers to apply. - when both scanners couldn't find any license traces, file was considered to have no license information in it, and the top level COPYING file license applied. For non */uapi/* files that summary was: SPDX license identifier # files ---------------------------------------------------|------- GPL-2.0 11139 and resulted in the first patch in this series. If that file was a */uapi/* path one, it was "GPL-2.0 WITH Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was: SPDX license identifier # files ---------------------------------------------------|------- GPL-2.0 WITH Linux-syscall-note 930 and resulted in the second patch in this series. - if a file had some form of licensing information in it, and was one of the */uapi/* ones, it was denoted with the Linux-syscall-note if any GPL family license was found in the file or had no licensing in it (per prior point). Results summary: SPDX license identifier # files ---------------------------------------------------|------ GPL-2.0 WITH Linux-syscall-note 270 GPL-2.0+ WITH Linux-syscall-note 169 ((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21 ((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17 LGPL-2.1+ WITH Linux-syscall-note 15 GPL-1.0+ WITH Linux-syscall-note 14 ((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5 LGPL-2.0+ WITH Linux-syscall-note 4 LGPL-2.1 WITH Linux-syscall-note 3 ((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3 ((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1 and that resulted in the third patch in this series. - when the two scanners agreed on the detected license(s), that became the concluded license(s). - when there was disagreement between the two scanners (one detected a license but the other didn't, or they both detected different licenses) a manual inspection of the file occurred. - In most cases a manual inspection of the information in the file resulted in a clear resolution of the license that should apply (and which scanner probably needed to revisit its heuristics). - When it was not immediately clear, the license identifier was confirmed with lawyers working with the Linux Foundation. - If there was any question as to the appropriate license identifier, the file was flagged for further research and to be revisited later in time. In total, over 70 hours of logged manual review was done on the spreadsheet to determine the SPDX license identifiers to apply to the source files by Kate, Philippe, Thomas and, in some cases, confirmation by lawyers working with the Linux Foundation. Kate also obtained a third independent scan of the 4.13 code base from FOSSology, and compared selected files where the other two scanners disagreed against that SPDX file, to see if there was new insights. The Windriver scanner is based on an older version of FOSSology in part, so they are related. Thomas did random spot checks in about 500 files from the spreadsheets for the uapi headers and agreed with SPDX license identifier in the files he inspected. For the non-uapi files Thomas did random spot checks in about 15000 files. In initial set of patches against 4.14-rc6, 3 files were found to have copy/paste license identifier errors, and have been fixed to reflect the correct identifier. Additionally Philippe spent 10 hours this week doing a detailed manual inspection and review of the 12,461 patched files from the initial patch version early this week with: - a full scancode scan run, collecting the matched texts, detected license ids and scores - reviewing anything where there was a license detected (about 500+ files) to ensure that the applied SPDX license was correct - reviewing anything where there was no detection but the patch license was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied SPDX license was correct This produced a worksheet with 20 files needing minor correction. This worksheet was then exported into 3 different .csv files for the different types of files to be modified. These .csv files were then reviewed by Greg. Thomas wrote a script to parse the csv files and add the proper SPDX tag to the file, in the format that the file expected. This script was further refined by Greg based on the output to detect more types of files automatically and to distinguish between header and source .c files (which need different comment types.) Finally Greg ran the script using the .csv files to generate the patches. Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org> Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com> Reviewed-by: Thomas Gleixner <tglx@linutronix.de> Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
516 lines
15 KiB
C
516 lines
15 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef _ASM_M32R_UACCESS_H
|
|
#define _ASM_M32R_UACCESS_H
|
|
|
|
/*
|
|
* linux/include/asm-m32r/uaccess.h
|
|
*
|
|
* M32R version.
|
|
* Copyright (C) 2004, 2006 Hirokazu Takata <takata at linux-m32r.org>
|
|
*/
|
|
|
|
/*
|
|
* User space memory access functions
|
|
*/
|
|
#include <asm/page.h>
|
|
#include <asm/setup.h>
|
|
#include <linux/prefetch.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) })
|
|
|
|
#ifdef CONFIG_MMU
|
|
|
|
#define KERNEL_DS MAKE_MM_SEG(0xFFFFFFFF)
|
|
#define USER_DS MAKE_MM_SEG(PAGE_OFFSET)
|
|
#define get_ds() (KERNEL_DS)
|
|
#define get_fs() (current_thread_info()->addr_limit)
|
|
#define set_fs(x) (current_thread_info()->addr_limit = (x))
|
|
|
|
#else /* not CONFIG_MMU */
|
|
|
|
#define KERNEL_DS MAKE_MM_SEG(0xFFFFFFFF)
|
|
#define USER_DS MAKE_MM_SEG(0xFFFFFFFF)
|
|
#define get_ds() (KERNEL_DS)
|
|
|
|
static inline mm_segment_t get_fs(void)
|
|
{
|
|
return USER_DS;
|
|
}
|
|
|
|
static inline void set_fs(mm_segment_t s)
|
|
{
|
|
}
|
|
|
|
#endif /* not CONFIG_MMU */
|
|
|
|
#define segment_eq(a, b) ((a).seg == (b).seg)
|
|
|
|
#define __addr_ok(addr) \
|
|
((unsigned long)(addr) < (current_thread_info()->addr_limit.seg))
|
|
|
|
/*
|
|
* Test whether a block of memory is a valid user space address.
|
|
* Returns 0 if the range is valid, nonzero otherwise.
|
|
*
|
|
* This is equivalent to the following test:
|
|
* (u33)addr + (u33)size >= (u33)current->addr_limit.seg
|
|
*
|
|
* This needs 33-bit arithmetic. We have a carry...
|
|
*/
|
|
#define __range_ok(addr, size) ({ \
|
|
unsigned long flag, roksum; \
|
|
__chk_user_ptr(addr); \
|
|
asm ( \
|
|
" cmpu %1, %1 ; clear cbit\n" \
|
|
" addx %1, %3 ; set cbit if overflow\n" \
|
|
" subx %0, %0\n" \
|
|
" cmpu %4, %1\n" \
|
|
" subx %0, %5\n" \
|
|
: "=&r" (flag), "=r" (roksum) \
|
|
: "1" (addr), "r" ((int)(size)), \
|
|
"r" (current_thread_info()->addr_limit.seg), "r" (0) \
|
|
: "cbit" ); \
|
|
flag; })
|
|
|
|
/**
|
|
* access_ok: - Checks if a user space pointer is valid
|
|
* @type: Type of access: %VERIFY_READ or %VERIFY_WRITE. Note that
|
|
* %VERIFY_WRITE is a superset of %VERIFY_READ - if it is safe
|
|
* to write to a block, it is always safe to read from it.
|
|
* @addr: User space pointer to start of block to check
|
|
* @size: Size of block to check
|
|
*
|
|
* Context: User context only. This function may sleep if pagefaults are
|
|
* enabled.
|
|
*
|
|
* Checks if a pointer to a block of memory in user space is valid.
|
|
*
|
|
* Returns true (nonzero) if the memory block may be valid, false (zero)
|
|
* if it is definitely invalid.
|
|
*
|
|
* Note that, depending on architecture, this function probably just
|
|
* checks that the pointer is in the user space range - after calling
|
|
* this function, memory access functions may still return -EFAULT.
|
|
*/
|
|
#ifdef CONFIG_MMU
|
|
#define access_ok(type, addr, size) (likely(__range_ok(addr, size) == 0))
|
|
#else
|
|
static inline int access_ok(int type, const void *addr, unsigned long size)
|
|
{
|
|
unsigned long val = (unsigned long)addr;
|
|
|
|
return ((val >= memory_start) && ((val + size) < memory_end));
|
|
}
|
|
#endif /* CONFIG_MMU */
|
|
|
|
#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 uglyness 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).
|
|
*/
|
|
|
|
/* Careful: we have to cast the result to the type of the pointer for sign
|
|
reasons */
|
|
/**
|
|
* get_user: - Get a simple variable from user space.
|
|
* @x: Variable to store result.
|
|
* @ptr: Source address, in user space.
|
|
*
|
|
* Context: User context only. This function may sleep if pagefaults are
|
|
* enabled.
|
|
*
|
|
* This macro copies a single simple variable from user space to kernel
|
|
* space. It supports simple types like char and int, but not larger
|
|
* data types like structures or arrays.
|
|
*
|
|
* @ptr must have pointer-to-simple-variable type, and the result of
|
|
* dereferencing @ptr must be assignable to @x without a cast.
|
|
*
|
|
* Returns zero on success, or -EFAULT on error.
|
|
* On error, the variable @x is set to zero.
|
|
*/
|
|
#define get_user(x, ptr) \
|
|
__get_user_check((x), (ptr), sizeof(*(ptr)))
|
|
|
|
/**
|
|
* put_user: - Write a simple value into user space.
|
|
* @x: Value to copy to user space.
|
|
* @ptr: Destination address, in user space.
|
|
*
|
|
* Context: User context only. This function may sleep if pagefaults are
|
|
* enabled.
|
|
*
|
|
* This macro copies a single simple value from kernel space to user
|
|
* space. It supports simple types like char and int, but not larger
|
|
* data types like structures or arrays.
|
|
*
|
|
* @ptr must have pointer-to-simple-variable type, and @x must be assignable
|
|
* to the result of dereferencing @ptr.
|
|
*
|
|
* Returns zero on success, or -EFAULT on error.
|
|
*/
|
|
#define put_user(x, ptr) \
|
|
__put_user_check((__typeof__(*(ptr)))(x), (ptr), sizeof(*(ptr)))
|
|
|
|
/**
|
|
* __get_user: - Get a simple variable from user space, with less checking.
|
|
* @x: Variable to store result.
|
|
* @ptr: Source address, in user space.
|
|
*
|
|
* Context: User context only. This function may sleep if pagefaults are
|
|
* enabled.
|
|
*
|
|
* This macro copies a single simple variable from user space to kernel
|
|
* space. It supports simple types like char and int, but not larger
|
|
* data types like structures or arrays.
|
|
*
|
|
* @ptr must have pointer-to-simple-variable type, and the result of
|
|
* dereferencing @ptr must be assignable to @x without a cast.
|
|
*
|
|
* Caller must check the pointer with access_ok() before calling this
|
|
* function.
|
|
*
|
|
* Returns zero on success, or -EFAULT on error.
|
|
* On error, the variable @x is set to zero.
|
|
*/
|
|
#define __get_user(x, ptr) \
|
|
__get_user_nocheck((x), (ptr), sizeof(*(ptr)))
|
|
|
|
#define __get_user_nocheck(x, ptr, size) \
|
|
({ \
|
|
long __gu_err = 0; \
|
|
unsigned long __gu_val = 0; \
|
|
might_fault(); \
|
|
__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; \
|
|
unsigned long __gu_val = 0; \
|
|
const __typeof__(*(ptr)) __user *__gu_addr = (ptr); \
|
|
might_fault(); \
|
|
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);
|
|
|
|
#define __get_user_size(x, ptr, size, retval) \
|
|
do { \
|
|
retval = 0; \
|
|
__chk_user_ptr(ptr); \
|
|
switch (size) { \
|
|
case 1: __get_user_asm(x, ptr, retval, "ub"); break; \
|
|
case 2: __get_user_asm(x, ptr, retval, "uh"); break; \
|
|
case 4: __get_user_asm(x, ptr, retval, ""); break; \
|
|
default: (x) = __get_user_bad(); \
|
|
} \
|
|
} while (0)
|
|
|
|
#define __get_user_asm(x, addr, err, itype) \
|
|
__asm__ __volatile__( \
|
|
" .fillinsn\n" \
|
|
"1: ld"itype" %1,@%2\n" \
|
|
" .fillinsn\n" \
|
|
"2:\n" \
|
|
".section .fixup,\"ax\"\n" \
|
|
" .balign 4\n" \
|
|
"3: ldi %0,%3\n" \
|
|
" seth r14,#high(2b)\n" \
|
|
" or3 r14,r14,#low(2b)\n" \
|
|
" jmp r14\n" \
|
|
".previous\n" \
|
|
".section __ex_table,\"a\"\n" \
|
|
" .balign 4\n" \
|
|
" .long 1b,3b\n" \
|
|
".previous" \
|
|
: "=&r" (err), "=&r" (x) \
|
|
: "r" (addr), "i" (-EFAULT), "0" (err) \
|
|
: "r14", "memory")
|
|
|
|
/**
|
|
* __put_user: - Write a simple value into user space, with less checking.
|
|
* @x: Value to copy to user space.
|
|
* @ptr: Destination address, in user space.
|
|
*
|
|
* Context: User context only. This function may sleep if pagefaults are
|
|
* enabled.
|
|
*
|
|
* This macro copies a single simple value from kernel space to user
|
|
* space. It supports simple types like char and int, but not larger
|
|
* data types like structures or arrays.
|
|
*
|
|
* @ptr must have pointer-to-simple-variable type, and @x must be assignable
|
|
* to the result of dereferencing @ptr.
|
|
*
|
|
* Caller must check the pointer with access_ok() before calling this
|
|
* function.
|
|
*
|
|
* Returns zero on success, or -EFAULT on error.
|
|
*/
|
|
#define __put_user(x, ptr) \
|
|
__put_user_nocheck((__typeof__(*(ptr)))(x), (ptr), sizeof(*(ptr)))
|
|
|
|
|
|
#define __put_user_nocheck(x, ptr, size) \
|
|
({ \
|
|
long __pu_err; \
|
|
might_fault(); \
|
|
__put_user_size((x), (ptr), (size), __pu_err); \
|
|
__pu_err; \
|
|
})
|
|
|
|
|
|
#define __put_user_check(x, ptr, size) \
|
|
({ \
|
|
long __pu_err = -EFAULT; \
|
|
__typeof__(*(ptr)) __user *__pu_addr = (ptr); \
|
|
might_fault(); \
|
|
if (access_ok(VERIFY_WRITE, __pu_addr, size)) \
|
|
__put_user_size((x), __pu_addr, (size), __pu_err); \
|
|
__pu_err; \
|
|
})
|
|
|
|
#if defined(__LITTLE_ENDIAN__)
|
|
#define __put_user_u64(x, addr, err) \
|
|
__asm__ __volatile__( \
|
|
" .fillinsn\n" \
|
|
"1: st %L1,@%2\n" \
|
|
" .fillinsn\n" \
|
|
"2: st %H1,@(4,%2)\n" \
|
|
" .fillinsn\n" \
|
|
"3:\n" \
|
|
".section .fixup,\"ax\"\n" \
|
|
" .balign 4\n" \
|
|
"4: ldi %0,%3\n" \
|
|
" seth r14,#high(3b)\n" \
|
|
" or3 r14,r14,#low(3b)\n" \
|
|
" jmp r14\n" \
|
|
".previous\n" \
|
|
".section __ex_table,\"a\"\n" \
|
|
" .balign 4\n" \
|
|
" .long 1b,4b\n" \
|
|
" .long 2b,4b\n" \
|
|
".previous" \
|
|
: "=&r" (err) \
|
|
: "r" (x), "r" (addr), "i" (-EFAULT), "0" (err) \
|
|
: "r14", "memory")
|
|
|
|
#elif defined(__BIG_ENDIAN__)
|
|
#define __put_user_u64(x, addr, err) \
|
|
__asm__ __volatile__( \
|
|
" .fillinsn\n" \
|
|
"1: st %H1,@%2\n" \
|
|
" .fillinsn\n" \
|
|
"2: st %L1,@(4,%2)\n" \
|
|
" .fillinsn\n" \
|
|
"3:\n" \
|
|
".section .fixup,\"ax\"\n" \
|
|
" .balign 4\n" \
|
|
"4: ldi %0,%3\n" \
|
|
" seth r14,#high(3b)\n" \
|
|
" or3 r14,r14,#low(3b)\n" \
|
|
" jmp r14\n" \
|
|
".previous\n" \
|
|
".section __ex_table,\"a\"\n" \
|
|
" .balign 4\n" \
|
|
" .long 1b,4b\n" \
|
|
" .long 2b,4b\n" \
|
|
".previous" \
|
|
: "=&r" (err) \
|
|
: "r" (x), "r" (addr), "i" (-EFAULT), "0" (err) \
|
|
: "r14", "memory")
|
|
#else
|
|
#error no endian defined
|
|
#endif
|
|
|
|
extern void __put_user_bad(void);
|
|
|
|
#define __put_user_size(x, ptr, size, retval) \
|
|
do { \
|
|
retval = 0; \
|
|
__chk_user_ptr(ptr); \
|
|
switch (size) { \
|
|
case 1: __put_user_asm(x, ptr, retval, "b"); break; \
|
|
case 2: __put_user_asm(x, ptr, retval, "h"); break; \
|
|
case 4: __put_user_asm(x, ptr, retval, ""); break; \
|
|
case 8: __put_user_u64((__typeof__(*ptr))(x), ptr, retval); break;\
|
|
default: __put_user_bad(); \
|
|
} \
|
|
} while (0)
|
|
|
|
struct __large_struct { unsigned long buf[100]; };
|
|
#define __m(x) (*(struct __large_struct *)(x))
|
|
|
|
/*
|
|
* Tell gcc we read from memory instead of writing: this is because
|
|
* we do not write to any memory gcc knows about, so there are no
|
|
* aliasing issues.
|
|
*/
|
|
#define __put_user_asm(x, addr, err, itype) \
|
|
__asm__ __volatile__( \
|
|
" .fillinsn\n" \
|
|
"1: st"itype" %1,@%2\n" \
|
|
" .fillinsn\n" \
|
|
"2:\n" \
|
|
".section .fixup,\"ax\"\n" \
|
|
" .balign 4\n" \
|
|
"3: ldi %0,%3\n" \
|
|
" seth r14,#high(2b)\n" \
|
|
" or3 r14,r14,#low(2b)\n" \
|
|
" jmp r14\n" \
|
|
".previous\n" \
|
|
".section __ex_table,\"a\"\n" \
|
|
" .balign 4\n" \
|
|
" .long 1b,3b\n" \
|
|
".previous" \
|
|
: "=&r" (err) \
|
|
: "r" (x), "r" (addr), "i" (-EFAULT), "0" (err) \
|
|
: "r14", "memory")
|
|
|
|
/*
|
|
* Here we special-case 1, 2 and 4-byte copy_*_user invocations. On a fault
|
|
* we return the initial request size (1, 2 or 4), as copy_*_user should do.
|
|
* If a store crosses a page boundary and gets a fault, the m32r will not write
|
|
* anything, so this is accurate.
|
|
*/
|
|
|
|
/*
|
|
* Copy To/From Userspace
|
|
*/
|
|
|
|
/* Generic arbitrary sized copy. */
|
|
/* Return the number of bytes NOT copied. */
|
|
#define __copy_user(to, from, size) \
|
|
do { \
|
|
unsigned long __dst, __src, __c; \
|
|
__asm__ __volatile__ ( \
|
|
" mv r14, %0\n" \
|
|
" or r14, %1\n" \
|
|
" beq %0, %1, 9f\n" \
|
|
" beqz %2, 9f\n" \
|
|
" and3 r14, r14, #3\n" \
|
|
" bnez r14, 2f\n" \
|
|
" and3 %2, %2, #3\n" \
|
|
" beqz %3, 2f\n" \
|
|
" addi %0, #-4 ; word_copy \n" \
|
|
" .fillinsn\n" \
|
|
"0: ld r14, @%1+\n" \
|
|
" addi %3, #-1\n" \
|
|
" .fillinsn\n" \
|
|
"1: st r14, @+%0\n" \
|
|
" bnez %3, 0b\n" \
|
|
" beqz %2, 9f\n" \
|
|
" addi %0, #4\n" \
|
|
" .fillinsn\n" \
|
|
"2: ldb r14, @%1 ; byte_copy \n" \
|
|
" .fillinsn\n" \
|
|
"3: stb r14, @%0\n" \
|
|
" addi %1, #1\n" \
|
|
" addi %2, #-1\n" \
|
|
" addi %0, #1\n" \
|
|
" bnez %2, 2b\n" \
|
|
" .fillinsn\n" \
|
|
"9:\n" \
|
|
".section .fixup,\"ax\"\n" \
|
|
" .balign 4\n" \
|
|
"5: addi %3, #1\n" \
|
|
" addi %1, #-4\n" \
|
|
" .fillinsn\n" \
|
|
"6: slli %3, #2\n" \
|
|
" add %2, %3\n" \
|
|
" addi %0, #4\n" \
|
|
" .fillinsn\n" \
|
|
"7: seth r14, #high(9b)\n" \
|
|
" or3 r14, r14, #low(9b)\n" \
|
|
" jmp r14\n" \
|
|
".previous\n" \
|
|
".section __ex_table,\"a\"\n" \
|
|
" .balign 4\n" \
|
|
" .long 0b,6b\n" \
|
|
" .long 1b,5b\n" \
|
|
" .long 2b,9b\n" \
|
|
" .long 3b,9b\n" \
|
|
".previous\n" \
|
|
: "=&r" (__dst), "=&r" (__src), "=&r" (size), \
|
|
"=&r" (__c) \
|
|
: "0" (to), "1" (from), "2" (size), "3" (size / 4) \
|
|
: "r14", "memory"); \
|
|
} while (0)
|
|
|
|
/* 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
|
|
raw_copy_from_user(void *to, const void __user *from, unsigned long n)
|
|
{
|
|
prefetchw(to);
|
|
__copy_user(to, from, n);
|
|
return n;
|
|
}
|
|
|
|
static inline unsigned long
|
|
raw_copy_to_user(void __user *to, const void *from, unsigned long n)
|
|
{
|
|
prefetch(from);
|
|
__copy_user(to, from, n);
|
|
return n;
|
|
}
|
|
|
|
long __must_check strncpy_from_user(char *dst, const char __user *src,
|
|
long count);
|
|
|
|
/**
|
|
* __clear_user: - Zero a block of memory in user space, with less checking.
|
|
* @to: Destination address, in user space.
|
|
* @n: Number of bytes to zero.
|
|
*
|
|
* Zero a block of memory in user space. Caller must check
|
|
* the specified block with access_ok() before calling this function.
|
|
*
|
|
* Returns number of bytes that could not be cleared.
|
|
* On success, this will be zero.
|
|
*/
|
|
unsigned long __clear_user(void __user *mem, unsigned long len);
|
|
|
|
/**
|
|
* clear_user: - Zero a block of memory in user space.
|
|
* @to: Destination address, in user space.
|
|
* @n: Number of bytes to zero.
|
|
*
|
|
* Zero a block of memory in user space. Caller must check
|
|
* the specified block with access_ok() before calling this function.
|
|
*
|
|
* Returns number of bytes that could not be cleared.
|
|
* On success, this will be zero.
|
|
*/
|
|
unsigned long clear_user(void __user *mem, unsigned long len);
|
|
|
|
long strnlen_user(const char __user *str, long n);
|
|
|
|
#endif /* _ASM_M32R_UACCESS_H */
|