kernel.h revision 1.20 1 1.10 riastrad /* $NetBSD: kernel.h,v 1.20 2018/08/27 13:37:55 riastradh Exp $ */
2 1.1 skrll
3 1.1 skrll /*-
4 1.1 skrll * Copyright (c) 2013 The NetBSD Foundation, Inc.
5 1.1 skrll * All rights reserved.
6 1.1 skrll *
7 1.1 skrll * This code is derived from software contributed to The NetBSD Foundation
8 1.1 skrll * by Taylor R. Campbell.
9 1.1 skrll *
10 1.1 skrll * Redistribution and use in source and binary forms, with or without
11 1.1 skrll * modification, are permitted provided that the following conditions
12 1.1 skrll * are met:
13 1.1 skrll * 1. Redistributions of source code must retain the above copyright
14 1.1 skrll * notice, this list of conditions and the following disclaimer.
15 1.1 skrll * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 skrll * notice, this list of conditions and the following disclaimer in the
17 1.1 skrll * documentation and/or other materials provided with the distribution.
18 1.1 skrll *
19 1.1 skrll * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1 skrll * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1 skrll * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1 skrll * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1 skrll * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1 skrll * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1 skrll * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1 skrll * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1 skrll * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1 skrll * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1 skrll * POSSIBILITY OF SUCH DAMAGE.
30 1.1 skrll */
31 1.1 skrll
32 1.1 skrll #ifndef _LINUX_KERNEL_H_
33 1.1 skrll #define _LINUX_KERNEL_H_
34 1.1 skrll
35 1.1 skrll #include <sys/cdefs.h>
36 1.1 skrll #include <sys/types.h>
37 1.1 skrll #include <sys/param.h>
38 1.3 riastrad #include <sys/systm.h>
39 1.3 riastrad
40 1.7 riastrad #include <lib/libkern/libkern.h>
41 1.13 riastrad #include <linux/bitops.h>
42 1.10 riastrad #include <linux/printk.h>
43 1.14 riastrad #include <linux/slab.h>
44 1.7 riastrad
45 1.12 riastrad #define U16_MAX UINT16_MAX
46 1.12 riastrad #define U32_MAX UINT32_MAX
47 1.12 riastrad #define U64_MAX UINT64_MAX
48 1.12 riastrad
49 1.3 riastrad #define oops_in_progress (panicstr != NULL)
50 1.3 riastrad
51 1.8 skrll #define IS_ENABLED(option) (option)
52 1.11 riastrad #define IS_BUILTIN(option) (1) /* Probably... */
53 1.1 skrll
54 1.1 skrll #define __printf __printflike
55 1.1 skrll #define __user
56 1.1 skrll #define __must_check /* __attribute__((warn_unused_result)), if GCC */
57 1.1 skrll #define __always_unused __unused
58 1.18 riastrad #define noinline __noinline
59 1.1 skrll
60 1.1 skrll #define barrier() __insn_barrier()
61 1.3 riastrad #define likely(X) __predict_true(X)
62 1.1 skrll #define unlikely(X) __predict_false(X)
63 1.1 skrll
64 1.2 riastrad /*
65 1.2 riastrad * XXX Linux kludge to work around GCC uninitialized variable warning.
66 1.2 riastrad * Linux does `x = x', which is bollocks.
67 1.2 riastrad */
68 1.2 riastrad #define uninitialized_var(x) x = 0
69 1.1 skrll
70 1.1 skrll /* XXX These will multiply evaluate their arguments. */
71 1.9 riastrad #define min(X, Y) MIN(X, Y)
72 1.9 riastrad #define max(X, Y) MAX(X, Y)
73 1.9 riastrad
74 1.1 skrll #define max_t(T, X, Y) MAX(X, Y)
75 1.1 skrll #define min_t(T, X, Y) MIN(X, Y)
76 1.1 skrll
77 1.3 riastrad #define clamp_t(T, X, MIN, MAX) min_t(T, max_t(T, X, MIN), MAX)
78 1.6 riastrad #define clamp(X, MN, MX) MIN(MAX(X, MN), MX)
79 1.3 riastrad
80 1.16 riastrad #define min3(X, Y, Z) MIN(X, MIN(Y, Z))
81 1.16 riastrad #define max3(X, Y, Z) MAX(X, MAX(Y, Z))
82 1.16 riastrad
83 1.1 skrll /*
84 1.2 riastrad * Rounding to nearest.
85 1.2 riastrad */
86 1.2 riastrad #define DIV_ROUND_CLOSEST(N, D) \
87 1.2 riastrad ((0 < (N)) ? (((N) + ((D) / 2)) / (D)) \
88 1.2 riastrad : (((N) - ((D) / 2)) / (D)))
89 1.2 riastrad
90 1.17 riastrad #define DIV_ROUND_CLOSEST_ULL(N, D) (((N) + (D)/2)/(D))
91 1.17 riastrad
92 1.2 riastrad /*
93 1.1 skrll * Rounding to what may or may not be powers of two.
94 1.1 skrll */
95 1.1 skrll #define DIV_ROUND_UP(X, N) (((X) + (N) - 1) / (N))
96 1.3 riastrad #define DIV_ROUND_UP_ULL(X, N) DIV_ROUND_UP((unsigned long long)(X), (N))
97 1.1 skrll
98 1.1 skrll /*
99 1.1 skrll * Rounding to powers of two -- carefully avoiding multiple evaluation
100 1.1 skrll * of arguments and pitfalls with C integer arithmetic rules.
101 1.1 skrll */
102 1.1 skrll #define round_up(X, N) ((((X) - 1) | ((N) - 1)) + 1)
103 1.1 skrll #define round_down(X, N) ((X) & ~(uintmax_t)((N) - 1))
104 1.1 skrll
105 1.4 riastrad #define IS_ALIGNED(X, N) (((X) & ((N) - 1)) == 0)
106 1.4 riastrad
107 1.1 skrll /*
108 1.1 skrll * These select 32-bit halves of what may be 32- or 64-bit quantities,
109 1.1 skrll * for which straight 32-bit shifts may be undefined behaviour (and do
110 1.1 skrll * the wrong thing on most machines: return the input unshifted by
111 1.1 skrll * ignoring the upper bits of the shift count).
112 1.1 skrll */
113 1.1 skrll #define upper_32_bits(X) ((uint32_t) (((X) >> 16) >> 16))
114 1.1 skrll #define lower_32_bits(X) ((uint32_t) ((X) & 0xffffffffUL))
115 1.1 skrll
116 1.1 skrll #define ARRAY_SIZE(ARRAY) __arraycount(ARRAY)
117 1.1 skrll
118 1.1 skrll #define swap(X, Y) do \
119 1.1 skrll { \
120 1.1 skrll /* XXX Kludge for type-safety. */ \
121 1.1 skrll if (&(X) != &(Y)) { \
122 1.1 skrll CTASSERT(sizeof(X) == sizeof(Y)); \
123 1.1 skrll /* XXX Can't do this much better without typeof. */ \
124 1.1 skrll char __swap_tmp[sizeof(X)]; \
125 1.1 skrll (void)memcpy(__swap_tmp, &(X), sizeof(X)); \
126 1.1 skrll (void)memcpy(&(X), &(Y), sizeof(X)); \
127 1.1 skrll (void)memcpy(&(Y), __swap_tmp, sizeof(X)); \
128 1.1 skrll } \
129 1.1 skrll } while (0)
130 1.1 skrll
131 1.19 riastrad #define ACCESS_ONCE(X) ({ \
132 1.19 riastrad typeof(X) __access_once_tmp = (X); \
133 1.19 riastrad __insn_barrier(); \
134 1.19 riastrad __access_once_tmp; \
135 1.19 riastrad })
136 1.19 riastrad
137 1.1 skrll static inline int64_t
138 1.1 skrll abs64(int64_t x)
139 1.1 skrll {
140 1.1 skrll return (x < 0? (-x) : x);
141 1.1 skrll }
142 1.1 skrll
143 1.3 riastrad static inline uintmax_t
144 1.3 riastrad mult_frac(uintmax_t x, uintmax_t multiplier, uintmax_t divisor)
145 1.3 riastrad {
146 1.3 riastrad uintmax_t q = (x / divisor);
147 1.3 riastrad uintmax_t r = (x % divisor);
148 1.3 riastrad
149 1.3 riastrad return ((q * multiplier) + ((r * multiplier) / divisor));
150 1.3 riastrad }
151 1.3 riastrad
152 1.2 riastrad static int panic_timeout __unused = 0;
153 1.2 riastrad
154 1.3 riastrad static inline int
155 1.3 riastrad vscnprintf(char *buf, size_t size, const char *fmt, va_list va)
156 1.3 riastrad {
157 1.3 riastrad int ret;
158 1.3 riastrad
159 1.3 riastrad ret = vsnprintf(buf, size, fmt, va);
160 1.3 riastrad if (__predict_false(ret < 0))
161 1.3 riastrad return ret;
162 1.3 riastrad if (__predict_false(size == 0))
163 1.3 riastrad return 0;
164 1.3 riastrad if (__predict_false(size <= ret))
165 1.3 riastrad return (size - 1);
166 1.3 riastrad
167 1.3 riastrad return ret;
168 1.3 riastrad }
169 1.3 riastrad
170 1.3 riastrad static inline int
171 1.3 riastrad scnprintf(char *buf, size_t size, const char *fmt, ...)
172 1.3 riastrad {
173 1.3 riastrad va_list va;
174 1.3 riastrad int ret;
175 1.3 riastrad
176 1.3 riastrad va_start(va, fmt);
177 1.3 riastrad ret = vscnprintf(buf, size, fmt, va);
178 1.3 riastrad va_end(va);
179 1.3 riastrad
180 1.3 riastrad return ret;
181 1.3 riastrad }
182 1.3 riastrad
183 1.5 riastrad static inline int
184 1.5 riastrad kstrtol(const char *s, unsigned base, long *vp)
185 1.5 riastrad {
186 1.5 riastrad long long v;
187 1.5 riastrad
188 1.5 riastrad v = strtoll(s, NULL, base);
189 1.5 riastrad if (v < LONG_MIN || LONG_MAX < v)
190 1.5 riastrad return -ERANGE;
191 1.5 riastrad *vp = v;
192 1.5 riastrad return 0;
193 1.5 riastrad }
194 1.5 riastrad
195 1.15 riastrad static inline char *
196 1.15 riastrad kvasprintf(gfp_t gfp, const char *fmt, va_list va)
197 1.14 riastrad {
198 1.20 riastrad va_list tva;
199 1.14 riastrad char *str;
200 1.14 riastrad int len, len1 __diagused;
201 1.14 riastrad
202 1.20 riastrad va_copy(tva, va);
203 1.20 riastrad len = vsnprintf(NULL, 0, fmt, tva);
204 1.20 riastrad va_end(tva);
205 1.14 riastrad str = kmalloc(len + 1, gfp);
206 1.14 riastrad if (str == NULL)
207 1.14 riastrad return NULL;
208 1.15 riastrad len1 = vsnprintf(str, len + 1, fmt, va);
209 1.15 riastrad KASSERT(len1 == len);
210 1.15 riastrad
211 1.15 riastrad return str;
212 1.15 riastrad }
213 1.15 riastrad
214 1.15 riastrad static inline char * __printflike(2,3)
215 1.15 riastrad kasprintf(gfp_t gfp, const char *fmt, ...)
216 1.15 riastrad {
217 1.15 riastrad va_list va;
218 1.15 riastrad char *str;
219 1.14 riastrad
220 1.14 riastrad va_start(va, fmt);
221 1.15 riastrad str = kvasprintf(gfp, fmt, va);
222 1.14 riastrad va_end(va);
223 1.14 riastrad
224 1.14 riastrad return str;
225 1.14 riastrad }
226 1.14 riastrad
227 1.1 skrll #endif /* _LINUX_KERNEL_H_ */
228