2 * Copyright (c) 2010 Isilon Systems, Inc.
3 * Copyright (c) 2010 iX Systems, Inc.
4 * Copyright (c) 2010 Panasas, Inc.
5 * Copyright (c) 2013-2016 Mellanox Technologies, Ltd.
6 * Copyright (c) 2014-2015 François Tigeot
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice unmodified, this list of conditions, and the following
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
22 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
23 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
24 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
28 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 #ifndef _LINUX_KERNEL_H_
33 #define _LINUX_KERNEL_H_
35 #include <sys/cdefs.h>
36 #include <sys/types.h>
37 #include <sys/systm.h>
38 #include <sys/param.h>
39 #include <sys/libkern.h>
42 #include <sys/stddef.h>
43 #include <sys/syslog.h>
46 #include <linux/bitops.h>
47 #include <linux/compiler.h>
48 #include <linux/errno.h>
49 #include <linux/sched.h>
50 #include <linux/types.h>
51 #include <linux/jiffies.h>
52 #include <linux/log2.h>
54 #include <asm/byteorder.h>
55 #include <asm/uaccess.h>
57 #include <machine/stdarg.h>
60 #define KERN_EMERG "<0>"
61 #define KERN_ALERT "<1>"
62 #define KERN_CRIT "<2>"
63 #define KERN_ERR "<3>"
64 #define KERN_WARNING "<4>"
65 #define KERN_NOTICE "<5>"
66 #define KERN_INFO "<6>"
67 #define KERN_DEBUG "<7>"
69 #define U8_MAX ((u8)~0U)
70 #define S8_MAX ((s8)(U8_MAX >> 1))
71 #define S8_MIN ((s8)(-S8_MAX - 1))
72 #define U16_MAX ((u16)~0U)
73 #define S16_MAX ((s16)(U16_MAX >> 1))
74 #define S16_MIN ((s16)(-S16_MAX - 1))
75 #define U32_MAX ((u32)~0U)
76 #define S32_MAX ((s32)(U32_MAX >> 1))
77 #define S32_MIN ((s32)(-S32_MAX - 1))
78 #define U64_MAX ((u64)~0ULL)
79 #define S64_MAX ((s64)(U64_MAX >> 1))
80 #define S64_MIN ((s64)(-S64_MAX - 1))
83 #define U8_C(x) x ## U
85 #define U16_C(x) x ## U
87 #define U32_C(x) x ## U
88 #define S64_C(x) x ## LL
89 #define U64_C(x) x ## ULL
91 #define BUILD_BUG() do { CTASSERT(0); } while (0)
92 #define BUILD_BUG_ON(x) CTASSERT(!(x))
93 #define BUILD_BUG_ON_MSG(x, msg) BUILD_BUG_ON(x)
94 #define BUILD_BUG_ON_NOT_POWER_OF_2(x) BUILD_BUG_ON(!powerof2(x))
95 #define BUILD_BUG_ON_INVALID(expr) while (0) { (void)(expr); }
97 #define BUG() panic("BUG at %s:%d", __FILE__, __LINE__)
98 #define BUG_ON(cond) do { \
100 panic("BUG ON %s failed at %s:%d", \
101 __stringify(cond), __FILE__, __LINE__); \
105 #define WARN_ON(cond) ({ \
106 bool __ret = (cond); \
108 printf("WARNING %s failed at %s:%d\n", \
109 __stringify(cond), __FILE__, __LINE__); \
110 linux_dump_stack(); \
115 #define WARN_ON_SMP(cond) WARN_ON(cond)
117 #define WARN_ON_ONCE(cond) ({ \
118 static bool __warn_on_once; \
119 bool __ret = (cond); \
120 if (__ret && !__warn_on_once) { \
121 __warn_on_once = 1; \
122 printf("WARNING %s failed at %s:%d\n", \
123 __stringify(cond), __FILE__, __LINE__); \
124 linux_dump_stack(); \
129 #define oops_in_progress SCHEDULER_STOPPED()
132 #define ALIGN(x, y) roundup2((x), (y))
134 #define PTR_ALIGN(p, a) ((__typeof(p))ALIGN((uintptr_t)(p), (a)))
135 #if defined(LINUXKPI_VERSION) && LINUXKPI_VERSION >= 50000
136 /* Moved from linuxkpi_gplv2 */
137 #define IS_ALIGNED(x, a) (((x) & ((__typeof(x))(a) - 1)) == 0)
139 #define DIV_ROUND_UP(x, n) howmany(x, n)
140 #define __KERNEL_DIV_ROUND_UP(x, n) howmany(x, n)
141 #define DIV_ROUND_UP_ULL(x, n) DIV_ROUND_UP((unsigned long long)(x), (n))
142 #define DIV_ROUND_DOWN_ULL(x, n) (((unsigned long long)(x) / (n)) * (n))
143 #define FIELD_SIZEOF(t, f) sizeof(((t *)0)->f)
145 #define printk(...) printf(__VA_ARGS__)
146 #define vprintk(f, a) vprintf(f, a)
150 extern void linux_dump_stack(void);
151 #define dump_stack() linux_dump_stack()
159 vscnprintf(char *buf, size_t size, const char *fmt, va_list args)
161 ssize_t ssize = size;
164 i = vsnprintf(buf, size, fmt, args);
166 return ((i >= ssize) ? (ssize - 1) : i);
170 scnprintf(char *buf, size_t size, const char *fmt, ...)
176 i = vscnprintf(buf, size, fmt, args);
183 * The "pr_debug()" and "pr_devel()" macros should produce zero code
184 * unless DEBUG is defined:
187 extern int linuxkpi_debug;
188 #define pr_debug(fmt, ...) \
190 if (linuxkpi_debug) \
191 log(LOG_DEBUG, fmt, ##__VA_ARGS__); \
193 #define pr_devel(fmt, ...) \
194 log(LOG_DEBUG, pr_fmt(fmt), ##__VA_ARGS__)
196 #define pr_debug(fmt, ...) \
197 ({ if (0) log(LOG_DEBUG, fmt, ##__VA_ARGS__); 0; })
198 #define pr_devel(fmt, ...) \
199 ({ if (0) log(LOG_DEBUG, pr_fmt(fmt), ##__VA_ARGS__); 0; })
203 #define pr_fmt(fmt) fmt
207 * Print a one-time message (analogous to WARN_ONCE() et al):
209 #define printk_once(...) do { \
210 static bool __print_once; \
212 if (!__print_once) { \
213 __print_once = true; \
214 printk(__VA_ARGS__); \
219 * Log a one-time message (analogous to WARN_ONCE() et al):
221 #define log_once(level,...) do { \
222 static bool __log_once; \
224 if (unlikely(!__log_once)) { \
226 log(level, __VA_ARGS__); \
230 #define pr_emerg(fmt, ...) \
231 log(LOG_EMERG, pr_fmt(fmt), ##__VA_ARGS__)
232 #define pr_alert(fmt, ...) \
233 log(LOG_ALERT, pr_fmt(fmt), ##__VA_ARGS__)
234 #define pr_crit(fmt, ...) \
235 log(LOG_CRIT, pr_fmt(fmt), ##__VA_ARGS__)
236 #define pr_err(fmt, ...) \
237 log(LOG_ERR, pr_fmt(fmt), ##__VA_ARGS__)
238 #define pr_warning(fmt, ...) \
239 log(LOG_WARNING, pr_fmt(fmt), ##__VA_ARGS__)
240 #define pr_warn(...) \
241 pr_warning(__VA_ARGS__)
242 #define pr_warn_once(fmt, ...) \
243 log_once(LOG_WARNING, pr_fmt(fmt), ##__VA_ARGS__)
244 #define pr_notice(fmt, ...) \
245 log(LOG_NOTICE, pr_fmt(fmt), ##__VA_ARGS__)
246 #define pr_info(fmt, ...) \
247 log(LOG_INFO, pr_fmt(fmt), ##__VA_ARGS__)
248 #define pr_info_once(fmt, ...) \
249 log_once(LOG_INFO, pr_fmt(fmt), ##__VA_ARGS__)
250 #define pr_cont(fmt, ...) \
251 printk(KERN_CONT fmt, ##__VA_ARGS__)
252 #define pr_warn_ratelimited(...) do { \
253 static linux_ratelimit_t __ratelimited; \
254 if (linux_ratelimited(&__ratelimited)) \
255 pr_warning(__VA_ARGS__); \
259 #define WARN(condition, ...) ({ \
260 bool __ret_warn_on = (condition); \
261 if (unlikely(__ret_warn_on)) \
262 pr_warning(__VA_ARGS__); \
263 unlikely(__ret_warn_on); \
268 #define WARN_ONCE(condition, ...) ({ \
269 bool __ret_warn_on = (condition); \
270 if (unlikely(__ret_warn_on)) \
271 pr_warn_once(__VA_ARGS__); \
272 unlikely(__ret_warn_on); \
276 #define container_of(ptr, type, member) \
278 const __typeof(((type *)0)->member) *__p = (ptr); \
279 (type *)((uintptr_t)__p - offsetof(type, member)); \
282 #define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0]))
284 #define u64_to_user_ptr(val) ((void *)(uintptr_t)(val))
286 static inline unsigned long long
287 simple_strtoull(const char *cp, char **endp, unsigned int base)
289 return (strtouq(cp, endp, base));
292 static inline long long
293 simple_strtoll(const char *cp, char **endp, unsigned int base)
295 return (strtoq(cp, endp, base));
298 static inline unsigned long
299 simple_strtoul(const char *cp, char **endp, unsigned int base)
301 return (strtoul(cp, endp, base));
305 simple_strtol(const char *cp, char **endp, unsigned int base)
307 return (strtol(cp, endp, base));
311 kstrtoul(const char *cp, unsigned int base, unsigned long *res)
315 *res = strtoul(cp, &end, base);
317 /* skip newline character, if any */
320 if (*cp == 0 || *end != 0)
326 kstrtol(const char *cp, unsigned int base, long *res)
330 *res = strtol(cp, &end, base);
332 /* skip newline character, if any */
335 if (*cp == 0 || *end != 0)
341 kstrtoint(const char *cp, unsigned int base, int *res)
346 *res = temp = strtol(cp, &end, base);
348 /* skip newline character, if any */
351 if (*cp == 0 || *end != 0)
353 if (temp != (int)temp)
359 kstrtouint(const char *cp, unsigned int base, unsigned int *res)
364 *res = temp = strtoul(cp, &end, base);
366 /* skip newline character, if any */
369 if (*cp == 0 || *end != 0)
371 if (temp != (unsigned int)temp)
377 kstrtou32(const char *cp, unsigned int base, u32 *res)
382 *res = temp = strtoul(cp, &end, base);
384 /* skip newline character, if any */
387 if (*cp == 0 || *end != 0)
389 if (temp != (u32)temp)
395 kstrtou64(const char *cp, unsigned int base, u64 *res)
399 *res = strtouq(cp, &end, base);
401 /* skip newline character, if any */
404 if (*cp == 0 || *end != 0)
410 kstrtobool(const char *s, bool *res)
414 if (s == NULL || (len = strlen(s)) == 0 || res == NULL)
417 /* skip newline character, if any */
418 if (s[len - 1] == '\n')
421 if (len == 1 && strchr("yY1", s[0]) != NULL)
423 else if (len == 1 && strchr("nN0", s[0]) != NULL)
425 else if (strncasecmp("on", s, len) == 0)
427 else if (strncasecmp("off", s, len) == 0)
436 kstrtobool_from_user(const char __user *s, size_t count, bool *res)
440 if (count > (sizeof(buf) - 1))
441 count = (sizeof(buf) - 1);
443 if (copy_from_user(buf, s, count))
446 return (kstrtobool(buf, res));
449 #define min(x, y) ((x) < (y) ? (x) : (y))
450 #define max(x, y) ((x) > (y) ? (x) : (y))
452 #define min3(a, b, c) min(a, min(b,c))
453 #define max3(a, b, c) max(a, max(b,c))
455 #define min_t(type, x, y) ({ \
458 __min1 < __min2 ? __min1 : __min2; })
460 #define max_t(type, x, y) ({ \
463 __max1 > __max2 ? __max1 : __max2; })
465 #define offsetofend(t, m) \
466 (offsetof(t, m) + sizeof((((t *)0)->m)))
468 #define clamp_t(type, _x, min, max) min_t(type, max_t(type, _x, min), max)
469 #define clamp(x, lo, hi) min( max(x,lo), hi)
470 #define clamp_val(val, lo, hi) clamp_t(typeof(val), val, lo, hi)
473 * This looks more complex than it should be. But we need to
474 * get the type for the ~ right in round_down (it needs to be
475 * as wide as the result!), and we want to evaluate the macro
476 * arguments just once each.
478 #define __round_mask(x, y) ((__typeof__(x))((y)-1))
479 #define round_up(x, y) ((((x)-1) | __round_mask(x, y))+1)
480 #define round_down(x, y) ((x) & ~__round_mask(x, y))
482 #define smp_processor_id() PCPU_GET(cpuid)
483 #define num_possible_cpus() mp_ncpus
484 #define num_online_cpus() mp_ncpus
486 #if defined(__i386__) || defined(__amd64__)
487 extern bool linux_cpu_has_clflush;
488 #define cpu_has_clflush linux_cpu_has_clflush
491 typedef struct pm_message {
495 /* Swap values of a and b */
496 #define swap(a, b) do { \
497 typeof(a) _swap_tmp = a; \
502 #define DIV_ROUND_CLOSEST(x, divisor) (((x) + ((divisor) / 2)) / (divisor))
504 #define DIV_ROUND_CLOSEST_ULL(x, divisor) ({ \
505 __typeof(divisor) __d = (divisor); \
506 unsigned long long __ret = (x) + (__d) / 2; \
511 static inline uintmax_t
512 mult_frac(uintmax_t x, uintmax_t multiplier, uintmax_t divisor)
514 uintmax_t q = (x / divisor);
515 uintmax_t r = (x % divisor);
517 return ((q * multiplier) + ((r * multiplier) / divisor));
520 static inline int64_t
523 return (x < 0 ? -x : x);
526 typedef struct linux_ratelimit {
527 struct timeval lasttime;
532 linux_ratelimited(linux_ratelimit_t *rl)
534 return (ppsratecheck(&rl->lasttime, &rl->counter, 1));
537 #endif /* _LINUX_KERNEL_H_ */