1 /* 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-2018 François Tigeot <ftigeot@wolfpond.org> 7 * All rights reserved. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice unmodified, this list of conditions, and the following 14 * disclaimer. 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. 18 * 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. 29 */ 30 #ifndef _LINUX_KERNEL_H_ 31 #define _LINUX_KERNEL_H_ 32 33 #include <stdarg.h> 34 #include <linux/stddef.h> 35 #include <linux/types.h> 36 #include <linux/compiler.h> 37 #include <linux/bitops.h> 38 #include <linux/log2.h> 39 #include <linux/printk.h> 40 41 #include <sys/systm.h> 42 #include <sys/param.h> 43 #include <sys/libkern.h> 44 #include <sys/stat.h> 45 #include <sys/endian.h> 46 47 #define U64_MAX ((u64)~0ULL) 48 49 #undef ALIGN 50 #define ALIGN(x, y) roundup2((x), (y)) 51 #define IS_ALIGNED(x, y) (((x) & ((y) - 1)) == 0) 52 #define DIV_ROUND_UP howmany 53 #define DIV_ROUND_UP_ULL(X, N) DIV_ROUND_UP((unsigned long long)(X), (N)) 54 55 #define udelay(t) DELAY(t) 56 57 #define container_of(ptr, type, member) \ 58 ({ \ 59 __typeof(((type *)0)->member) *_p = (ptr); \ 60 (type *)((char *)_p - offsetof(type, member)); \ 61 }) 62 63 #define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0])) 64 65 #define simple_strtoul strtoul 66 #define simple_strtol strtol 67 68 #define min(x, y) ((x) < (y) ? (x) : (y)) 69 #define max(x, y) ((x) > (y) ? (x) : (y)) 70 71 #define min3(a, b, c) min(a, min(b,c)) 72 #define max3(a, b, c) max(a, max(b,c)) 73 74 #define min_t(type, _x, _y) ((type)(_x) < (type)(_y) ? (type)(_x) : (type)(_y)) 75 #define max_t(type, _x, _y) ((type)(_x) > (type)(_y) ? (type)(_x) : (type)(_y)) 76 77 #define clamp_t(type, _x, min, max) min_t(type, max_t(type, _x, min), max) 78 #define clamp(x, lo, hi) min( max(x,lo), hi) 79 #define clamp_val(val, lo, hi) clamp_t(typeof(val), val, lo, hi) 80 81 /* 82 * This looks more complex than it should be. But we need to 83 * get the type for the ~ right in round_down (it needs to be 84 * as wide as the result!), and we want to evaluate the macro 85 * arguments just once each. 86 */ 87 #define __round_mask(x, y) ((__typeof__(x))((y)-1)) 88 #define round_up(x, y) ((((x)-1) | __round_mask(x, y))+1) 89 #define round_down(x, y) ((x) & ~__round_mask(x, y)) 90 91 #define num_possible_cpus() mp_ncpus 92 93 typedef struct pm_message { 94 int event; 95 } pm_message_t; 96 97 /* Swap values of a and b */ 98 #define swap(a, b) \ 99 ({ \ 100 typeof(a) _swap_tmp = a; \ 101 a = b; \ 102 b = _swap_tmp; \ 103 }) 104 105 #define DIV_ROUND_CLOSEST(x, divisor) (((x) + ((divisor) /2)) / (divisor)) 106 107 static inline uintmax_t 108 mult_frac(uintmax_t x, uintmax_t multiplier, uintmax_t divisor) 109 { 110 uintmax_t q = (x / divisor); 111 uintmax_t r = (x % divisor); 112 113 return ((q * multiplier) + ((r * multiplier) / divisor)); 114 } 115 116 static inline int64_t abs64(int64_t x) 117 { 118 return (x < 0 ? -x : x); 119 } 120 121 #define DIV_ROUND_CLOSEST_ULL(ll, d) \ 122 ({ unsigned long long _tmp = (ll)+(d)/2; do_div(_tmp, d); _tmp; }) 123 124 #define upper_32_bits(n) ((u32)(((n) >> 16) >> 16)) 125 #define lower_32_bits(n) ((u32)(n)) 126 127 /* Byteorder compat layer */ 128 #if _BYTE_ORDER == _BIG_ENDIAN 129 #define __BIG_ENDIAN 4321 130 #else 131 #define __LITTLE_ENDIAN 1234 132 #endif 133 134 #define cpu_to_le16(x) htole16(x) 135 #define le16_to_cpu(x) le16toh(x) 136 #define cpu_to_le32(x) htole32(x) 137 #define le32_to_cpu(x) le32toh(x) 138 #define le32_to_cpup(x) le32toh(*x) 139 140 #define cpu_to_be16(x) htobe16(x) 141 #define be16_to_cpu(x) be16toh(x) 142 #define cpu_to_be32(x) htobe32(x) 143 #define be32_to_cpu(x) be32toh(x) 144 #define be32_to_cpup(x) be32toh(*x) 145 146 static inline int __must_check 147 kstrtouint(const char *s, unsigned int base, unsigned int *res) 148 { 149 *(res) = strtol(s,0,base); 150 151 return 0; 152 } 153 154 #define kvasprintf drm_vasprintf 155 #define kasprintf drm_asprintf 156 157 static inline void __user * 158 u64_to_user_ptr(u64 address) 159 { 160 return (void __user *)(uintptr_t)address; 161 } 162 163 static inline void 164 might_sleep(void) 165 { 166 } 167 168 #define snprintf ksnprintf 169 170 static inline int 171 vsnprintf(char *buf, size_t size, const char *fmt, __va_list args) 172 { 173 return kvsnprintf(buf, size, fmt, args); 174 } 175 176 static inline int 177 vscnprintf(char *buf, size_t size, const char *fmt, va_list args) 178 { 179 int ret; 180 181 if (size == 0) 182 return 0; 183 184 ret = vsnprintf(buf, size, fmt, args); 185 if (ret < size) 186 return ret; 187 188 return size - 1; 189 } 190 191 static inline int 192 scnprintf(char *buf, size_t size, const char *fmt, ...) 193 { 194 va_list args; 195 int i; 196 197 va_start(args, fmt); 198 i = vscnprintf(buf, size, fmt, args); 199 va_end(args); 200 201 return (i); 202 } 203 204 #endif /* _LINUX_KERNEL_H_ */ 205