1 /*- 2 * Copyright (c) 2010 Isilon Systems, Inc. 3 * Copyright (c) 2010 iX Systems, Inc. 4 * Copyright (c) 2010 Panasas, Inc. 5 * Copyright (c) 2014-2016 François Tigeot 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice unmodified, this list of conditions, and the following 13 * disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 19 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 20 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 21 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 23 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 27 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28 */ 29 #ifndef _LINUX_KERNEL_H_ 30 #define _LINUX_KERNEL_H_ 31 32 #include <sys/systm.h> 33 #include <sys/param.h> 34 #include <sys/libkern.h> 35 #include <sys/stat.h> 36 37 #include <linux/bitops.h> 38 #include <linux/compiler.h> 39 #include <linux/log2.h> 40 #include <linux/types.h> 41 #include <linux/printk.h> 42 43 #define KERN_CONT "" 44 #define KERN_EMERG "<0>" 45 #define KERN_ALERT "<1>" 46 #define KERN_CRIT "<2>" 47 #define KERN_ERR "<3>" 48 #define KERN_WARNING "<4>" 49 #define KERN_NOTICE "<5>" 50 #define KERN_INFO "<6>" 51 #define KERN_DEBUG "<7>" 52 53 #define BUG() do \ 54 { \ 55 panic("BUG in %s at %s:%u", \ 56 __func__, __FILE__, __LINE__); \ 57 } while (0) 58 59 #define BUG_ON(condition) do { if (condition) BUG(); } while(0) 60 61 #undef ALIGN 62 #define ALIGN(x, y) roundup2((x), (y)) 63 #define DIV_ROUND_UP howmany 64 #define DIV_ROUND_UP_ULL(X, N) DIV_ROUND_UP((unsigned long long)(X), (N)) 65 66 #define printk(X...) kprintf(X) 67 #define pr_debug(fmt, ...) printk(KERN_DEBUG # fmt, ##__VA_ARGS__) 68 #define udelay(t) DELAY(t) 69 70 #ifndef pr_fmt 71 #define pr_fmt(fmt) fmt 72 #endif 73 74 /* 75 * Print a one-time message (analogous to WARN_ONCE() et al): 76 */ 77 #define printk_once(x...) ({ \ 78 static bool __print_once; \ 79 \ 80 if (!__print_once) { \ 81 __print_once = true; \ 82 printk(x); \ 83 } \ 84 }) 85 86 87 88 #define pr_emerg(fmt, ...) \ 89 printk(KERN_EMERG pr_fmt(fmt), ##__VA_ARGS__) 90 #define pr_alert(fmt, ...) \ 91 printk(KERN_ALERT pr_fmt(fmt), ##__VA_ARGS__) 92 #define pr_crit(fmt, ...) \ 93 printk(KERN_CRIT pr_fmt(fmt), ##__VA_ARGS__) 94 #define pr_err(fmt, ...) \ 95 kprintf(KERN_ERR pr_fmt(fmt), ##__VA_ARGS__) 96 #define pr_warning(fmt, ...) \ 97 printk(KERN_WARNING pr_fmt(fmt), ##__VA_ARGS__) 98 #define pr_warn pr_warning 99 #define pr_notice(fmt, ...) \ 100 printk(KERN_NOTICE pr_fmt(fmt), ##__VA_ARGS__) 101 #define pr_info(fmt, ...) \ 102 printk(KERN_INFO pr_fmt(fmt), ##__VA_ARGS__) 103 #define pr_cont(fmt, ...) \ 104 printk(KERN_CONT fmt, ##__VA_ARGS__) 105 106 /* pr_devel() should produce zero code unless DEBUG is defined */ 107 #ifdef DEBUG 108 #define pr_devel(fmt, ...) \ 109 printk(KERN_DEBUG pr_fmt(fmt), ##__VA_ARGS__) 110 #else 111 #define pr_devel(fmt, ...) \ 112 ({ if (0) printk(KERN_DEBUG pr_fmt(fmt), ##__VA_ARGS__); 0; }) 113 #endif 114 115 #ifndef WARN 116 #define WARN(condition, format...) ({ \ 117 int __ret_warn_on = !!(condition); \ 118 if (unlikely(__ret_warn_on)) \ 119 pr_warning(format); \ 120 unlikely(__ret_warn_on); \ 121 }) 122 #endif 123 124 #define WARN_ONCE(condition, format...) ({ \ 125 static bool __warned_once; \ 126 int __ret = !!(condition); \ 127 \ 128 if ((condition) && !__warned_once) { \ 129 WARN(condition, format); \ 130 __warned_once = true; \ 131 } \ 132 unlikely(__ret); \ 133 }) 134 135 #define container_of(ptr, type, member) \ 136 ({ \ 137 __typeof(((type *)0)->member) *_p = (ptr); \ 138 (type *)((char *)_p - offsetof(type, member)); \ 139 }) 140 141 #define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0])) 142 143 #define simple_strtoul strtoul 144 #define simple_strtol strtol 145 146 #define min(x, y) ((x) < (y) ? (x) : (y)) 147 #define max(x, y) ((x) > (y) ? (x) : (y)) 148 149 #define min3(a, b, c) min(a, min(b,c)) 150 #define max3(a, b, c) max(a, max(b,c)) 151 152 #define min_t(type, _x, _y) ((type)(_x) < (type)(_y) ? (type)(_x) : (type)(_y)) 153 #define max_t(type, _x, _y) ((type)(_x) > (type)(_y) ? (type)(_x) : (type)(_y)) 154 155 #define clamp_t(type, _x, min, max) min_t(type, max_t(type, _x, min), max) 156 #define clamp(x, lo, hi) min( max(x,lo), hi) 157 158 /* 159 * This looks more complex than it should be. But we need to 160 * get the type for the ~ right in round_down (it needs to be 161 * as wide as the result!), and we want to evaluate the macro 162 * arguments just once each. 163 */ 164 #define __round_mask(x, y) ((__typeof__(x))((y)-1)) 165 #define round_up(x, y) ((((x)-1) | __round_mask(x, y))+1) 166 #define round_down(x, y) ((x) & ~__round_mask(x, y)) 167 168 #define num_possible_cpus() mp_ncpus 169 170 typedef struct pm_message { 171 int event; 172 } pm_message_t; 173 174 /* Swap values of a and b */ 175 #define swap(a, b) \ 176 ({ \ 177 typeof(a) _swap_tmp = a; \ 178 a = b; \ 179 b = _swap_tmp; \ 180 }) 181 182 #define DIV_ROUND_CLOSEST(x, divisor) (((x) + ((divisor) /2)) / (divisor)) 183 184 static inline uintmax_t 185 mult_frac(uintmax_t x, uintmax_t multiplier, uintmax_t divisor) 186 { 187 uintmax_t q = (x / divisor); 188 uintmax_t r = (x % divisor); 189 190 return ((q * multiplier) + ((r * multiplier) / divisor)); 191 } 192 193 static inline int64_t abs64(int64_t x) 194 { 195 return (x < 0 ? -x : x); 196 } 197 198 /* simplified version of kvasnrprintf() for drm needs. */ 199 char *drm_vasprintf(int flags, const char *format, __va_list ap) __printflike(2, 0); 200 char *drm_asprintf(int flags, const char *format, ...) __printflike(2, 3); 201 202 #define DIV_ROUND_CLOSEST_ULL(ll, d) \ 203 ({ unsigned long long _tmp = (ll)+(d)/2; do_div(_tmp, d); _tmp; }) 204 205 #endif /* _LINUX_KERNEL_H_ */ 206