18d59ecb2SHans Petter Selasky /*- 28d59ecb2SHans Petter Selasky * Copyright (c) 2010 Isilon Systems, Inc. 38d59ecb2SHans Petter Selasky * Copyright (c) 2010 iX Systems, Inc. 48d59ecb2SHans Petter Selasky * Copyright (c) 2010 Panasas, Inc. 5fe68f570SHans Petter Selasky * Copyright (c) 2013-2016 Mellanox Technologies, Ltd. 68d59ecb2SHans Petter Selasky * Copyright (c) 2014-2015 François Tigeot 78d59ecb2SHans Petter Selasky * All rights reserved. 88d59ecb2SHans Petter Selasky * 98d59ecb2SHans Petter Selasky * Redistribution and use in source and binary forms, with or without 108d59ecb2SHans Petter Selasky * modification, are permitted provided that the following conditions 118d59ecb2SHans Petter Selasky * are met: 128d59ecb2SHans Petter Selasky * 1. Redistributions of source code must retain the above copyright 138d59ecb2SHans Petter Selasky * notice unmodified, this list of conditions, and the following 148d59ecb2SHans Petter Selasky * disclaimer. 158d59ecb2SHans Petter Selasky * 2. Redistributions in binary form must reproduce the above copyright 168d59ecb2SHans Petter Selasky * notice, this list of conditions and the following disclaimer in the 178d59ecb2SHans Petter Selasky * documentation and/or other materials provided with the distribution. 188d59ecb2SHans Petter Selasky * 198d59ecb2SHans Petter Selasky * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 208d59ecb2SHans Petter Selasky * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 218d59ecb2SHans Petter Selasky * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 228d59ecb2SHans Petter Selasky * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 238d59ecb2SHans Petter Selasky * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 248d59ecb2SHans Petter Selasky * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 258d59ecb2SHans Petter Selasky * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 268d59ecb2SHans Petter Selasky * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 278d59ecb2SHans Petter Selasky * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 288d59ecb2SHans Petter Selasky * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 298d59ecb2SHans Petter Selasky * 308d59ecb2SHans Petter Selasky * $FreeBSD$ 318d59ecb2SHans Petter Selasky */ 328d59ecb2SHans Petter Selasky #ifndef _LINUX_KERNEL_H_ 338d59ecb2SHans Petter Selasky #define _LINUX_KERNEL_H_ 348d59ecb2SHans Petter Selasky 358d59ecb2SHans Petter Selasky #include <sys/cdefs.h> 368d59ecb2SHans Petter Selasky #include <sys/types.h> 378d59ecb2SHans Petter Selasky #include <sys/systm.h> 388d59ecb2SHans Petter Selasky #include <sys/param.h> 398d59ecb2SHans Petter Selasky #include <sys/libkern.h> 408d59ecb2SHans Petter Selasky #include <sys/stat.h> 418d59ecb2SHans Petter Selasky #include <sys/smp.h> 428d59ecb2SHans Petter Selasky #include <sys/stddef.h> 438d59ecb2SHans Petter Selasky #include <sys/syslog.h> 448d59ecb2SHans Petter Selasky 458d59ecb2SHans Petter Selasky #include <linux/bitops.h> 468d59ecb2SHans Petter Selasky #include <linux/compiler.h> 478d59ecb2SHans Petter Selasky #include <linux/errno.h> 488d59ecb2SHans Petter Selasky #include <linux/kthread.h> 498d59ecb2SHans Petter Selasky #include <linux/types.h> 508d59ecb2SHans Petter Selasky #include <linux/jiffies.h> 518d59ecb2SHans Petter Selasky #include <linux/wait.h> 528d59ecb2SHans Petter Selasky #include <linux/log2.h> 538d59ecb2SHans Petter Selasky #include <asm/byteorder.h> 548d59ecb2SHans Petter Selasky 558d59ecb2SHans Petter Selasky #define KERN_CONT "" 568d59ecb2SHans Petter Selasky #define KERN_EMERG "<0>" 578d59ecb2SHans Petter Selasky #define KERN_ALERT "<1>" 588d59ecb2SHans Petter Selasky #define KERN_CRIT "<2>" 598d59ecb2SHans Petter Selasky #define KERN_ERR "<3>" 608d59ecb2SHans Petter Selasky #define KERN_WARNING "<4>" 618d59ecb2SHans Petter Selasky #define KERN_NOTICE "<5>" 628d59ecb2SHans Petter Selasky #define KERN_INFO "<6>" 638d59ecb2SHans Petter Selasky #define KERN_DEBUG "<7>" 648d59ecb2SHans Petter Selasky 65*abb14a54SHans Petter Selasky #define U8_MAX ((u8)~0U) 66*abb14a54SHans Petter Selasky #define S8_MAX ((s8)(U8_MAX >> 1)) 67*abb14a54SHans Petter Selasky #define S8_MIN ((s8)(-S8_MAX - 1)) 68*abb14a54SHans Petter Selasky #define U16_MAX ((u16)~0U) 69*abb14a54SHans Petter Selasky #define S16_MAX ((s16)(U16_MAX >> 1)) 70*abb14a54SHans Petter Selasky #define S16_MIN ((s16)(-S16_MAX - 1)) 71*abb14a54SHans Petter Selasky #define U32_MAX ((u32)~0U) 72*abb14a54SHans Petter Selasky #define S32_MAX ((s32)(U32_MAX >> 1)) 73*abb14a54SHans Petter Selasky #define S32_MIN ((s32)(-S32_MAX - 1)) 74*abb14a54SHans Petter Selasky #define U64_MAX ((u64)~0ULL) 75*abb14a54SHans Petter Selasky #define S64_MAX ((s64)(U64_MAX >> 1)) 76*abb14a54SHans Petter Selasky #define S64_MIN ((s64)(-S64_MAX - 1)) 77*abb14a54SHans Petter Selasky 78*abb14a54SHans Petter Selasky #define S8_C(x) x 79*abb14a54SHans Petter Selasky #define U8_C(x) x ## U 80*abb14a54SHans Petter Selasky #define S16_C(x) x 81*abb14a54SHans Petter Selasky #define U16_C(x) x ## U 82*abb14a54SHans Petter Selasky #define S32_C(x) x 83*abb14a54SHans Petter Selasky #define U32_C(x) x ## U 84*abb14a54SHans Petter Selasky #define S64_C(x) x ## LL 85*abb14a54SHans Petter Selasky #define U64_C(x) x ## ULL 86*abb14a54SHans Petter Selasky 878d59ecb2SHans Petter Selasky #define BUILD_BUG_ON(x) CTASSERT(!(x)) 888d59ecb2SHans Petter Selasky 89*abb14a54SHans Petter Selasky #define BUG() panic("BUG at %s:%d", __FILE__, __LINE__) 90*abb14a54SHans Petter Selasky #define BUG_ON(cond) do { \ 91*abb14a54SHans Petter Selasky if (cond) { \ 92*abb14a54SHans Petter Selasky panic("BUG ON %s failed at %s:%d", \ 93*abb14a54SHans Petter Selasky __stringify(cond), __FILE__, __LINE__); \ 94*abb14a54SHans Petter Selasky } \ 95*abb14a54SHans Petter Selasky } while (0) 96*abb14a54SHans Petter Selasky 97*abb14a54SHans Petter Selasky #define WARN_ON(cond) ({ \ 98*abb14a54SHans Petter Selasky bool __ret = (cond); \ 99*abb14a54SHans Petter Selasky if (__ret) { \ 100*abb14a54SHans Petter Selasky printf("WARNING %s failed at %s:%d\n", \ 101*abb14a54SHans Petter Selasky __stringify(cond), __FILE__, __LINE__); \ 102*abb14a54SHans Petter Selasky } \ 103*abb14a54SHans Petter Selasky unlikely(__ret); \ 104*abb14a54SHans Petter Selasky }) 105*abb14a54SHans Petter Selasky 106*abb14a54SHans Petter Selasky #define WARN_ON_SMP(cond) WARN_ON(cond) 107*abb14a54SHans Petter Selasky 108*abb14a54SHans Petter Selasky #define WARN_ON_ONCE(cond) ({ \ 109*abb14a54SHans Petter Selasky static bool __warn_on_once; \ 110*abb14a54SHans Petter Selasky bool __ret = (cond); \ 111*abb14a54SHans Petter Selasky if (__ret && !__warn_on_once) { \ 112*abb14a54SHans Petter Selasky __warn_on_once = 1; \ 113*abb14a54SHans Petter Selasky printf("WARNING %s failed at %s:%d\n", \ 114*abb14a54SHans Petter Selasky __stringify(cond), __FILE__, __LINE__); \ 115*abb14a54SHans Petter Selasky } \ 116*abb14a54SHans Petter Selasky unlikely(__ret); \ 117*abb14a54SHans Petter Selasky }) 1188d59ecb2SHans Petter Selasky 1198d59ecb2SHans Petter Selasky #undef ALIGN 1208d59ecb2SHans Petter Selasky #define ALIGN(x, y) roundup2((x), (y)) 1218d59ecb2SHans Petter Selasky #undef PTR_ALIGN 1228d59ecb2SHans Petter Selasky #define PTR_ALIGN(p, a) ((__typeof(p))ALIGN((uintptr_t)(p), (a))) 1238d59ecb2SHans Petter Selasky #define DIV_ROUND_UP(x, n) howmany(x, n) 1248d59ecb2SHans Petter Selasky #define DIV_ROUND_UP_ULL(x, n) DIV_ROUND_UP((unsigned long long)(x), (n)) 1258d59ecb2SHans Petter Selasky #define FIELD_SIZEOF(t, f) sizeof(((t *)0)->f) 1268d59ecb2SHans Petter Selasky 1278d59ecb2SHans Petter Selasky #define printk(X...) printf(X) 1288d59ecb2SHans Petter Selasky 1298d59ecb2SHans Petter Selasky /* 1308d59ecb2SHans Petter Selasky * The "pr_debug()" and "pr_devel()" macros should produce zero code 1318d59ecb2SHans Petter Selasky * unless DEBUG is defined: 1328d59ecb2SHans Petter Selasky */ 1338d59ecb2SHans Petter Selasky #ifdef DEBUG 1348d59ecb2SHans Petter Selasky #define pr_debug(fmt, ...) \ 1358d59ecb2SHans Petter Selasky log(LOG_DEBUG, fmt, ##__VA_ARGS__) 1368d59ecb2SHans Petter Selasky #define pr_devel(fmt, ...) \ 1378d59ecb2SHans Petter Selasky log(LOG_DEBUG, pr_fmt(fmt), ##__VA_ARGS__) 1388d59ecb2SHans Petter Selasky #else 1398d59ecb2SHans Petter Selasky #define pr_debug(fmt, ...) \ 1408d59ecb2SHans Petter Selasky ({ if (0) log(LOG_DEBUG, fmt, ##__VA_ARGS__); 0; }) 1418d59ecb2SHans Petter Selasky #define pr_devel(fmt, ...) \ 1428d59ecb2SHans Petter Selasky ({ if (0) log(LOG_DEBUG, pr_fmt(fmt), ##__VA_ARGS__); 0; }) 1438d59ecb2SHans Petter Selasky #endif 1448d59ecb2SHans Petter Selasky 1458d59ecb2SHans Petter Selasky #ifndef pr_fmt 1468d59ecb2SHans Petter Selasky #define pr_fmt(fmt) fmt 1478d59ecb2SHans Petter Selasky #endif 1488d59ecb2SHans Petter Selasky 1498d59ecb2SHans Petter Selasky /* 1508d59ecb2SHans Petter Selasky * Print a one-time message (analogous to WARN_ONCE() et al): 1518d59ecb2SHans Petter Selasky */ 1528d59ecb2SHans Petter Selasky #define printk_once(...) do { \ 1538d59ecb2SHans Petter Selasky static bool __print_once; \ 1548d59ecb2SHans Petter Selasky \ 1558d59ecb2SHans Petter Selasky if (!__print_once) { \ 1568d59ecb2SHans Petter Selasky __print_once = true; \ 1578d59ecb2SHans Petter Selasky printk(__VA_ARGS__); \ 1588d59ecb2SHans Petter Selasky } \ 1598d59ecb2SHans Petter Selasky } while (0) 1608d59ecb2SHans Petter Selasky 1618d59ecb2SHans Petter Selasky /* 1628d59ecb2SHans Petter Selasky * Log a one-time message (analogous to WARN_ONCE() et al): 1638d59ecb2SHans Petter Selasky */ 1648d59ecb2SHans Petter Selasky #define log_once(level,...) do { \ 1658d59ecb2SHans Petter Selasky static bool __log_once; \ 1668d59ecb2SHans Petter Selasky \ 167*abb14a54SHans Petter Selasky if (unlikely(!__log_once)) { \ 1688d59ecb2SHans Petter Selasky __log_once = true; \ 1698d59ecb2SHans Petter Selasky log(level, __VA_ARGS__); \ 1708d59ecb2SHans Petter Selasky } \ 1718d59ecb2SHans Petter Selasky } while (0) 1728d59ecb2SHans Petter Selasky 1738d59ecb2SHans Petter Selasky #define pr_emerg(fmt, ...) \ 1748d59ecb2SHans Petter Selasky log(LOG_EMERG, pr_fmt(fmt), ##__VA_ARGS__) 1758d59ecb2SHans Petter Selasky #define pr_alert(fmt, ...) \ 1768d59ecb2SHans Petter Selasky log(LOG_ALERT, pr_fmt(fmt), ##__VA_ARGS__) 1778d59ecb2SHans Petter Selasky #define pr_crit(fmt, ...) \ 1788d59ecb2SHans Petter Selasky log(LOG_CRIT, pr_fmt(fmt), ##__VA_ARGS__) 1798d59ecb2SHans Petter Selasky #define pr_err(fmt, ...) \ 1808d59ecb2SHans Petter Selasky log(LOG_ERR, pr_fmt(fmt), ##__VA_ARGS__) 1818d59ecb2SHans Petter Selasky #define pr_warning(fmt, ...) \ 1828d59ecb2SHans Petter Selasky log(LOG_WARNING, pr_fmt(fmt), ##__VA_ARGS__) 183*abb14a54SHans Petter Selasky #define pr_warn(...) \ 184*abb14a54SHans Petter Selasky pr_warning(__VA_ARGS__) 185*abb14a54SHans Petter Selasky #define pr_warn_once(fmt, ...) \ 186*abb14a54SHans Petter Selasky log_once(LOG_WARNING, pr_fmt(fmt), ##__VA_ARGS__) 1878d59ecb2SHans Petter Selasky #define pr_notice(fmt, ...) \ 1888d59ecb2SHans Petter Selasky log(LOG_NOTICE, pr_fmt(fmt), ##__VA_ARGS__) 1898d59ecb2SHans Petter Selasky #define pr_info(fmt, ...) \ 1908d59ecb2SHans Petter Selasky log(LOG_INFO, pr_fmt(fmt), ##__VA_ARGS__) 1918d59ecb2SHans Petter Selasky #define pr_info_once(fmt, ...) \ 1928d59ecb2SHans Petter Selasky log_once(LOG_INFO, pr_fmt(fmt), ##__VA_ARGS__) 1938d59ecb2SHans Petter Selasky #define pr_cont(fmt, ...) \ 1948d59ecb2SHans Petter Selasky printk(KERN_CONT fmt, ##__VA_ARGS__) 1958d59ecb2SHans Petter Selasky 1968d59ecb2SHans Petter Selasky #ifndef WARN 197*abb14a54SHans Petter Selasky #define WARN(condition, ...) ({ \ 198*abb14a54SHans Petter Selasky bool __ret_warn_on = (condition); \ 1998d59ecb2SHans Petter Selasky if (unlikely(__ret_warn_on)) \ 200*abb14a54SHans Petter Selasky pr_warning(__VA_ARGS__); \ 201*abb14a54SHans Petter Selasky unlikely(__ret_warn_on); \ 202*abb14a54SHans Petter Selasky }) 203*abb14a54SHans Petter Selasky #endif 204*abb14a54SHans Petter Selasky 205*abb14a54SHans Petter Selasky #ifndef WARN_ONCE 206*abb14a54SHans Petter Selasky #define WARN_ONCE(condition, ...) ({ \ 207*abb14a54SHans Petter Selasky bool __ret_warn_on = (condition); \ 208*abb14a54SHans Petter Selasky if (unlikely(__ret_warn_on)) \ 209*abb14a54SHans Petter Selasky pr_warn_once(__VA_ARGS__); \ 2108d59ecb2SHans Petter Selasky unlikely(__ret_warn_on); \ 2118d59ecb2SHans Petter Selasky }) 2128d59ecb2SHans Petter Selasky #endif 2138d59ecb2SHans Petter Selasky 2148d59ecb2SHans Petter Selasky #define container_of(ptr, type, member) \ 2158d59ecb2SHans Petter Selasky ({ \ 2168d59ecb2SHans Petter Selasky __typeof(((type *)0)->member) *_p = (ptr); \ 2178d59ecb2SHans Petter Selasky (type *)((char *)_p - offsetof(type, member)); \ 2188d59ecb2SHans Petter Selasky }) 2198d59ecb2SHans Petter Selasky 2208d59ecb2SHans Petter Selasky #define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0])) 2218d59ecb2SHans Petter Selasky 222fe68f570SHans Petter Selasky #define simple_strtoul(...) strtoul(__VA_ARGS__) 223fe68f570SHans Petter Selasky #define simple_strtol(...) strtol(__VA_ARGS__) 224fe68f570SHans Petter Selasky #define kstrtol(a,b,c) ({*(c) = strtol(a,0,b); 0;}) 225fe68f570SHans Petter Selasky #define kstrtoint(a,b,c) ({*(c) = strtol(a,0,b); 0;}) 226510ebed7SHans Petter Selasky #define kstrtouint(a,b,c) ({*(c) = strtol(a,0,b); 0;}) 2278d59ecb2SHans Petter Selasky 2288d59ecb2SHans Petter Selasky #define min(x, y) ((x) < (y) ? (x) : (y)) 2298d59ecb2SHans Petter Selasky #define max(x, y) ((x) > (y) ? (x) : (y)) 2308d59ecb2SHans Petter Selasky 2318d59ecb2SHans Petter Selasky #define min3(a, b, c) min(a, min(b,c)) 2328d59ecb2SHans Petter Selasky #define max3(a, b, c) max(a, max(b,c)) 2338d59ecb2SHans Petter Selasky 234*abb14a54SHans Petter Selasky #define min_t(type, x, y) ({ \ 235*abb14a54SHans Petter Selasky type __min1 = (x); \ 236*abb14a54SHans Petter Selasky type __min2 = (y); \ 237*abb14a54SHans Petter Selasky __min1 < __min2 ? __min1 : __min2; }) 238*abb14a54SHans Petter Selasky 239*abb14a54SHans Petter Selasky #define max_t(type, x, y) ({ \ 240*abb14a54SHans Petter Selasky type __max1 = (x); \ 241*abb14a54SHans Petter Selasky type __max2 = (y); \ 242*abb14a54SHans Petter Selasky __max1 > __max2 ? __max1 : __max2; }) 2438d59ecb2SHans Petter Selasky 2448d59ecb2SHans Petter Selasky #define clamp_t(type, _x, min, max) min_t(type, max_t(type, _x, min), max) 2458d59ecb2SHans Petter Selasky #define clamp(x, lo, hi) min( max(x,lo), hi) 246*abb14a54SHans Petter Selasky #define clamp_val(val, lo, hi) clamp_t(typeof(val), val, lo, hi) 2478d59ecb2SHans Petter Selasky 2488d59ecb2SHans Petter Selasky /* 2498d59ecb2SHans Petter Selasky * This looks more complex than it should be. But we need to 2508d59ecb2SHans Petter Selasky * get the type for the ~ right in round_down (it needs to be 2518d59ecb2SHans Petter Selasky * as wide as the result!), and we want to evaluate the macro 2528d59ecb2SHans Petter Selasky * arguments just once each. 2538d59ecb2SHans Petter Selasky */ 2548d59ecb2SHans Petter Selasky #define __round_mask(x, y) ((__typeof__(x))((y)-1)) 2558d59ecb2SHans Petter Selasky #define round_up(x, y) ((((x)-1) | __round_mask(x, y))+1) 2568d59ecb2SHans Petter Selasky #define round_down(x, y) ((x) & ~__round_mask(x, y)) 2578d59ecb2SHans Petter Selasky 258fe68f570SHans Petter Selasky #define smp_processor_id() PCPU_GET(cpuid) 2598d59ecb2SHans Petter Selasky #define num_possible_cpus() mp_ncpus 2608d59ecb2SHans Petter Selasky #define num_online_cpus() mp_ncpus 261*abb14a54SHans Petter Selasky #define cpu_has_clflush (1) 2628d59ecb2SHans Petter Selasky 2638d59ecb2SHans Petter Selasky typedef struct pm_message { 2648d59ecb2SHans Petter Selasky int event; 2658d59ecb2SHans Petter Selasky } pm_message_t; 2668d59ecb2SHans Petter Selasky 2678d59ecb2SHans Petter Selasky /* Swap values of a and b */ 2688d59ecb2SHans Petter Selasky #define swap(a, b) do { \ 2698d59ecb2SHans Petter Selasky typeof(a) _swap_tmp = a; \ 2708d59ecb2SHans Petter Selasky a = b; \ 2718d59ecb2SHans Petter Selasky b = _swap_tmp; \ 2728d59ecb2SHans Petter Selasky } while (0) 2738d59ecb2SHans Petter Selasky 2748d59ecb2SHans Petter Selasky #define DIV_ROUND_CLOSEST(x, divisor) (((x) + ((divisor) / 2)) / (divisor)) 2758d59ecb2SHans Petter Selasky 276*abb14a54SHans Petter Selasky #define DIV_ROUND_CLOSEST_ULL(x, divisor) ({ \ 277*abb14a54SHans Petter Selasky __typeof(divisor) __d = (divisor); \ 278*abb14a54SHans Petter Selasky unsigned long long __ret = (x) + (__d) / 2; \ 279*abb14a54SHans Petter Selasky __ret /= __d; \ 280*abb14a54SHans Petter Selasky __ret; \ 281*abb14a54SHans Petter Selasky }) 282*abb14a54SHans Petter Selasky 2838d59ecb2SHans Petter Selasky static inline uintmax_t 2848d59ecb2SHans Petter Selasky mult_frac(uintmax_t x, uintmax_t multiplier, uintmax_t divisor) 2858d59ecb2SHans Petter Selasky { 2868d59ecb2SHans Petter Selasky uintmax_t q = (x / divisor); 2878d59ecb2SHans Petter Selasky uintmax_t r = (x % divisor); 2888d59ecb2SHans Petter Selasky 2898d59ecb2SHans Petter Selasky return ((q * multiplier) + ((r * multiplier) / divisor)); 2908d59ecb2SHans Petter Selasky } 2918d59ecb2SHans Petter Selasky 2928d59ecb2SHans Petter Selasky static inline int64_t 2938d59ecb2SHans Petter Selasky abs64(int64_t x) 2948d59ecb2SHans Petter Selasky { 2958d59ecb2SHans Petter Selasky return (x < 0 ? -x : x); 2968d59ecb2SHans Petter Selasky } 2978d59ecb2SHans Petter Selasky 2988d59ecb2SHans Petter Selasky #endif /* _LINUX_KERNEL_H_ */ 299