uaccess.h revision 1.6 1 1.6 riastrad /* $NetBSD: uaccess.h,v 1.6 2021/12/19 01:39:41 riastradh Exp $ */
2 1.2 riastrad
3 1.2 riastrad /*-
4 1.2 riastrad * Copyright (c) 2013 The NetBSD Foundation, Inc.
5 1.2 riastrad * All rights reserved.
6 1.2 riastrad *
7 1.2 riastrad * This code is derived from software contributed to The NetBSD Foundation
8 1.2 riastrad * by Taylor R. Campbell.
9 1.2 riastrad *
10 1.2 riastrad * Redistribution and use in source and binary forms, with or without
11 1.2 riastrad * modification, are permitted provided that the following conditions
12 1.2 riastrad * are met:
13 1.2 riastrad * 1. Redistributions of source code must retain the above copyright
14 1.2 riastrad * notice, this list of conditions and the following disclaimer.
15 1.2 riastrad * 2. Redistributions in binary form must reproduce the above copyright
16 1.2 riastrad * notice, this list of conditions and the following disclaimer in the
17 1.2 riastrad * documentation and/or other materials provided with the distribution.
18 1.2 riastrad *
19 1.2 riastrad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.2 riastrad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.2 riastrad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.2 riastrad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.2 riastrad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.2 riastrad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.2 riastrad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.2 riastrad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.2 riastrad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.2 riastrad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.2 riastrad * POSSIBILITY OF SUCH DAMAGE.
30 1.2 riastrad */
31 1.2 riastrad
32 1.2 riastrad #ifndef _ASM_UACCESS_H_
33 1.2 riastrad #define _ASM_UACCESS_H_
34 1.2 riastrad
35 1.2 riastrad #include <sys/types.h>
36 1.3 maya #include <sys/errno.h>
37 1.2 riastrad #include <sys/systm.h>
38 1.2 riastrad
39 1.2 riastrad /* XXX This is a cop-out. */
40 1.2 riastrad #define VERIFY_READ 0
41 1.2 riastrad #define VERIFY_WRITE 1
42 1.2 riastrad static inline bool
43 1.2 riastrad access_ok(int verify_op __unused, const void *uaddr __unused,
44 1.2 riastrad size_t nbytes __unused)
45 1.2 riastrad {
46 1.2 riastrad return true;
47 1.2 riastrad }
48 1.2 riastrad
49 1.2 riastrad #define __copy_from_user copy_from_user
50 1.2 riastrad #define __copy_to_user copy_to_user
51 1.2 riastrad
52 1.2 riastrad static inline int
53 1.2 riastrad copy_from_user(void *kernel_addr, const void *user_addr, size_t len)
54 1.2 riastrad {
55 1.2 riastrad /* XXX errno NetBSD->Linux */
56 1.2 riastrad return -copyin(user_addr, kernel_addr, len);
57 1.2 riastrad }
58 1.2 riastrad
59 1.2 riastrad static inline int
60 1.2 riastrad copy_to_user(void *user_addr, const void *kernel_addr, size_t len)
61 1.2 riastrad {
62 1.2 riastrad /* XXX errno NetBSD->Linux */
63 1.2 riastrad return -copyout(kernel_addr, user_addr, len);
64 1.2 riastrad }
65 1.2 riastrad
66 1.4 riastrad #define get_user(KERNEL_LVAL, USER_PTR) \
67 1.4 riastrad copy_from_user(&(KERNEL_LVAL), (USER_PTR), sizeof(*(USER_PTR)) + \
68 1.4 riastrad 0*sizeof(&(KERNEL_LVAL) - (USER_PTR)))
69 1.4 riastrad
70 1.4 riastrad #define put_user(KERNEL_RVAL, USER_PTR) ({ \
71 1.4 riastrad const typeof(*(USER_PTR)) __put_user_tmp = (KERNEL_RVAL); \
72 1.4 riastrad copy_to_user((USER_PTR), &__put_user_tmp, sizeof(__put_user_tmp)); \
73 1.4 riastrad })
74 1.2 riastrad
75 1.6 riastrad #define __get_user get_user
76 1.6 riastrad #define __put_user put_user
77 1.6 riastrad
78 1.6 riastrad #define user_access_begin() __nothing
79 1.6 riastrad #define user_access_end() __nothing
80 1.6 riastrad
81 1.6 riastrad #define unsafe_put_user(KERNEL_RVAL, USER_PTR, LABEL) do { \
82 1.6 riastrad if (__put_user(KERNEL_RVAL, USER_PTR)) \
83 1.6 riastrad goto LABEL; \
84 1.6 riastrad } while (0)
85 1.6 riastrad
86 1.5 riastrad static inline size_t
87 1.5 riastrad clear_user(void __user *user_ptr, size_t size)
88 1.5 riastrad {
89 1.5 riastrad char __user *p = user_ptr;
90 1.5 riastrad size_t n = size;
91 1.5 riastrad
92 1.5 riastrad /*
93 1.5 riastrad * This loop which sets up a fault handler on every iteration
94 1.5 riastrad * is not going to win any speed records, but it'll do to copy
95 1.5 riastrad * out an int.
96 1.5 riastrad */
97 1.5 riastrad while (n --> 0) {
98 1.5 riastrad if (subyte(p, 0) != 0)
99 1.5 riastrad return ++n;
100 1.5 riastrad }
101 1.5 riastrad
102 1.5 riastrad return 0;
103 1.5 riastrad }
104 1.5 riastrad
105 1.2 riastrad #if 0
106 1.2 riastrad /*
107 1.2 riastrad * XXX These `inatomic' versions are a cop out, but they should do for
108 1.2 riastrad * now -- they are used only in fast paths which can't fault but which
109 1.2 riastrad * can fall back to slower paths that arrange things so faulting is OK.
110 1.2 riastrad */
111 1.2 riastrad
112 1.2 riastrad static inline int
113 1.2 riastrad __copy_from_user_inatomic(void *kernel_addr __unused,
114 1.2 riastrad const void *user_addr __unused, size_t len __unused)
115 1.2 riastrad {
116 1.2 riastrad return -EFAULT;
117 1.2 riastrad }
118 1.2 riastrad
119 1.2 riastrad static inline int
120 1.2 riastrad __copy_to_user_inatomic(void *user_addr __unused,
121 1.2 riastrad const void *kernel_addr __unused, size_t len __unused)
122 1.2 riastrad {
123 1.2 riastrad return -EFAULT;
124 1.2 riastrad }
125 1.2 riastrad #endif /* 0 */
126 1.2 riastrad
127 1.2 riastrad static inline int
128 1.2 riastrad __copy_from_user_inatomic_nocache(void *kernel_addr __unused,
129 1.2 riastrad const void *user_addr __unused, size_t len __unused)
130 1.2 riastrad {
131 1.2 riastrad return -EFAULT;
132 1.2 riastrad }
133 1.2 riastrad
134 1.2 riastrad #endif /* _ASM_UACCESS_H_ */
135