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 extern const volatile int lkpi_build_bug_on_zero;
98 #define BUILD_BUG_ON_ZERO(x) ((x) ? lkpi_build_bug_on_zero : 0)
100 #define BUG() panic("BUG at %s:%d", __FILE__, __LINE__)
101 #define BUG_ON(cond) do { \
103 panic("BUG ON %s failed at %s:%d", \
104 __stringify(cond), __FILE__, __LINE__); \
108 #define WARN_ON(cond) ({ \
109 bool __ret = (cond); \
111 printf("WARNING %s failed at %s:%d\n", \
112 __stringify(cond), __FILE__, __LINE__); \
113 linux_dump_stack(); \
118 #define WARN_ON_SMP(cond) WARN_ON(cond)
120 #define WARN_ON_ONCE(cond) ({ \
121 static bool __warn_on_once; \
122 bool __ret = (cond); \
123 if (__ret && !__warn_on_once) { \
124 __warn_on_once = 1; \
125 printf("WARNING %s failed at %s:%d\n", \
126 __stringify(cond), __FILE__, __LINE__); \
127 linux_dump_stack(); \
132 #define oops_in_progress SCHEDULER_STOPPED()
135 #define ALIGN(x, y) roundup2((x), (y))
137 #define PTR_ALIGN(p, a) ((__typeof(p))ALIGN((uintptr_t)(p), (a)))
138 #if defined(LINUXKPI_VERSION) && LINUXKPI_VERSION >= 50000
139 /* Moved from linuxkpi_gplv2 */
140 #define IS_ALIGNED(x, a) (((x) & ((__typeof(x))(a) - 1)) == 0)
142 #define DIV_ROUND_UP(x, n) howmany(x, n)
143 #define __KERNEL_DIV_ROUND_UP(x, n) howmany(x, n)
144 #define DIV_ROUND_UP_ULL(x, n) DIV_ROUND_UP((unsigned long long)(x), (n))
145 #define DIV_ROUND_DOWN_ULL(x, n) (((unsigned long long)(x) / (n)) * (n))
146 #define FIELD_SIZEOF(t, f) sizeof(((t *)0)->f)
148 #define printk(...) printf(__VA_ARGS__)
149 #define vprintk(f, a) vprintf(f, a)
153 extern void linux_dump_stack(void);
154 #define dump_stack() linux_dump_stack()
162 vscnprintf(char *buf, size_t size, const char *fmt, va_list args)
164 ssize_t ssize = size;
167 i = vsnprintf(buf, size, fmt, args);
169 return ((i >= ssize) ? (ssize - 1) : i);
173 scnprintf(char *buf, size_t size, const char *fmt, ...)
179 i = vscnprintf(buf, size, fmt, args);
186 * The "pr_debug()" and "pr_devel()" macros should produce zero code
187 * unless DEBUG is defined:
190 extern int linuxkpi_debug;
191 #define pr_debug(fmt, ...) \
193 if (linuxkpi_debug) \
194 log(LOG_DEBUG, fmt, ##__VA_ARGS__); \
196 #define pr_devel(fmt, ...) \
197 log(LOG_DEBUG, pr_fmt(fmt), ##__VA_ARGS__)
199 #define pr_debug(fmt, ...) \
200 ({ if (0) log(LOG_DEBUG, fmt, ##__VA_ARGS__); 0; })
201 #define pr_devel(fmt, ...) \
202 ({ if (0) log(LOG_DEBUG, pr_fmt(fmt), ##__VA_ARGS__); 0; })
206 #define pr_fmt(fmt) fmt
210 * Print a one-time message (analogous to WARN_ONCE() et al):
212 #define printk_once(...) do { \
213 static bool __print_once; \
215 if (!__print_once) { \
216 __print_once = true; \
217 printk(__VA_ARGS__); \
222 * Log a one-time message (analogous to WARN_ONCE() et al):
224 #define log_once(level,...) do { \
225 static bool __log_once; \
227 if (unlikely(!__log_once)) { \
229 log(level, __VA_ARGS__); \
233 #define pr_emerg(fmt, ...) \
234 log(LOG_EMERG, pr_fmt(fmt), ##__VA_ARGS__)
235 #define pr_alert(fmt, ...) \
236 log(LOG_ALERT, pr_fmt(fmt), ##__VA_ARGS__)
237 #define pr_crit(fmt, ...) \
238 log(LOG_CRIT, pr_fmt(fmt), ##__VA_ARGS__)
239 #define pr_err(fmt, ...) \
240 log(LOG_ERR, pr_fmt(fmt), ##__VA_ARGS__)
241 #define pr_warning(fmt, ...) \
242 log(LOG_WARNING, pr_fmt(fmt), ##__VA_ARGS__)
243 #define pr_warn(...) \
244 pr_warning(__VA_ARGS__)
245 #define pr_warn_once(fmt, ...) \
246 log_once(LOG_WARNING, pr_fmt(fmt), ##__VA_ARGS__)
247 #define pr_notice(fmt, ...) \
248 log(LOG_NOTICE, pr_fmt(fmt), ##__VA_ARGS__)
249 #define pr_info(fmt, ...) \
250 log(LOG_INFO, pr_fmt(fmt), ##__VA_ARGS__)
251 #define pr_info_once(fmt, ...) \
252 log_once(LOG_INFO, pr_fmt(fmt), ##__VA_ARGS__)
253 #define pr_cont(fmt, ...) \
254 printk(KERN_CONT fmt, ##__VA_ARGS__)
255 #define pr_warn_ratelimited(...) do { \
256 static linux_ratelimit_t __ratelimited; \
257 if (linux_ratelimited(&__ratelimited)) \
258 pr_warning(__VA_ARGS__); \
262 #define WARN(condition, ...) ({ \
263 bool __ret_warn_on = (condition); \
264 if (unlikely(__ret_warn_on)) \
265 pr_warning(__VA_ARGS__); \
266 unlikely(__ret_warn_on); \
271 #define WARN_ONCE(condition, ...) ({ \
272 bool __ret_warn_on = (condition); \
273 if (unlikely(__ret_warn_on)) \
274 pr_warn_once(__VA_ARGS__); \
275 unlikely(__ret_warn_on); \
279 #define container_of(ptr, type, member) \
281 const __typeof(((type *)0)->member) *__p = (ptr); \
282 (type *)((uintptr_t)__p - offsetof(type, member)); \
285 #define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0]))
287 #define u64_to_user_ptr(val) ((void *)(uintptr_t)(val))
289 static inline unsigned long long
290 simple_strtoull(const char *cp, char **endp, unsigned int base)
292 return (strtouq(cp, endp, base));
295 static inline long long
296 simple_strtoll(const char *cp, char **endp, unsigned int base)
298 return (strtoq(cp, endp, base));
301 static inline unsigned long
302 simple_strtoul(const char *cp, char **endp, unsigned int base)
304 return (strtoul(cp, endp, base));
308 simple_strtol(const char *cp, char **endp, unsigned int base)
310 return (strtol(cp, endp, base));
314 kstrtoul(const char *cp, unsigned int base, unsigned long *res)
318 *res = strtoul(cp, &end, base);
320 /* skip newline character, if any */
323 if (*cp == 0 || *end != 0)
329 kstrtol(const char *cp, unsigned int base, long *res)
333 *res = strtol(cp, &end, base);
335 /* skip newline character, if any */
338 if (*cp == 0 || *end != 0)
344 kstrtoint(const char *cp, unsigned int base, int *res)
349 *res = temp = strtol(cp, &end, base);
351 /* skip newline character, if any */
354 if (*cp == 0 || *end != 0)
356 if (temp != (int)temp)
362 kstrtouint(const char *cp, unsigned int base, unsigned int *res)
367 *res = temp = strtoul(cp, &end, base);
369 /* skip newline character, if any */
372 if (*cp == 0 || *end != 0)
374 if (temp != (unsigned int)temp)
380 kstrtou16(const char *cp, unsigned int base, u16 *res)
385 *res = temp = strtoul(cp, &end, base);
387 /* skip newline character, if any */
390 if (*cp == 0 || *end != 0)
392 if (temp != (u16)temp)
398 kstrtou32(const char *cp, unsigned int base, u32 *res)
403 *res = temp = strtoul(cp, &end, base);
405 /* skip newline character, if any */
408 if (*cp == 0 || *end != 0)
410 if (temp != (u32)temp)
416 kstrtou64(const char *cp, unsigned int base, u64 *res)
420 *res = strtouq(cp, &end, base);
422 /* skip newline character, if any */
425 if (*cp == 0 || *end != 0)
431 kstrtobool(const char *s, bool *res)
435 if (s == NULL || (len = strlen(s)) == 0 || res == NULL)
438 /* skip newline character, if any */
439 if (s[len - 1] == '\n')
442 if (len == 1 && strchr("yY1", s[0]) != NULL)
444 else if (len == 1 && strchr("nN0", s[0]) != NULL)
446 else if (strncasecmp("on", s, len) == 0)
448 else if (strncasecmp("off", s, len) == 0)
457 kstrtobool_from_user(const char __user *s, size_t count, bool *res)
461 if (count > (sizeof(buf) - 1))
462 count = (sizeof(buf) - 1);
464 if (copy_from_user(buf, s, count))
467 return (kstrtobool(buf, res));
470 #define min(x, y) ((x) < (y) ? (x) : (y))
471 #define max(x, y) ((x) > (y) ? (x) : (y))
473 #define min3(a, b, c) min(a, min(b,c))
474 #define max3(a, b, c) max(a, max(b,c))
476 #define min_t(type, x, y) ({ \
479 __min1 < __min2 ? __min1 : __min2; })
481 #define max_t(type, x, y) ({ \
484 __max1 > __max2 ? __max1 : __max2; })
486 #define offsetofend(t, m) \
487 (offsetof(t, m) + sizeof((((t *)0)->m)))
489 #define clamp_t(type, _x, min, max) min_t(type, max_t(type, _x, min), max)
490 #define clamp(x, lo, hi) min( max(x,lo), hi)
491 #define clamp_val(val, lo, hi) clamp_t(typeof(val), val, lo, hi)
494 * This looks more complex than it should be. But we need to
495 * get the type for the ~ right in round_down (it needs to be
496 * as wide as the result!), and we want to evaluate the macro
497 * arguments just once each.
499 #define __round_mask(x, y) ((__typeof__(x))((y)-1))
500 #define round_up(x, y) ((((x)-1) | __round_mask(x, y))+1)
501 #define round_down(x, y) ((x) & ~__round_mask(x, y))
503 #define smp_processor_id() PCPU_GET(cpuid)
504 #define num_possible_cpus() mp_ncpus
505 #define num_online_cpus() mp_ncpus
507 #if defined(__i386__) || defined(__amd64__)
508 extern bool linux_cpu_has_clflush;
509 #define cpu_has_clflush linux_cpu_has_clflush
512 typedef struct pm_message {
516 /* Swap values of a and b */
517 #define swap(a, b) do { \
518 typeof(a) _swap_tmp = a; \
523 #define DIV_ROUND_CLOSEST(x, divisor) (((x) + ((divisor) / 2)) / (divisor))
525 #define DIV_ROUND_CLOSEST_ULL(x, divisor) ({ \
526 __typeof(divisor) __d = (divisor); \
527 unsigned long long __ret = (x) + (__d) / 2; \
532 static inline uintmax_t
533 mult_frac(uintmax_t x, uintmax_t multiplier, uintmax_t divisor)
535 uintmax_t q = (x / divisor);
536 uintmax_t r = (x % divisor);
538 return ((q * multiplier) + ((r * multiplier) / divisor));
541 static inline int64_t
544 return (x < 0 ? -x : x);
547 typedef struct linux_ratelimit {
548 struct timeval lasttime;
553 linux_ratelimited(linux_ratelimit_t *rl)
555 return (ppsratecheck(&rl->lasttime, &rl->counter, 1));
558 #define struct_size(ptr, field, num) ({ \
559 const size_t __size = offsetof(__typeof(*(ptr)), field); \
560 const size_t __max = (SIZE_MAX - __size) / sizeof((ptr)->field[0]); \
561 ((num) > __max) ? SIZE_MAX : (__size + sizeof((ptr)->field[0]) * (num)); \
564 #define __is_constexpr(x) \
565 __builtin_constant_p(x)
568 * The is_signed() macro below returns true if the passed data type is
569 * signed. Else false is returned.
571 #define is_signed(datatype) (((datatype)-1 / (datatype)2) == (datatype)0)
574 * The type_max() macro below returns the maxium positive value the
575 * passed data type can hold.
577 #define type_max(datatype) ( \
578 (sizeof(datatype) >= 8) ? (is_signed(datatype) ? INT64_MAX : UINT64_MAX) : \
579 (sizeof(datatype) >= 4) ? (is_signed(datatype) ? INT32_MAX : UINT32_MAX) : \
580 (sizeof(datatype) >= 2) ? (is_signed(datatype) ? INT16_MAX : UINT16_MAX) : \
581 (is_signed(datatype) ? INT8_MAX : UINT8_MAX) \
585 * The type_min() macro below returns the minimum value the passed
586 * data type can hold. For unsigned types the minimum value is always
587 * zero. For signed types it may vary.
589 #define type_min(datatype) ( \
590 (sizeof(datatype) >= 8) ? (is_signed(datatype) ? INT64_MIN : 0) : \
591 (sizeof(datatype) >= 4) ? (is_signed(datatype) ? INT32_MIN : 0) : \
592 (sizeof(datatype) >= 2) ? (is_signed(datatype) ? INT16_MIN : 0) : \
593 (is_signed(datatype) ? INT8_MIN : 0) \
597 #define test_taint(x) (0)
599 #endif /* _LINUX_KERNEL_H_ */