Greg Kroah-Hartman | b244131 | 2017-11-01 15:07:57 +0100 | [diff] [blame] | 1 | /* SPDX-License-Identifier: GPL-2.0 */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2 | #ifndef _LINUX_KERNEL_H |
| 3 | #define _LINUX_KERNEL_H |
| 4 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5 | |
| 6 | #include <stdarg.h> |
| 7 | #include <linux/linkage.h> |
| 8 | #include <linux/stddef.h> |
| 9 | #include <linux/types.h> |
| 10 | #include <linux/compiler.h> |
| 11 | #include <linux/bitops.h> |
David Howells | f0d1b0b | 2006-12-08 02:37:49 -0800 | [diff] [blame] | 12 | #include <linux/log2.h> |
Andrew Morton | e0deaff4 | 2008-07-25 01:45:24 -0700 | [diff] [blame] | 13 | #include <linux/typecheck.h> |
Linus Torvalds | 968ab18 | 2010-11-15 13:37:37 -0800 | [diff] [blame] | 14 | #include <linux/printk.h> |
Ian Abbott | c7acec71 | 2017-07-12 14:33:04 -0700 | [diff] [blame] | 15 | #include <linux/build_bug.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 16 | #include <asm/byteorder.h> |
David Howells | 607ca46 | 2012-10-13 10:46:48 +0100 | [diff] [blame] | 17 | #include <uapi/linux/kernel.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 18 | |
Alexey Dobriyan | 4be929b | 2010-05-24 14:33:03 -0700 | [diff] [blame] | 19 | #define USHRT_MAX ((u16)(~0U)) |
| 20 | #define SHRT_MAX ((s16)(USHRT_MAX>>1)) |
| 21 | #define SHRT_MIN ((s16)(-SHRT_MAX - 1)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 22 | #define INT_MAX ((int)(~0U>>1)) |
| 23 | #define INT_MIN (-INT_MAX - 1) |
| 24 | #define UINT_MAX (~0U) |
| 25 | #define LONG_MAX ((long)(~0UL>>1)) |
| 26 | #define LONG_MIN (-LONG_MAX - 1) |
| 27 | #define ULONG_MAX (~0UL) |
OGAWA Hirofumi | 111ebb6 | 2006-06-23 02:03:26 -0700 | [diff] [blame] | 28 | #define LLONG_MAX ((long long)(~0ULL>>1)) |
| 29 | #define LLONG_MIN (-LLONG_MAX - 1) |
| 30 | #define ULLONG_MAX (~0ULL) |
Xi Wang | a3860c1 | 2012-05-31 16:26:04 -0700 | [diff] [blame] | 31 | #define SIZE_MAX (~(size_t)0) |
Stefan Agner | 1c4bc43 | 2018-06-07 17:06:15 -0700 | [diff] [blame] | 32 | #define PHYS_ADDR_MAX (~(phys_addr_t)0) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 33 | |
Alex Elder | 89a0714 | 2014-01-23 15:54:00 -0800 | [diff] [blame] | 34 | #define U8_MAX ((u8)~0U) |
| 35 | #define S8_MAX ((s8)(U8_MAX>>1)) |
| 36 | #define S8_MIN ((s8)(-S8_MAX - 1)) |
| 37 | #define U16_MAX ((u16)~0U) |
| 38 | #define S16_MAX ((s16)(U16_MAX>>1)) |
| 39 | #define S16_MIN ((s16)(-S16_MAX - 1)) |
| 40 | #define U32_MAX ((u32)~0U) |
| 41 | #define S32_MAX ((s32)(U32_MAX>>1)) |
| 42 | #define S32_MIN ((s32)(-S32_MAX - 1)) |
| 43 | #define U64_MAX ((u64)~0ULL) |
| 44 | #define S64_MAX ((s64)(U64_MAX>>1)) |
| 45 | #define S64_MIN ((s64)(-S64_MAX - 1)) |
| 46 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 47 | #define STACK_MAGIC 0xdeadbeef |
| 48 | |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 49 | /** |
| 50 | * REPEAT_BYTE - repeat the value @x multiple times as an unsigned long value |
| 51 | * @x: value to repeat |
| 52 | * |
| 53 | * NOTE: @x is not checked for > 0xff; larger values produce odd results. |
| 54 | */ |
David S. Miller | 4469690 | 2012-05-23 20:12:50 -0700 | [diff] [blame] | 55 | #define REPEAT_BYTE(x) ((~0ul / 0xff) * (x)) |
| 56 | |
zijun_hu | 3ca45a4 | 2016-10-14 15:12:54 +0800 | [diff] [blame] | 57 | /* @a is a power of 2 value */ |
Alexey Dobriyan | a79ff73 | 2010-04-13 11:21:46 +0200 | [diff] [blame] | 58 | #define ALIGN(x, a) __ALIGN_KERNEL((x), (a)) |
Krzysztof Kozlowski | ed067d4 | 2017-04-11 20:08:34 +0200 | [diff] [blame] | 59 | #define ALIGN_DOWN(x, a) __ALIGN_KERNEL((x) - ((a) - 1), (a)) |
Alexey Dobriyan | 9f93ff5 | 2010-04-13 14:09:15 +0200 | [diff] [blame] | 60 | #define __ALIGN_MASK(x, mask) __ALIGN_KERNEL_MASK((x), (mask)) |
Matthew Wilcox | a83308e | 2007-09-11 15:23:47 -0700 | [diff] [blame] | 61 | #define PTR_ALIGN(p, a) ((typeof(p))ALIGN((unsigned long)(p), (a))) |
Herbert Xu | f10db62 | 2008-02-06 01:37:05 -0800 | [diff] [blame] | 62 | #define IS_ALIGNED(x, a) (((x) & ((typeof(x))(a) - 1)) == 0) |
Linus Torvalds | 2ea5814 | 2006-11-26 19:05:22 -0800 | [diff] [blame] | 63 | |
Christoph Hellwig | d384995 | 2016-11-01 07:40:11 -0600 | [diff] [blame] | 64 | /* generic data direction definitions */ |
| 65 | #define READ 0 |
| 66 | #define WRITE 1 |
| 67 | |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 68 | /** |
| 69 | * ARRAY_SIZE - get the number of elements in array @arr |
| 70 | * @arr: array to be sized |
| 71 | */ |
Rusty Russell | c5e631cf | 2007-05-06 14:51:05 -0700 | [diff] [blame] | 72 | #define ARRAY_SIZE(arr) (sizeof(arr) / sizeof((arr)[0]) + __must_be_array(arr)) |
| 73 | |
Gustavo Padovan | 3ed605b | 2016-04-26 12:32:27 -0300 | [diff] [blame] | 74 | #define u64_to_user_ptr(x) ( \ |
| 75 | { \ |
| 76 | typecheck(u64, x); \ |
| 77 | (void __user *)(uintptr_t)x; \ |
| 78 | } \ |
| 79 | ) |
| 80 | |
Yinghai Lu | 9b3be9f | 2010-02-10 01:20:29 -0800 | [diff] [blame] | 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)) |
Kees Cook | cedc5b6 | 2018-08-21 21:55:28 -0700 | [diff] [blame] | 88 | /** |
| 89 | * round_up - round up to next specified power of 2 |
| 90 | * @x: the value to round |
| 91 | * @y: multiple to round up to (must be a power of 2) |
| 92 | * |
| 93 | * Rounds @x up to next multiple of @y (which must be a power of 2). |
| 94 | * To perform arbitrary rounding up, use roundup() below. |
| 95 | */ |
Yinghai Lu | 9b3be9f | 2010-02-10 01:20:29 -0800 | [diff] [blame] | 96 | #define round_up(x, y) ((((x)-1) | __round_mask(x, y))+1) |
Kees Cook | cedc5b6 | 2018-08-21 21:55:28 -0700 | [diff] [blame] | 97 | /** |
| 98 | * round_down - round down to next specified power of 2 |
| 99 | * @x: the value to round |
| 100 | * @y: multiple to round down to (must be a power of 2) |
| 101 | * |
| 102 | * Rounds @x down to next multiple of @y (which must be a power of 2). |
| 103 | * To perform arbitrary rounding down, use rounddown() below. |
| 104 | */ |
Yinghai Lu | 9b3be9f | 2010-02-10 01:20:29 -0800 | [diff] [blame] | 105 | #define round_down(x, y) ((x) & ~__round_mask(x, y)) |
| 106 | |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 107 | /** |
| 108 | * FIELD_SIZEOF - get the size of a struct's field |
| 109 | * @t: the target struct |
| 110 | * @f: the target struct's field |
| 111 | * Return: the size of @f in the struct definition without having a |
| 112 | * declared instance of @t. |
| 113 | */ |
Jan Beulich | 4552d5d | 2006-06-26 13:57:28 +0200 | [diff] [blame] | 114 | #define FIELD_SIZEOF(t, f) (sizeof(((t*)0)->f)) |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 115 | |
Nicolas Dichtel | b5d3755 | 2016-03-04 11:52:16 +0100 | [diff] [blame] | 116 | #define DIV_ROUND_UP __KERNEL_DIV_ROUND_UP |
Masahiro Yamada | 604df32 | 2017-09-08 16:13:45 -0700 | [diff] [blame] | 117 | |
| 118 | #define DIV_ROUND_DOWN_ULL(ll, d) \ |
| 119 | ({ unsigned long long _tmp = (ll); do_div(_tmp, d); _tmp; }) |
| 120 | |
| 121 | #define DIV_ROUND_UP_ULL(ll, d) DIV_ROUND_DOWN_ULL((ll) + (d) - 1, (d)) |
Nicholas Bellinger | 36a26c6 | 2011-07-26 00:35:26 -0700 | [diff] [blame] | 122 | |
| 123 | #if BITS_PER_LONG == 32 |
| 124 | # define DIV_ROUND_UP_SECTOR_T(ll,d) DIV_ROUND_UP_ULL(ll, d) |
| 125 | #else |
| 126 | # define DIV_ROUND_UP_SECTOR_T(ll,d) DIV_ROUND_UP(ll,d) |
| 127 | #endif |
James Morris | 074e61e | 2010-11-10 09:01:31 +1100 | [diff] [blame] | 128 | |
Kees Cook | cedc5b6 | 2018-08-21 21:55:28 -0700 | [diff] [blame] | 129 | /** |
| 130 | * roundup - round up to the next specified multiple |
| 131 | * @x: the value to up |
| 132 | * @y: multiple to round up to |
| 133 | * |
| 134 | * Rounds @x up to next multiple of @y. If @y will always be a power |
| 135 | * of 2, consider using the faster round_up(). |
| 136 | * |
| 137 | * The `const' here prevents gcc-3.3 from calling __divdi3 |
| 138 | */ |
Eric Paris | b28efd5 | 2010-10-13 17:50:08 -0400 | [diff] [blame] | 139 | #define roundup(x, y) ( \ |
| 140 | { \ |
Tetsuo Handa | 6070bf3 | 2010-11-08 11:20:49 +0900 | [diff] [blame] | 141 | const typeof(y) __y = y; \ |
Eric Paris | b28efd5 | 2010-10-13 17:50:08 -0400 | [diff] [blame] | 142 | (((x) + (__y - 1)) / __y) * __y; \ |
| 143 | } \ |
| 144 | ) |
Kees Cook | cedc5b6 | 2018-08-21 21:55:28 -0700 | [diff] [blame] | 145 | /** |
| 146 | * rounddown - round down to next specified multiple |
| 147 | * @x: the value to round |
| 148 | * @y: multiple to round down to |
| 149 | * |
| 150 | * Rounds @x down to next multiple of @y. If @y will always be a power |
| 151 | * of 2, consider using the faster round_down(). |
| 152 | */ |
Eric Paris | 686a0f3 | 2010-10-13 17:50:02 -0400 | [diff] [blame] | 153 | #define rounddown(x, y) ( \ |
| 154 | { \ |
| 155 | typeof(x) __x = (x); \ |
| 156 | __x - (__x % (y)); \ |
| 157 | } \ |
| 158 | ) |
Guenter Roeck | b6d86d3 | 2012-08-24 17:25:01 -0700 | [diff] [blame] | 159 | |
| 160 | /* |
Niklas Söderlund | 4f5901f5 | 2017-02-24 15:01:01 -0800 | [diff] [blame] | 161 | * Divide positive or negative dividend by positive or negative divisor |
| 162 | * and round to closest integer. Result is undefined for negative |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 163 | * divisors if the dividend variable type is unsigned and for negative |
Niklas Söderlund | 4f5901f5 | 2017-02-24 15:01:01 -0800 | [diff] [blame] | 164 | * dividends if the divisor variable type is unsigned. |
Guenter Roeck | b6d86d3 | 2012-08-24 17:25:01 -0700 | [diff] [blame] | 165 | */ |
Darrick J. Wong | 9fe0608 | 2009-01-06 14:40:51 -0800 | [diff] [blame] | 166 | #define DIV_ROUND_CLOSEST(x, divisor)( \ |
| 167 | { \ |
Guenter Roeck | b6d86d3 | 2012-08-24 17:25:01 -0700 | [diff] [blame] | 168 | typeof(x) __x = x; \ |
| 169 | typeof(divisor) __d = divisor; \ |
Guenter Roeck | c4e1849 | 2012-12-20 15:05:42 -0800 | [diff] [blame] | 170 | (((typeof(x))-1) > 0 || \ |
Niklas Söderlund | 4f5901f5 | 2017-02-24 15:01:01 -0800 | [diff] [blame] | 171 | ((typeof(divisor))-1) > 0 || \ |
| 172 | (((__x) > 0) == ((__d) > 0))) ? \ |
Guenter Roeck | b6d86d3 | 2012-08-24 17:25:01 -0700 | [diff] [blame] | 173 | (((__x) + ((__d) / 2)) / (__d)) : \ |
| 174 | (((__x) - ((__d) / 2)) / (__d)); \ |
Darrick J. Wong | 9fe0608 | 2009-01-06 14:40:51 -0800 | [diff] [blame] | 175 | } \ |
| 176 | ) |
Javi Merino | f766093 | 2015-04-16 12:43:45 -0700 | [diff] [blame] | 177 | /* |
| 178 | * Same as above but for u64 dividends. divisor must be a 32-bit |
| 179 | * number. |
| 180 | */ |
| 181 | #define DIV_ROUND_CLOSEST_ULL(x, divisor)( \ |
| 182 | { \ |
| 183 | typeof(divisor) __d = divisor; \ |
| 184 | unsigned long long _tmp = (x) + (__d) / 2; \ |
| 185 | do_div(_tmp, __d); \ |
| 186 | _tmp; \ |
| 187 | } \ |
| 188 | ) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 189 | |
Salman Qazi | 9993bc63 | 2012-03-09 16:41:01 -0800 | [diff] [blame] | 190 | /* |
| 191 | * Multiplies an integer by a fraction, while avoiding unnecessary |
| 192 | * overflow or loss of precision. |
| 193 | */ |
| 194 | #define mult_frac(x, numer, denom)( \ |
| 195 | { \ |
| 196 | typeof(x) quot = (x) / (denom); \ |
| 197 | typeof(x) rem = (x) % (denom); \ |
| 198 | (quot * (numer)) + ((rem * (numer)) / (denom)); \ |
| 199 | } \ |
| 200 | ) |
| 201 | |
| 202 | |
Eduard - Gabriel Munteanu | ca31e14 | 2008-07-05 12:14:23 +0300 | [diff] [blame] | 203 | #define _RET_IP_ (unsigned long)__builtin_return_address(0) |
| 204 | #define _THIS_IP_ ({ __label__ __here; __here: (unsigned long)&&__here; }) |
| 205 | |
Bartlomiej Zolnierkiewicz | 90c699a | 2009-06-19 08:08:50 +0200 | [diff] [blame] | 206 | #ifdef CONFIG_LBDAF |
Jens Axboe | 2da96ac | 2007-10-12 12:40:38 +0200 | [diff] [blame] | 207 | # include <asm/div64.h> |
| 208 | # define sector_div(a, b) do_div(a, b) |
| 209 | #else |
| 210 | # define sector_div(n, b)( \ |
| 211 | { \ |
| 212 | int _res; \ |
| 213 | _res = (n) % (b); \ |
| 214 | (n) /= (b); \ |
| 215 | _res; \ |
| 216 | } \ |
| 217 | ) |
| 218 | #endif |
| 219 | |
Andrew Morton | 218e180 | 2007-05-10 03:15:18 -0700 | [diff] [blame] | 220 | /** |
| 221 | * upper_32_bits - return bits 32-63 of a number |
| 222 | * @n: the number we're accessing |
| 223 | * |
| 224 | * A basic shift-right of a 64- or 32-bit quantity. Use this to suppress |
| 225 | * the "right shift count >= width of type" warning when that quantity is |
| 226 | * 32-bits. |
| 227 | */ |
| 228 | #define upper_32_bits(n) ((u32)(((n) >> 16) >> 16)) |
| 229 | |
Joerg Roedel | 204b885 | 2008-07-29 22:33:42 -0700 | [diff] [blame] | 230 | /** |
| 231 | * lower_32_bits - return bits 0-31 of a number |
| 232 | * @n: the number we're accessing |
| 233 | */ |
| 234 | #define lower_32_bits(n) ((u32)(n)) |
| 235 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 236 | struct completion; |
akpm@osdl.org | df2e71f | 2006-01-09 20:51:37 -0800 | [diff] [blame] | 237 | struct pt_regs; |
| 238 | struct user; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 239 | |
Uwe Kleine-König | 070cb06 | 2008-08-12 15:08:59 -0700 | [diff] [blame] | 240 | #ifdef CONFIG_PREEMPT_VOLUNTARY |
| 241 | extern int _cond_resched(void); |
| 242 | # define might_resched() _cond_resched() |
| 243 | #else |
| 244 | # define might_resched() do { } while (0) |
| 245 | #endif |
| 246 | |
Frederic Weisbecker | d902db1 | 2011-06-08 19:31:56 +0200 | [diff] [blame] | 247 | #ifdef CONFIG_DEBUG_ATOMIC_SLEEP |
Peter Zijlstra | 3427445 | 2014-09-24 10:18:56 +0200 | [diff] [blame] | 248 | void ___might_sleep(const char *file, int line, int preempt_offset); |
Simon Kagstrom | d894837 | 2009-12-23 11:08:18 +0100 | [diff] [blame] | 249 | void __might_sleep(const char *file, int line, int preempt_offset); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 250 | /** |
| 251 | * might_sleep - annotation for functions that can sleep |
| 252 | * |
| 253 | * this macro will print a stack trace if it is executed in an atomic |
| 254 | * context (spinlock, irq-handler, ...). |
| 255 | * |
| 256 | * This is a useful debugging help to be able to catch problems early and not |
Jim Cromie | e20ec99 | 2006-11-30 04:46:13 +0100 | [diff] [blame] | 257 | * be bitten later when the calling function happens to sleep when it is not |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 258 | * supposed to. |
| 259 | */ |
Ingo Molnar | f8cbd99 | 2005-06-25 14:57:39 -0700 | [diff] [blame] | 260 | # define might_sleep() \ |
Frederic Weisbecker | e4aafea | 2009-07-16 15:44:29 +0200 | [diff] [blame] | 261 | do { __might_sleep(__FILE__, __LINE__, 0); might_resched(); } while (0) |
Linus Torvalds | 00845eb | 2015-02-01 12:23:32 -0800 | [diff] [blame] | 262 | # define sched_annotate_sleep() (current->task_state_change = 0) |
Ingo Molnar | f8cbd99 | 2005-06-25 14:57:39 -0700 | [diff] [blame] | 263 | #else |
Peter Zijlstra | 3427445 | 2014-09-24 10:18:56 +0200 | [diff] [blame] | 264 | static inline void ___might_sleep(const char *file, int line, |
| 265 | int preempt_offset) { } |
Simon Kagstrom | d894837 | 2009-12-23 11:08:18 +0100 | [diff] [blame] | 266 | static inline void __might_sleep(const char *file, int line, |
| 267 | int preempt_offset) { } |
Ingo Molnar | f8cbd99 | 2005-06-25 14:57:39 -0700 | [diff] [blame] | 268 | # define might_sleep() do { might_resched(); } while (0) |
Peter Zijlstra | 1029a2b | 2014-09-24 10:18:49 +0200 | [diff] [blame] | 269 | # define sched_annotate_sleep() do { } while (0) |
Ingo Molnar | f8cbd99 | 2005-06-25 14:57:39 -0700 | [diff] [blame] | 270 | #endif |
| 271 | |
Hua Zhong | 368a5fa | 2006-06-23 02:05:42 -0700 | [diff] [blame] | 272 | #define might_sleep_if(cond) do { if (cond) might_sleep(); } while (0) |
Ingo Molnar | f8cbd99 | 2005-06-25 14:57:39 -0700 | [diff] [blame] | 273 | |
Michal Nazarewicz | c8299cb | 2015-11-09 14:58:10 -0800 | [diff] [blame] | 274 | /** |
| 275 | * abs - return absolute value of an argument |
Michal Nazarewicz | 8f57e4d | 2016-01-15 16:57:58 -0800 | [diff] [blame] | 276 | * @x: the value. If it is unsigned type, it is converted to signed type first. |
| 277 | * char is treated as if it was signed (regardless of whether it really is) |
| 278 | * but the macro's return type is preserved as char. |
Michal Nazarewicz | c8299cb | 2015-11-09 14:58:10 -0800 | [diff] [blame] | 279 | * |
Michal Nazarewicz | 8f57e4d | 2016-01-15 16:57:58 -0800 | [diff] [blame] | 280 | * Return: an absolute value of x. |
Andrew Morton | 71a9048 | 2011-01-12 16:59:35 -0800 | [diff] [blame] | 281 | */ |
Michal Nazarewicz | 8f57e4d | 2016-01-15 16:57:58 -0800 | [diff] [blame] | 282 | #define abs(x) __abs_choose_expr(x, long long, \ |
| 283 | __abs_choose_expr(x, long, \ |
| 284 | __abs_choose_expr(x, int, \ |
| 285 | __abs_choose_expr(x, short, \ |
| 286 | __abs_choose_expr(x, char, \ |
| 287 | __builtin_choose_expr( \ |
| 288 | __builtin_types_compatible_p(typeof(x), char), \ |
| 289 | (char)({ signed char __x = (x); __x<0?-__x:__x; }), \ |
| 290 | ((void)0))))))) |
| 291 | |
| 292 | #define __abs_choose_expr(x, type, other) __builtin_choose_expr( \ |
| 293 | __builtin_types_compatible_p(typeof(x), signed type) || \ |
| 294 | __builtin_types_compatible_p(typeof(x), unsigned type), \ |
| 295 | ({ signed type __x = (x); __x < 0 ? -__x : __x; }), other) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 296 | |
Daniel Borkmann | 89770b0 | 2014-01-22 02:29:40 +0100 | [diff] [blame] | 297 | /** |
| 298 | * reciprocal_scale - "scale" a value into range [0, ep_ro) |
| 299 | * @val: value |
| 300 | * @ep_ro: right open interval endpoint |
| 301 | * |
| 302 | * Perform a "reciprocal multiplication" in order to "scale" a value into |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 303 | * range [0, @ep_ro), where the upper interval endpoint is right-open. |
Daniel Borkmann | 89770b0 | 2014-01-22 02:29:40 +0100 | [diff] [blame] | 304 | * This is useful, e.g. for accessing a index of an array containing |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 305 | * @ep_ro elements, for example. Think of it as sort of modulus, only that |
Daniel Borkmann | 89770b0 | 2014-01-22 02:29:40 +0100 | [diff] [blame] | 306 | * the result isn't that of modulo. ;) Note that if initial input is a |
| 307 | * small value, then result will return 0. |
| 308 | * |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 309 | * Return: a result based on @val in interval [0, @ep_ro). |
Daniel Borkmann | 89770b0 | 2014-01-22 02:29:40 +0100 | [diff] [blame] | 310 | */ |
| 311 | static inline u32 reciprocal_scale(u32 val, u32 ep_ro) |
| 312 | { |
| 313 | return (u32)(((u64) val * ep_ro) >> 32); |
| 314 | } |
| 315 | |
Axel Lin | 386e790 | 2013-12-12 17:12:24 -0800 | [diff] [blame] | 316 | #if defined(CONFIG_MMU) && \ |
| 317 | (defined(CONFIG_PROVE_LOCKING) || defined(CONFIG_DEBUG_ATOMIC_SLEEP)) |
David Hildenbrand | 9ec2353 | 2015-05-11 17:52:07 +0200 | [diff] [blame] | 318 | #define might_fault() __might_fault(__FILE__, __LINE__) |
| 319 | void __might_fault(const char *file, int line); |
Nick Piggin | 3ee1afa | 2008-09-10 13:37:17 +0200 | [diff] [blame] | 320 | #else |
Michael S. Tsirkin | 662bbcb | 2013-05-26 17:32:23 +0300 | [diff] [blame] | 321 | static inline void might_fault(void) { } |
Nick Piggin | 3ee1afa | 2008-09-10 13:37:17 +0200 | [diff] [blame] | 322 | #endif |
| 323 | |
Alan Stern | e041c68 | 2006-03-27 01:16:30 -0800 | [diff] [blame] | 324 | extern struct atomic_notifier_head panic_notifier_list; |
TAMUKI Shoichi | c7ff0d9 | 2010-08-10 18:03:28 -0700 | [diff] [blame] | 325 | extern long (*panic_blink)(int state); |
Joe Perches | 9402c95 | 2012-01-12 17:17:17 -0800 | [diff] [blame] | 326 | __printf(1, 2) |
Peter Zijlstra | 9af6528 | 2016-09-13 18:37:29 +0200 | [diff] [blame] | 327 | void panic(const char *fmt, ...) __noreturn __cold; |
Hidehiro Kawai | ebc41f2 | 2016-03-22 14:27:17 -0700 | [diff] [blame] | 328 | void nmi_panic(struct pt_regs *regs, const char *msg); |
Andrew Morton | dd28779 | 2006-03-23 03:00:57 -0800 | [diff] [blame] | 329 | extern void oops_enter(void); |
| 330 | extern void oops_exit(void); |
Anton Blanchard | 863a604 | 2010-08-10 18:03:30 -0700 | [diff] [blame] | 331 | void print_oops_end_marker(void); |
Andrew Morton | dd28779 | 2006-03-23 03:00:57 -0800 | [diff] [blame] | 332 | extern int oops_may_print(void); |
Peter Zijlstra | 9af6528 | 2016-09-13 18:37:29 +0200 | [diff] [blame] | 333 | void do_exit(long error_code) __noreturn; |
| 334 | void complete_and_exit(struct completion *, long) __noreturn; |
Alexey Dobriyan | 33ee3b2 | 2011-03-22 16:34:40 -0700 | [diff] [blame] | 335 | |
Kees Cook | 7a46ec0 | 2017-08-15 09:19:24 -0700 | [diff] [blame] | 336 | #ifdef CONFIG_ARCH_HAS_REFCOUNT |
| 337 | void refcount_error_report(struct pt_regs *regs, const char *err); |
| 338 | #else |
| 339 | static inline void refcount_error_report(struct pt_regs *regs, const char *err) |
| 340 | { } |
| 341 | #endif |
| 342 | |
Alexey Dobriyan | 33ee3b2 | 2011-03-22 16:34:40 -0700 | [diff] [blame] | 343 | /* Internal, do not use. */ |
| 344 | int __must_check _kstrtoul(const char *s, unsigned int base, unsigned long *res); |
| 345 | int __must_check _kstrtol(const char *s, unsigned int base, long *res); |
| 346 | |
| 347 | int __must_check kstrtoull(const char *s, unsigned int base, unsigned long long *res); |
| 348 | int __must_check kstrtoll(const char *s, unsigned int base, long long *res); |
Eldad Zack | 4c925d6 | 2012-12-17 16:03:04 -0800 | [diff] [blame] | 349 | |
| 350 | /** |
| 351 | * kstrtoul - convert a string to an unsigned long |
| 352 | * @s: The start of the string. The string must be null-terminated, and may also |
| 353 | * include a single newline before its terminating null. The first character |
| 354 | * may also be a plus sign, but not a minus sign. |
| 355 | * @base: The number base to use. The maximum supported base is 16. If base is |
| 356 | * given as 0, then the base of the string is automatically detected with the |
| 357 | * conventional semantics - If it begins with 0x the number will be parsed as a |
| 358 | * hexadecimal (case insensitive), if it otherwise begins with 0, it will be |
| 359 | * parsed as an octal number. Otherwise it will be parsed as a decimal. |
| 360 | * @res: Where to write the result of the conversion on success. |
| 361 | * |
| 362 | * Returns 0 on success, -ERANGE on overflow and -EINVAL on parsing error. |
| 363 | * Used as a replacement for the obsolete simple_strtoull. Return code must |
| 364 | * be checked. |
| 365 | */ |
Alexey Dobriyan | 33ee3b2 | 2011-03-22 16:34:40 -0700 | [diff] [blame] | 366 | static inline int __must_check kstrtoul(const char *s, unsigned int base, unsigned long *res) |
| 367 | { |
| 368 | /* |
| 369 | * We want to shortcut function call, but |
| 370 | * __builtin_types_compatible_p(unsigned long, unsigned long long) = 0. |
| 371 | */ |
| 372 | if (sizeof(unsigned long) == sizeof(unsigned long long) && |
| 373 | __alignof__(unsigned long) == __alignof__(unsigned long long)) |
| 374 | return kstrtoull(s, base, (unsigned long long *)res); |
| 375 | else |
| 376 | return _kstrtoul(s, base, res); |
| 377 | } |
| 378 | |
Eldad Zack | 4c925d6 | 2012-12-17 16:03:04 -0800 | [diff] [blame] | 379 | /** |
| 380 | * kstrtol - convert a string to a long |
| 381 | * @s: The start of the string. The string must be null-terminated, and may also |
| 382 | * include a single newline before its terminating null. The first character |
| 383 | * may also be a plus sign or a minus sign. |
| 384 | * @base: The number base to use. The maximum supported base is 16. If base is |
| 385 | * given as 0, then the base of the string is automatically detected with the |
| 386 | * conventional semantics - If it begins with 0x the number will be parsed as a |
| 387 | * hexadecimal (case insensitive), if it otherwise begins with 0, it will be |
| 388 | * parsed as an octal number. Otherwise it will be parsed as a decimal. |
| 389 | * @res: Where to write the result of the conversion on success. |
| 390 | * |
| 391 | * Returns 0 on success, -ERANGE on overflow and -EINVAL on parsing error. |
| 392 | * Used as a replacement for the obsolete simple_strtoull. Return code must |
| 393 | * be checked. |
| 394 | */ |
Alexey Dobriyan | 33ee3b2 | 2011-03-22 16:34:40 -0700 | [diff] [blame] | 395 | static inline int __must_check kstrtol(const char *s, unsigned int base, long *res) |
| 396 | { |
| 397 | /* |
| 398 | * We want to shortcut function call, but |
| 399 | * __builtin_types_compatible_p(long, long long) = 0. |
| 400 | */ |
| 401 | if (sizeof(long) == sizeof(long long) && |
| 402 | __alignof__(long) == __alignof__(long long)) |
| 403 | return kstrtoll(s, base, (long long *)res); |
| 404 | else |
| 405 | return _kstrtol(s, base, res); |
| 406 | } |
| 407 | |
| 408 | int __must_check kstrtouint(const char *s, unsigned int base, unsigned int *res); |
| 409 | int __must_check kstrtoint(const char *s, unsigned int base, int *res); |
| 410 | |
| 411 | static inline int __must_check kstrtou64(const char *s, unsigned int base, u64 *res) |
| 412 | { |
| 413 | return kstrtoull(s, base, res); |
| 414 | } |
| 415 | |
| 416 | static inline int __must_check kstrtos64(const char *s, unsigned int base, s64 *res) |
| 417 | { |
| 418 | return kstrtoll(s, base, res); |
| 419 | } |
| 420 | |
| 421 | static inline int __must_check kstrtou32(const char *s, unsigned int base, u32 *res) |
| 422 | { |
| 423 | return kstrtouint(s, base, res); |
| 424 | } |
| 425 | |
| 426 | static inline int __must_check kstrtos32(const char *s, unsigned int base, s32 *res) |
| 427 | { |
| 428 | return kstrtoint(s, base, res); |
| 429 | } |
| 430 | |
| 431 | int __must_check kstrtou16(const char *s, unsigned int base, u16 *res); |
| 432 | int __must_check kstrtos16(const char *s, unsigned int base, s16 *res); |
| 433 | int __must_check kstrtou8(const char *s, unsigned int base, u8 *res); |
| 434 | int __must_check kstrtos8(const char *s, unsigned int base, s8 *res); |
Kees Cook | ef95159 | 2016-03-17 14:22:50 -0700 | [diff] [blame] | 435 | int __must_check kstrtobool(const char *s, bool *res); |
Alexey Dobriyan | 33ee3b2 | 2011-03-22 16:34:40 -0700 | [diff] [blame] | 436 | |
Alexey Dobriyan | c196e32 | 2011-05-24 17:13:31 -0700 | [diff] [blame] | 437 | int __must_check kstrtoull_from_user(const char __user *s, size_t count, unsigned int base, unsigned long long *res); |
| 438 | int __must_check kstrtoll_from_user(const char __user *s, size_t count, unsigned int base, long long *res); |
| 439 | int __must_check kstrtoul_from_user(const char __user *s, size_t count, unsigned int base, unsigned long *res); |
| 440 | int __must_check kstrtol_from_user(const char __user *s, size_t count, unsigned int base, long *res); |
| 441 | int __must_check kstrtouint_from_user(const char __user *s, size_t count, unsigned int base, unsigned int *res); |
| 442 | int __must_check kstrtoint_from_user(const char __user *s, size_t count, unsigned int base, int *res); |
| 443 | int __must_check kstrtou16_from_user(const char __user *s, size_t count, unsigned int base, u16 *res); |
| 444 | int __must_check kstrtos16_from_user(const char __user *s, size_t count, unsigned int base, s16 *res); |
| 445 | int __must_check kstrtou8_from_user(const char __user *s, size_t count, unsigned int base, u8 *res); |
| 446 | int __must_check kstrtos8_from_user(const char __user *s, size_t count, unsigned int base, s8 *res); |
Kees Cook | ef95159 | 2016-03-17 14:22:50 -0700 | [diff] [blame] | 447 | int __must_check kstrtobool_from_user(const char __user *s, size_t count, bool *res); |
Alexey Dobriyan | c196e32 | 2011-05-24 17:13:31 -0700 | [diff] [blame] | 448 | |
| 449 | static inline int __must_check kstrtou64_from_user(const char __user *s, size_t count, unsigned int base, u64 *res) |
| 450 | { |
| 451 | return kstrtoull_from_user(s, count, base, res); |
| 452 | } |
| 453 | |
| 454 | static inline int __must_check kstrtos64_from_user(const char __user *s, size_t count, unsigned int base, s64 *res) |
| 455 | { |
| 456 | return kstrtoll_from_user(s, count, base, res); |
| 457 | } |
| 458 | |
| 459 | static inline int __must_check kstrtou32_from_user(const char __user *s, size_t count, unsigned int base, u32 *res) |
| 460 | { |
| 461 | return kstrtouint_from_user(s, count, base, res); |
| 462 | } |
| 463 | |
| 464 | static inline int __must_check kstrtos32_from_user(const char __user *s, size_t count, unsigned int base, s32 *res) |
| 465 | { |
| 466 | return kstrtoint_from_user(s, count, base, res); |
| 467 | } |
| 468 | |
Joe Perches | 67d0a07 | 2011-10-31 17:13:10 -0700 | [diff] [blame] | 469 | /* Obsolete, do not use. Use kstrto<foo> instead */ |
| 470 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 471 | extern unsigned long simple_strtoul(const char *,char **,unsigned int); |
| 472 | extern long simple_strtol(const char *,char **,unsigned int); |
| 473 | extern unsigned long long simple_strtoull(const char *,char **,unsigned int); |
| 474 | extern long long simple_strtoll(const char *,char **,unsigned int); |
Alexey Dobriyan | 33ee3b2 | 2011-03-22 16:34:40 -0700 | [diff] [blame] | 475 | |
Andrei Vagin | d1be35c | 2018-04-10 16:31:16 -0700 | [diff] [blame] | 476 | extern int num_to_str(char *buf, int size, |
| 477 | unsigned long long num, unsigned int width); |
KAMEZAWA Hiroyuki | 1ac101a | 2012-03-23 15:02:54 -0700 | [diff] [blame] | 478 | |
Joe Perches | 67d0a07 | 2011-10-31 17:13:10 -0700 | [diff] [blame] | 479 | /* lib/printf utilities */ |
| 480 | |
Joe Perches | b9075fa | 2011-10-31 17:11:33 -0700 | [diff] [blame] | 481 | extern __printf(2, 3) int sprintf(char *buf, const char * fmt, ...); |
| 482 | extern __printf(2, 0) int vsprintf(char *buf, const char *, va_list); |
| 483 | extern __printf(3, 4) |
| 484 | int snprintf(char *buf, size_t size, const char *fmt, ...); |
| 485 | extern __printf(3, 0) |
| 486 | int vsnprintf(char *buf, size_t size, const char *fmt, va_list args); |
| 487 | extern __printf(3, 4) |
| 488 | int scnprintf(char *buf, size_t size, const char *fmt, ...); |
| 489 | extern __printf(3, 0) |
| 490 | int vscnprintf(char *buf, size_t size, const char *fmt, va_list args); |
Rasmus Villemoes | 48a27055 | 2016-05-19 17:10:55 -0700 | [diff] [blame] | 491 | extern __printf(2, 3) __malloc |
Joe Perches | b9075fa | 2011-10-31 17:11:33 -0700 | [diff] [blame] | 492 | char *kasprintf(gfp_t gfp, const char *fmt, ...); |
Rasmus Villemoes | 48a27055 | 2016-05-19 17:10:55 -0700 | [diff] [blame] | 493 | extern __printf(2, 0) __malloc |
Nicolas Iooss | 8db1486 | 2015-07-17 16:23:42 -0700 | [diff] [blame] | 494 | char *kvasprintf(gfp_t gfp, const char *fmt, va_list args); |
Rasmus Villemoes | 0a9df78 | 2015-11-06 16:31:20 -0800 | [diff] [blame] | 495 | extern __printf(2, 0) |
| 496 | const char *kvasprintf_const(gfp_t gfp, const char *fmt, va_list args); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 497 | |
Joe Perches | 6061d94 | 2012-03-23 15:02:16 -0700 | [diff] [blame] | 498 | extern __scanf(2, 3) |
| 499 | int sscanf(const char *, const char *, ...); |
| 500 | extern __scanf(2, 0) |
| 501 | int vsscanf(const char *, const char *, va_list); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 502 | |
| 503 | extern int get_option(char **str, int *pint); |
| 504 | extern char *get_options(const char *str, int nints, int *ints); |
Jeremy Fitzhardinge | d974ae3 | 2008-07-24 16:27:46 -0700 | [diff] [blame] | 505 | extern unsigned long long memparse(const char *ptr, char **retptr); |
Dave Young | 6ccc72b8 | 2014-08-14 17:15:27 +0800 | [diff] [blame] | 506 | extern bool parse_option_str(const char *str, const char *option); |
Baoquan He | f51b17c | 2017-04-17 21:34:56 +0800 | [diff] [blame] | 507 | extern char *next_arg(char *args, char **param, char **val); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 508 | |
Trent Piepho | 5e37661 | 2006-05-15 09:44:06 -0700 | [diff] [blame] | 509 | extern int core_kernel_text(unsigned long addr); |
Josh Poimboeuf | 9fbcc57 | 2018-02-20 11:37:53 -0600 | [diff] [blame] | 510 | extern int init_kernel_text(unsigned long addr); |
Steven Rostedt | cdbe61b | 2011-05-05 21:14:55 -0400 | [diff] [blame] | 511 | extern int core_kernel_data(unsigned long addr); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 512 | extern int __kernel_text_address(unsigned long addr); |
| 513 | extern int kernel_text_address(unsigned long addr); |
Arjan van de Ven | ab7476c | 2008-08-15 15:29:38 -0700 | [diff] [blame] | 514 | extern int func_ptr_is_kernel_text(void *ptr); |
Arjan van de Ven | ab7476c | 2008-08-15 15:29:38 -0700 | [diff] [blame] | 515 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 516 | unsigned long int_sqrt(unsigned long); |
| 517 | |
Crt Mori | 47a3616 | 2018-01-11 11:19:57 +0100 | [diff] [blame] | 518 | #if BITS_PER_LONG < 64 |
| 519 | u32 int_sqrt64(u64 x); |
| 520 | #else |
| 521 | static inline u32 int_sqrt64(u64 x) |
| 522 | { |
| 523 | return (u32)int_sqrt(x); |
| 524 | } |
| 525 | #endif |
| 526 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 527 | extern void bust_spinlocks(int yes); |
| 528 | extern int oops_in_progress; /* If set, an oops, panic(), BUG() or die() is in progress */ |
Adrian Bunk | aa72710 | 2006-04-10 22:53:59 -0700 | [diff] [blame] | 529 | extern int panic_timeout; |
Feng Tang | 81c9d43 | 2019-01-03 15:28:20 -0800 | [diff] [blame^] | 530 | extern unsigned long panic_print; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 531 | extern int panic_on_oops; |
Don Zickus | 8da5add | 2006-09-26 10:52:27 +0200 | [diff] [blame] | 532 | extern int panic_on_unrecovered_nmi; |
Kurt Garloff | 5211a24 | 2009-06-24 14:32:11 -0700 | [diff] [blame] | 533 | extern int panic_on_io_nmi; |
Prarit Bhargava | 9e3961a | 2014-12-10 15:45:50 -0800 | [diff] [blame] | 534 | extern int panic_on_warn; |
Daniel Bristot de Oliveira | 088e9d2 | 2016-06-02 13:51:41 -0300 | [diff] [blame] | 535 | extern int sysctl_panic_on_rcu_stall; |
Mitsuo Hayasaka | 55af779 | 2011-11-29 15:08:36 +0900 | [diff] [blame] | 536 | extern int sysctl_panic_on_stackoverflow; |
HATAYAMA Daisuke | 5375b70 | 2015-06-30 14:57:46 -0700 | [diff] [blame] | 537 | |
| 538 | extern bool crash_kexec_post_notifiers; |
| 539 | |
Jason Baron | 5800dc3 | 2013-11-25 23:23:04 +0000 | [diff] [blame] | 540 | /* |
Hidehiro Kawai | 1717f20 | 2015-12-14 11:19:09 +0100 | [diff] [blame] | 541 | * panic_cpu is used for synchronizing panic() and crash_kexec() execution. It |
| 542 | * holds a CPU number which is executing panic() currently. A value of |
| 543 | * PANIC_CPU_INVALID means no CPU has entered panic() or crash_kexec(). |
| 544 | */ |
| 545 | extern atomic_t panic_cpu; |
| 546 | #define PANIC_CPU_INVALID -1 |
| 547 | |
| 548 | /* |
Jason Baron | 5800dc3 | 2013-11-25 23:23:04 +0000 | [diff] [blame] | 549 | * Only to be used by arch init code. If the user over-wrote the default |
| 550 | * CONFIG_PANIC_TIMEOUT, honor it. |
| 551 | */ |
| 552 | static inline void set_arch_panic_timeout(int timeout, int arch_default_timeout) |
| 553 | { |
| 554 | if (panic_timeout == arch_default_timeout) |
| 555 | panic_timeout = timeout; |
| 556 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 557 | extern const char *print_tainted(void); |
Rusty Russell | 373d4d0 | 2013-01-21 17:17:39 +1030 | [diff] [blame] | 558 | enum lockdep_ok { |
| 559 | LOCKDEP_STILL_OK, |
| 560 | LOCKDEP_NOW_UNRELIABLE |
| 561 | }; |
| 562 | extern void add_taint(unsigned flag, enum lockdep_ok); |
Andi Kleen | 25ddbb1 | 2008-10-15 22:01:41 -0700 | [diff] [blame] | 563 | extern int test_taint(unsigned flag); |
| 564 | extern unsigned long get_taint(void); |
David Howells | b920de1 | 2008-02-08 04:19:31 -0800 | [diff] [blame] | 565 | extern int root_mountflags; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 566 | |
Tejun Heo | 2ce802f | 2011-01-20 12:06:35 +0100 | [diff] [blame] | 567 | extern bool early_boot_irqs_disabled; |
| 568 | |
Thomas Gleixner | 69a78ff | 2017-05-16 20:42:47 +0200 | [diff] [blame] | 569 | /* |
| 570 | * Values used for system_state. Ordering of the states must not be changed |
| 571 | * as code checks for <, <=, >, >= STATE. |
| 572 | */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 573 | extern enum system_states { |
| 574 | SYSTEM_BOOTING, |
Thomas Gleixner | 69a78ff | 2017-05-16 20:42:47 +0200 | [diff] [blame] | 575 | SYSTEM_SCHEDULING, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 576 | SYSTEM_RUNNING, |
| 577 | SYSTEM_HALT, |
| 578 | SYSTEM_POWER_OFF, |
| 579 | SYSTEM_RESTART, |
Thomas Gleixner | c1a957d | 2018-05-25 17:54:41 +0200 | [diff] [blame] | 580 | SYSTEM_SUSPEND, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 581 | } system_state; |
| 582 | |
Kees Cook | 47d4b26 | 2018-04-10 16:32:26 -0700 | [diff] [blame] | 583 | /* This cannot be an enum because some may be used in assembly source. */ |
Andi Kleen | 25ddbb1 | 2008-10-15 22:01:41 -0700 | [diff] [blame] | 584 | #define TAINT_PROPRIETARY_MODULE 0 |
| 585 | #define TAINT_FORCED_MODULE 1 |
Dave Jones | 8c90487 | 2014-02-26 10:49:49 -0500 | [diff] [blame] | 586 | #define TAINT_CPU_OUT_OF_SPEC 2 |
Andi Kleen | 25ddbb1 | 2008-10-15 22:01:41 -0700 | [diff] [blame] | 587 | #define TAINT_FORCED_RMMOD 3 |
| 588 | #define TAINT_MACHINE_CHECK 4 |
| 589 | #define TAINT_BAD_PAGE 5 |
| 590 | #define TAINT_USER 6 |
| 591 | #define TAINT_DIE 7 |
| 592 | #define TAINT_OVERRIDDEN_ACPI_TABLE 8 |
| 593 | #define TAINT_WARN 9 |
Linus Torvalds | 26e9a39 | 2008-10-17 09:50:12 -0700 | [diff] [blame] | 594 | #define TAINT_CRAP 10 |
Ben Hutchings | 92946bc | 2010-04-03 19:36:42 +0100 | [diff] [blame] | 595 | #define TAINT_FIRMWARE_WORKAROUND 11 |
Ben Hutchings | 2449b8b | 2011-10-24 15:12:28 +0200 | [diff] [blame] | 596 | #define TAINT_OOT_MODULE 12 |
Mathieu Desnoyers | 66cc69e | 2014-03-13 12:11:30 +1030 | [diff] [blame] | 597 | #define TAINT_UNSIGNED_MODULE 13 |
Josh Hunt | 69361ee | 2014-08-08 14:22:31 -0700 | [diff] [blame] | 598 | #define TAINT_SOFTLOCKUP 14 |
Seth Jennings | c5f4546 | 2014-12-16 11:58:18 -0600 | [diff] [blame] | 599 | #define TAINT_LIVEPATCH 15 |
Borislav Petkov | 4efb442c | 2017-11-17 15:30:38 -0800 | [diff] [blame] | 600 | #define TAINT_AUX 16 |
Kees Cook | bc4f2f5 | 2018-04-10 16:32:33 -0700 | [diff] [blame] | 601 | #define TAINT_RANDSTRUCT 17 |
| 602 | #define TAINT_FLAGS_COUNT 18 |
Petr Mladek | 7fd8329 | 2016-09-21 13:47:22 +0200 | [diff] [blame] | 603 | |
| 604 | struct taint_flag { |
Larry Finger | 5eb7c0d | 2017-01-01 20:25:25 -0600 | [diff] [blame] | 605 | char c_true; /* character printed when tainted */ |
| 606 | char c_false; /* character printed when not tainted */ |
Petr Mladek | 7fd8329 | 2016-09-21 13:47:22 +0200 | [diff] [blame] | 607 | bool module; /* also show as a per-module taint flag */ |
| 608 | }; |
| 609 | |
| 610 | extern const struct taint_flag taint_flags[TAINT_FLAGS_COUNT]; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 611 | |
Harvey Harrison | 3fc9577 | 2008-05-14 16:05:49 -0700 | [diff] [blame] | 612 | extern const char hex_asc[]; |
| 613 | #define hex_asc_lo(x) hex_asc[((x) & 0x0f)] |
| 614 | #define hex_asc_hi(x) hex_asc[((x) & 0xf0) >> 4] |
| 615 | |
Andy Shevchenko | 55036ba | 2011-10-31 17:12:41 -0700 | [diff] [blame] | 616 | static inline char *hex_byte_pack(char *buf, u8 byte) |
Harvey Harrison | 3fc9577 | 2008-05-14 16:05:49 -0700 | [diff] [blame] | 617 | { |
| 618 | *buf++ = hex_asc_hi(byte); |
| 619 | *buf++ = hex_asc_lo(byte); |
| 620 | return buf; |
| 621 | } |
Randy Dunlap | 99eaf3c | 2007-05-10 22:22:39 -0700 | [diff] [blame] | 622 | |
Andre Naujoks | c26d436 | 2013-09-13 19:37:12 +0200 | [diff] [blame] | 623 | extern const char hex_asc_upper[]; |
| 624 | #define hex_asc_upper_lo(x) hex_asc_upper[((x) & 0x0f)] |
| 625 | #define hex_asc_upper_hi(x) hex_asc_upper[((x) & 0xf0) >> 4] |
| 626 | |
| 627 | static inline char *hex_byte_pack_upper(char *buf, u8 byte) |
| 628 | { |
| 629 | *buf++ = hex_asc_upper_hi(byte); |
| 630 | *buf++ = hex_asc_upper_lo(byte); |
| 631 | return buf; |
| 632 | } |
| 633 | |
Andy Shevchenko | 90378889 | 2010-05-24 14:33:23 -0700 | [diff] [blame] | 634 | extern int hex_to_bin(char ch); |
Mimi Zohar | b780498 | 2011-09-20 11:23:49 -0400 | [diff] [blame] | 635 | extern int __must_check hex2bin(u8 *dst, const char *src, size_t count); |
David Howells | 53d91c5 | 2014-09-16 17:36:01 +0100 | [diff] [blame] | 636 | extern char *bin2hex(char *dst, const void *src, size_t count); |
Andy Shevchenko | 90378889 | 2010-05-24 14:33:23 -0700 | [diff] [blame] | 637 | |
Joe Perches | a69f5ed | 2014-06-24 11:20:48 -0700 | [diff] [blame] | 638 | bool mac_pton(const char *s, u8 *mac); |
Andy Shevchenko | 4cd5773 | 2013-06-04 19:46:26 +0300 | [diff] [blame] | 639 | |
Joe Perches | 8a64f33 | 2009-12-14 18:00:25 -0800 | [diff] [blame] | 640 | /* |
Ingo Molnar | 526211b | 2009-03-05 10:28:45 +0100 | [diff] [blame] | 641 | * General tracing related utility functions - trace_printk(), |
Steven Rostedt | 2002c25 | 2009-03-05 10:35:56 -0500 | [diff] [blame] | 642 | * tracing_on/tracing_off and tracing_start()/tracing_stop |
| 643 | * |
| 644 | * Use tracing_on/tracing_off when you want to quickly turn on or off |
| 645 | * tracing. It simply enables or disables the recording of the trace events. |
GeunSik Lim | 156f5a7 | 2009-06-02 15:01:37 +0900 | [diff] [blame] | 646 | * This also corresponds to the user space /sys/kernel/debug/tracing/tracing_on |
Steven Rostedt | 2002c25 | 2009-03-05 10:35:56 -0500 | [diff] [blame] | 647 | * file, which gives a means for the kernel and userspace to interact. |
| 648 | * Place a tracing_off() in the kernel where you want tracing to end. |
| 649 | * From user space, examine the trace, and then echo 1 > tracing_on |
| 650 | * to continue tracing. |
| 651 | * |
| 652 | * tracing_stop/tracing_start has slightly more overhead. It is used |
| 653 | * by things like suspend to ram where disabling the recording of the |
| 654 | * trace is not enough, but tracing must actually stop because things |
| 655 | * like calling smp_processor_id() may crash the system. |
| 656 | * |
| 657 | * Most likely, you want to use tracing_on/tracing_off. |
Ingo Molnar | 526211b | 2009-03-05 10:28:45 +0100 | [diff] [blame] | 658 | */ |
Frederic Weisbecker | cecbca9 | 2010-04-18 19:08:41 +0200 | [diff] [blame] | 659 | |
| 660 | enum ftrace_dump_mode { |
| 661 | DUMP_NONE, |
| 662 | DUMP_ALL, |
| 663 | DUMP_ORIG, |
| 664 | }; |
| 665 | |
Ingo Molnar | 526211b | 2009-03-05 10:28:45 +0100 | [diff] [blame] | 666 | #ifdef CONFIG_TRACING |
Steven Rostedt | 93d68e5 | 2012-03-20 12:28:29 -0400 | [diff] [blame] | 667 | void tracing_on(void); |
| 668 | void tracing_off(void); |
| 669 | int tracing_is_on(void); |
Steven Rostedt (Red Hat) | ad909e2 | 2013-03-06 21:45:37 -0500 | [diff] [blame] | 670 | void tracing_snapshot(void); |
| 671 | void tracing_snapshot_alloc(void); |
Steven Rostedt | 93d68e5 | 2012-03-20 12:28:29 -0400 | [diff] [blame] | 672 | |
Ingo Molnar | 526211b | 2009-03-05 10:28:45 +0100 | [diff] [blame] | 673 | extern void tracing_start(void); |
| 674 | extern void tracing_stop(void); |
Ingo Molnar | 526211b | 2009-03-05 10:28:45 +0100 | [diff] [blame] | 675 | |
Joe Perches | b9075fa | 2011-10-31 17:11:33 -0700 | [diff] [blame] | 676 | static inline __printf(1, 2) |
| 677 | void ____trace_printk_check_format(const char *fmt, ...) |
Frederic Weisbecker | 769b044 | 2009-03-06 17:21:49 +0100 | [diff] [blame] | 678 | { |
| 679 | } |
| 680 | #define __trace_printk_check_format(fmt, args...) \ |
| 681 | do { \ |
| 682 | if (0) \ |
| 683 | ____trace_printk_check_format(fmt, ##args); \ |
| 684 | } while (0) |
| 685 | |
Ingo Molnar | 526211b | 2009-03-05 10:28:45 +0100 | [diff] [blame] | 686 | /** |
| 687 | * trace_printk - printf formatting in the ftrace buffer |
| 688 | * @fmt: the printf format for printing |
| 689 | * |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 690 | * Note: __trace_printk is an internal function for trace_printk() and |
| 691 | * the @ip is passed in via the trace_printk() macro. |
Ingo Molnar | 526211b | 2009-03-05 10:28:45 +0100 | [diff] [blame] | 692 | * |
| 693 | * This function allows a kernel developer to debug fast path sections |
| 694 | * that printk is not appropriate for. By scattering in various |
| 695 | * printk like tracing in the code, a developer can quickly see |
| 696 | * where problems are occurring. |
| 697 | * |
| 698 | * This is intended as a debugging tool for the developer only. |
| 699 | * Please refrain from leaving trace_printks scattered around in |
Steven Rostedt (Red Hat) | 09ae723 | 2013-03-08 21:02:34 -0500 | [diff] [blame] | 700 | * your code. (Extra memory is used for special buffers that are |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 701 | * allocated when trace_printk() is used.) |
Steven Rostedt (Red Hat) | 9d3c752c | 2013-03-08 22:11:57 -0500 | [diff] [blame] | 702 | * |
Wei Wang | 8730662 | 2018-04-24 14:22:38 -0700 | [diff] [blame] | 703 | * A little optimization trick is done here. If there's only one |
Steven Rostedt (Red Hat) | 9d3c752c | 2013-03-08 22:11:57 -0500 | [diff] [blame] | 704 | * argument, there's no need to scan the string for printf formats. |
| 705 | * The trace_puts() will suffice. But how can we take advantage of |
| 706 | * using trace_puts() when trace_printk() has only one argument? |
| 707 | * By stringifying the args and checking the size we can tell |
| 708 | * whether or not there are args. __stringify((__VA_ARGS__)) will |
| 709 | * turn into "()\0" with a size of 3 when there are no args, anything |
| 710 | * else will be bigger. All we need to do is define a string to this, |
| 711 | * and then take its size and compare to 3. If it's bigger, use |
| 712 | * do_trace_printk() otherwise, optimize it to trace_puts(). Then just |
| 713 | * let gcc optimize the rest. |
Ingo Molnar | 526211b | 2009-03-05 10:28:45 +0100 | [diff] [blame] | 714 | */ |
Frederic Weisbecker | 769b044 | 2009-03-06 17:21:49 +0100 | [diff] [blame] | 715 | |
Steven Rostedt (Red Hat) | 9d3c752c | 2013-03-08 22:11:57 -0500 | [diff] [blame] | 716 | #define trace_printk(fmt, ...) \ |
| 717 | do { \ |
| 718 | char _______STR[] = __stringify((__VA_ARGS__)); \ |
| 719 | if (sizeof(_______STR) > 3) \ |
| 720 | do_trace_printk(fmt, ##__VA_ARGS__); \ |
| 721 | else \ |
| 722 | trace_puts(fmt); \ |
| 723 | } while (0) |
| 724 | |
| 725 | #define do_trace_printk(fmt, args...) \ |
Frederic Weisbecker | 769b044 | 2009-03-06 17:21:49 +0100 | [diff] [blame] | 726 | do { \ |
Steven Rostedt (Red Hat) | 3debb0a | 2016-03-22 17:30:58 -0400 | [diff] [blame] | 727 | static const char *trace_printk_fmt __used \ |
Steven Rostedt | 07d777f | 2011-09-22 14:01:55 -0400 | [diff] [blame] | 728 | __attribute__((section("__trace_printk_fmt"))) = \ |
| 729 | __builtin_constant_p(fmt) ? fmt : NULL; \ |
Frederic Weisbecker | 48ead02 | 2009-03-12 18:24:49 +0100 | [diff] [blame] | 730 | \ |
Steven Rostedt | 07d777f | 2011-09-22 14:01:55 -0400 | [diff] [blame] | 731 | __trace_printk_check_format(fmt, ##args); \ |
| 732 | \ |
| 733 | if (__builtin_constant_p(fmt)) \ |
Frederic Weisbecker | 48ead02 | 2009-03-12 18:24:49 +0100 | [diff] [blame] | 734 | __trace_bprintk(_THIS_IP_, trace_printk_fmt, ##args); \ |
Steven Rostedt | 07d777f | 2011-09-22 14:01:55 -0400 | [diff] [blame] | 735 | else \ |
| 736 | __trace_printk(_THIS_IP_, fmt, ##args); \ |
Frederic Weisbecker | 769b044 | 2009-03-06 17:21:49 +0100 | [diff] [blame] | 737 | } while (0) |
| 738 | |
Joe Perches | b9075fa | 2011-10-31 17:11:33 -0700 | [diff] [blame] | 739 | extern __printf(2, 3) |
| 740 | int __trace_bprintk(unsigned long ip, const char *fmt, ...); |
Frederic Weisbecker | 48ead02 | 2009-03-12 18:24:49 +0100 | [diff] [blame] | 741 | |
Joe Perches | b9075fa | 2011-10-31 17:11:33 -0700 | [diff] [blame] | 742 | extern __printf(2, 3) |
| 743 | int __trace_printk(unsigned long ip, const char *fmt, ...); |
Frederic Weisbecker | 769b044 | 2009-03-06 17:21:49 +0100 | [diff] [blame] | 744 | |
Steven Rostedt (Red Hat) | 09ae723 | 2013-03-08 21:02:34 -0500 | [diff] [blame] | 745 | /** |
| 746 | * trace_puts - write a string into the ftrace buffer |
| 747 | * @str: the string to record |
| 748 | * |
| 749 | * Note: __trace_bputs is an internal function for trace_puts and |
| 750 | * the @ip is passed in via the trace_puts macro. |
| 751 | * |
| 752 | * This is similar to trace_printk() but is made for those really fast |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 753 | * paths that a developer wants the least amount of "Heisenbug" effects, |
Steven Rostedt (Red Hat) | 09ae723 | 2013-03-08 21:02:34 -0500 | [diff] [blame] | 754 | * where the processing of the print format is still too much. |
| 755 | * |
| 756 | * This function allows a kernel developer to debug fast path sections |
| 757 | * that printk is not appropriate for. By scattering in various |
| 758 | * printk like tracing in the code, a developer can quickly see |
| 759 | * where problems are occurring. |
| 760 | * |
| 761 | * This is intended as a debugging tool for the developer only. |
| 762 | * Please refrain from leaving trace_puts scattered around in |
| 763 | * your code. (Extra memory is used for special buffers that are |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 764 | * allocated when trace_puts() is used.) |
Steven Rostedt (Red Hat) | 09ae723 | 2013-03-08 21:02:34 -0500 | [diff] [blame] | 765 | * |
| 766 | * Returns: 0 if nothing was written, positive # if string was. |
| 767 | * (1 when __trace_bputs is used, strlen(str) when __trace_puts is used) |
| 768 | */ |
| 769 | |
Steven Rostedt (Red Hat) | 09ae723 | 2013-03-08 21:02:34 -0500 | [diff] [blame] | 770 | #define trace_puts(str) ({ \ |
Steven Rostedt (Red Hat) | 3debb0a | 2016-03-22 17:30:58 -0400 | [diff] [blame] | 771 | static const char *trace_printk_fmt __used \ |
Steven Rostedt (Red Hat) | 09ae723 | 2013-03-08 21:02:34 -0500 | [diff] [blame] | 772 | __attribute__((section("__trace_printk_fmt"))) = \ |
| 773 | __builtin_constant_p(str) ? str : NULL; \ |
| 774 | \ |
| 775 | if (__builtin_constant_p(str)) \ |
| 776 | __trace_bputs(_THIS_IP_, trace_printk_fmt); \ |
| 777 | else \ |
| 778 | __trace_puts(_THIS_IP_, str, strlen(str)); \ |
| 779 | }) |
Steven Rostedt | bcf312c | 2013-05-02 11:26:13 -0400 | [diff] [blame] | 780 | extern int __trace_bputs(unsigned long ip, const char *str); |
| 781 | extern int __trace_puts(unsigned long ip, const char *str, int size); |
Steven Rostedt (Red Hat) | 09ae723 | 2013-03-08 21:02:34 -0500 | [diff] [blame] | 782 | |
Steven Rostedt (Red Hat) | c142be8 | 2013-03-13 09:55:57 -0400 | [diff] [blame] | 783 | extern void trace_dump_stack(int skip); |
Steven Rostedt | 0388938 | 2009-12-11 09:48:22 -0500 | [diff] [blame] | 784 | |
Frederic Weisbecker | 48ead02 | 2009-03-12 18:24:49 +0100 | [diff] [blame] | 785 | /* |
| 786 | * The double __builtin_constant_p is because gcc will give us an error |
| 787 | * if we try to allocate the static variable to fmt if it is not a |
| 788 | * constant. Even with the outer if statement. |
| 789 | */ |
Frederic Weisbecker | 769b044 | 2009-03-06 17:21:49 +0100 | [diff] [blame] | 790 | #define ftrace_vprintk(fmt, vargs) \ |
| 791 | do { \ |
Frederic Weisbecker | 48ead02 | 2009-03-12 18:24:49 +0100 | [diff] [blame] | 792 | if (__builtin_constant_p(fmt)) { \ |
Steven Rostedt (Red Hat) | 3debb0a | 2016-03-22 17:30:58 -0400 | [diff] [blame] | 793 | static const char *trace_printk_fmt __used \ |
Frederic Weisbecker | 48ead02 | 2009-03-12 18:24:49 +0100 | [diff] [blame] | 794 | __attribute__((section("__trace_printk_fmt"))) = \ |
| 795 | __builtin_constant_p(fmt) ? fmt : NULL; \ |
Ingo Molnar | 7bffc23 | 2009-03-09 10:11:36 +0100 | [diff] [blame] | 796 | \ |
Frederic Weisbecker | 48ead02 | 2009-03-12 18:24:49 +0100 | [diff] [blame] | 797 | __ftrace_vbprintk(_THIS_IP_, trace_printk_fmt, vargs); \ |
| 798 | } else \ |
| 799 | __ftrace_vprintk(_THIS_IP_, fmt, vargs); \ |
Frederic Weisbecker | 769b044 | 2009-03-06 17:21:49 +0100 | [diff] [blame] | 800 | } while (0) |
| 801 | |
Nicolas Iooss | 8db1486 | 2015-07-17 16:23:42 -0700 | [diff] [blame] | 802 | extern __printf(2, 0) int |
Frederic Weisbecker | 48ead02 | 2009-03-12 18:24:49 +0100 | [diff] [blame] | 803 | __ftrace_vbprintk(unsigned long ip, const char *fmt, va_list ap); |
| 804 | |
Nicolas Iooss | 8db1486 | 2015-07-17 16:23:42 -0700 | [diff] [blame] | 805 | extern __printf(2, 0) int |
Ingo Molnar | 526211b | 2009-03-05 10:28:45 +0100 | [diff] [blame] | 806 | __ftrace_vprintk(unsigned long ip, const char *fmt, va_list ap); |
Frederic Weisbecker | 769b044 | 2009-03-06 17:21:49 +0100 | [diff] [blame] | 807 | |
Frederic Weisbecker | cecbca9 | 2010-04-18 19:08:41 +0200 | [diff] [blame] | 808 | extern void ftrace_dump(enum ftrace_dump_mode oops_dump_mode); |
Ingo Molnar | 526211b | 2009-03-05 10:28:45 +0100 | [diff] [blame] | 809 | #else |
Ingo Molnar | 526211b | 2009-03-05 10:28:45 +0100 | [diff] [blame] | 810 | static inline void tracing_start(void) { } |
| 811 | static inline void tracing_stop(void) { } |
Dhaval Giani | e67bc51 | 2013-08-02 14:47:29 -0400 | [diff] [blame] | 812 | static inline void trace_dump_stack(int skip) { } |
Steven Rostedt | 93d68e5 | 2012-03-20 12:28:29 -0400 | [diff] [blame] | 813 | |
| 814 | static inline void tracing_on(void) { } |
| 815 | static inline void tracing_off(void) { } |
| 816 | static inline int tracing_is_on(void) { return 0; } |
Steven Rostedt (Red Hat) | ad909e2 | 2013-03-06 21:45:37 -0500 | [diff] [blame] | 817 | static inline void tracing_snapshot(void) { } |
| 818 | static inline void tracing_snapshot_alloc(void) { } |
Steven Rostedt | 93d68e5 | 2012-03-20 12:28:29 -0400 | [diff] [blame] | 819 | |
Michal Hocko | 60efc15 | 2012-10-25 15:41:51 +0200 | [diff] [blame] | 820 | static inline __printf(1, 2) |
| 821 | int trace_printk(const char *fmt, ...) |
Ingo Molnar | 526211b | 2009-03-05 10:28:45 +0100 | [diff] [blame] | 822 | { |
| 823 | return 0; |
| 824 | } |
Nicolas Iooss | 8db1486 | 2015-07-17 16:23:42 -0700 | [diff] [blame] | 825 | static __printf(1, 0) inline int |
Ingo Molnar | 526211b | 2009-03-05 10:28:45 +0100 | [diff] [blame] | 826 | ftrace_vprintk(const char *fmt, va_list ap) |
| 827 | { |
| 828 | return 0; |
| 829 | } |
Frederic Weisbecker | cecbca9 | 2010-04-18 19:08:41 +0200 | [diff] [blame] | 830 | static inline void ftrace_dump(enum ftrace_dump_mode oops_dump_mode) { } |
Frederic Weisbecker | 769b044 | 2009-03-06 17:21:49 +0100 | [diff] [blame] | 831 | #endif /* CONFIG_TRACING */ |
Ingo Molnar | 526211b | 2009-03-05 10:28:45 +0100 | [diff] [blame] | 832 | |
| 833 | /* |
Kees Cook | 3c8ba0d | 2018-03-30 18:52:36 -0700 | [diff] [blame] | 834 | * min()/max()/clamp() macros must accomplish three things: |
| 835 | * |
| 836 | * - avoid multiple evaluations of the arguments (so side-effects like |
| 837 | * "x++" happen only once) when non-constant. |
| 838 | * - perform strict type-checking (to generate warnings instead of |
| 839 | * nasty runtime surprises). See the "unnecessary" pointer comparison |
| 840 | * in __typecheck(). |
| 841 | * - retain result as a constant expressions when called with only |
| 842 | * constant expressions (to avoid tripping VLA warnings in stack |
| 843 | * allocation usage). |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 844 | */ |
Kees Cook | 3c8ba0d | 2018-03-30 18:52:36 -0700 | [diff] [blame] | 845 | #define __typecheck(x, y) \ |
| 846 | (!!(sizeof((typeof(x) *)1 == (typeof(y) *)1))) |
| 847 | |
| 848 | /* |
| 849 | * This returns a constant expression while determining if an argument is |
| 850 | * a constant expression, most importantly without evaluating the argument. |
| 851 | * Glory to Martin Uecker <Martin.Uecker@med.uni-goettingen.de> |
| 852 | */ |
| 853 | #define __is_constexpr(x) \ |
| 854 | (sizeof(int) == sizeof(*(8 ? ((void *)((long)(x) * 0l)) : (int *)8))) |
| 855 | |
| 856 | #define __no_side_effects(x, y) \ |
| 857 | (__is_constexpr(x) && __is_constexpr(y)) |
| 858 | |
| 859 | #define __safe_cmp(x, y) \ |
| 860 | (__typecheck(x, y) && __no_side_effects(x, y)) |
| 861 | |
| 862 | #define __cmp(x, y, op) ((x) op (y) ? (x) : (y)) |
| 863 | |
Linus Torvalds | e9092d0 | 2018-04-09 10:34:07 -0700 | [diff] [blame] | 864 | #define __cmp_once(x, y, unique_x, unique_y, op) ({ \ |
| 865 | typeof(x) unique_x = (x); \ |
| 866 | typeof(y) unique_y = (y); \ |
| 867 | __cmp(unique_x, unique_y, op); }) |
Kees Cook | 3c8ba0d | 2018-03-30 18:52:36 -0700 | [diff] [blame] | 868 | |
Linus Torvalds | e9092d0 | 2018-04-09 10:34:07 -0700 | [diff] [blame] | 869 | #define __careful_cmp(x, y, op) \ |
| 870 | __builtin_choose_expr(__safe_cmp(x, y), \ |
| 871 | __cmp(x, y, op), \ |
| 872 | __cmp_once(x, y, __UNIQUE_ID(__x), __UNIQUE_ID(__y), op)) |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 873 | |
| 874 | /** |
| 875 | * min - return minimum of two values of the same or compatible types |
| 876 | * @x: first value |
| 877 | * @y: second value |
| 878 | */ |
Kees Cook | 3c8ba0d | 2018-03-30 18:52:36 -0700 | [diff] [blame] | 879 | #define min(x, y) __careful_cmp(x, y, <) |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 880 | |
| 881 | /** |
| 882 | * max - return maximum of two values of the same or compatible types |
| 883 | * @x: first value |
| 884 | * @y: second value |
| 885 | */ |
Kees Cook | 3c8ba0d | 2018-03-30 18:52:36 -0700 | [diff] [blame] | 886 | #define max(x, y) __careful_cmp(x, y, >) |
Harvey Harrison | bdf4bba | 2008-04-30 00:54:55 -0700 | [diff] [blame] | 887 | |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 888 | /** |
| 889 | * min3 - return minimum of three values |
| 890 | * @x: first value |
| 891 | * @y: second value |
| 892 | * @z: third value |
| 893 | */ |
Michal Nazarewicz | 2e1d06e | 2014-10-09 15:30:13 -0700 | [diff] [blame] | 894 | #define min3(x, y, z) min((typeof(x))min(x, y), z) |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 895 | |
| 896 | /** |
| 897 | * max3 - return maximum of three values |
| 898 | * @x: first value |
| 899 | * @y: second value |
| 900 | * @z: third value |
| 901 | */ |
Michal Nazarewicz | 2e1d06e | 2014-10-09 15:30:13 -0700 | [diff] [blame] | 902 | #define max3(x, y, z) max((typeof(x))max(x, y), z) |
Hagen Paul Pfeifer | f27c85c | 2010-10-26 14:22:21 -0700 | [diff] [blame] | 903 | |
Harvey Harrison | bdf4bba | 2008-04-30 00:54:55 -0700 | [diff] [blame] | 904 | /** |
Martin K. Petersen | c8bf133 | 2010-09-10 20:07:38 +0200 | [diff] [blame] | 905 | * min_not_zero - return the minimum that is _not_ zero, unless both are zero |
| 906 | * @x: value1 |
| 907 | * @y: value2 |
| 908 | */ |
| 909 | #define min_not_zero(x, y) ({ \ |
| 910 | typeof(x) __x = (x); \ |
| 911 | typeof(y) __y = (y); \ |
| 912 | __x == 0 ? __y : ((__y == 0) ? __x : min(__x, __y)); }) |
| 913 | |
| 914 | /** |
Harvey Harrison | bdf4bba | 2008-04-30 00:54:55 -0700 | [diff] [blame] | 915 | * clamp - return a value clamped to a given range with strict typechecking |
| 916 | * @val: current value |
Michal Nazarewicz | 2e1d06e | 2014-10-09 15:30:13 -0700 | [diff] [blame] | 917 | * @lo: lowest allowable value |
| 918 | * @hi: highest allowable value |
Harvey Harrison | bdf4bba | 2008-04-30 00:54:55 -0700 | [diff] [blame] | 919 | * |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 920 | * This macro does strict typechecking of @lo/@hi to make sure they are of the |
| 921 | * same type as @val. See the unnecessary pointer comparisons. |
Harvey Harrison | bdf4bba | 2008-04-30 00:54:55 -0700 | [diff] [blame] | 922 | */ |
Michal Nazarewicz | 2e1d06e | 2014-10-09 15:30:13 -0700 | [diff] [blame] | 923 | #define clamp(val, lo, hi) min((typeof(val))max(val, lo), hi) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 924 | |
| 925 | /* |
| 926 | * ..and if you can't take the strict |
| 927 | * types, you can specify one yourself. |
| 928 | * |
Harvey Harrison | bdf4bba | 2008-04-30 00:54:55 -0700 | [diff] [blame] | 929 | * Or not use min/max/clamp at all, of course. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 930 | */ |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 931 | |
| 932 | /** |
| 933 | * min_t - return minimum of two values, using the specified type |
| 934 | * @type: data type to use |
| 935 | * @x: first value |
| 936 | * @y: second value |
| 937 | */ |
Kees Cook | 3c8ba0d | 2018-03-30 18:52:36 -0700 | [diff] [blame] | 938 | #define min_t(type, x, y) __careful_cmp((type)(x), (type)(y), <) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 939 | |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 940 | /** |
| 941 | * max_t - return maximum of two values, using the specified type |
| 942 | * @type: data type to use |
| 943 | * @x: first value |
| 944 | * @y: second value |
| 945 | */ |
Kees Cook | 3c8ba0d | 2018-03-30 18:52:36 -0700 | [diff] [blame] | 946 | #define max_t(type, x, y) __careful_cmp((type)(x), (type)(y), >) |
Harvey Harrison | bdf4bba | 2008-04-30 00:54:55 -0700 | [diff] [blame] | 947 | |
| 948 | /** |
| 949 | * clamp_t - return a value clamped to a given range using a given type |
| 950 | * @type: the type of variable to use |
| 951 | * @val: current value |
Michal Nazarewicz | c185b07 | 2014-10-09 15:30:15 -0700 | [diff] [blame] | 952 | * @lo: minimum allowable value |
| 953 | * @hi: maximum allowable value |
Harvey Harrison | bdf4bba | 2008-04-30 00:54:55 -0700 | [diff] [blame] | 954 | * |
| 955 | * This macro does no typechecking and uses temporary variables of type |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 956 | * @type to make all the comparisons. |
Harvey Harrison | bdf4bba | 2008-04-30 00:54:55 -0700 | [diff] [blame] | 957 | */ |
Michal Nazarewicz | c185b07 | 2014-10-09 15:30:15 -0700 | [diff] [blame] | 958 | #define clamp_t(type, val, lo, hi) min_t(type, max_t(type, val, lo), hi) |
Harvey Harrison | bdf4bba | 2008-04-30 00:54:55 -0700 | [diff] [blame] | 959 | |
| 960 | /** |
| 961 | * clamp_val - return a value clamped to a given range using val's type |
| 962 | * @val: current value |
Michal Nazarewicz | c185b07 | 2014-10-09 15:30:15 -0700 | [diff] [blame] | 963 | * @lo: minimum allowable value |
| 964 | * @hi: maximum allowable value |
Harvey Harrison | bdf4bba | 2008-04-30 00:54:55 -0700 | [diff] [blame] | 965 | * |
| 966 | * This macro does no typechecking and uses temporary variables of whatever |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 967 | * type the input argument @val is. This is useful when @val is an unsigned |
| 968 | * type and @lo and @hi are literals that will otherwise be assigned a signed |
Harvey Harrison | bdf4bba | 2008-04-30 00:54:55 -0700 | [diff] [blame] | 969 | * integer type. |
| 970 | */ |
Michal Nazarewicz | c185b07 | 2014-10-09 15:30:15 -0700 | [diff] [blame] | 971 | #define clamp_val(val, lo, hi) clamp_t(typeof(val), val, lo, hi) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 972 | |
Wu Fengguang | 91f68b7 | 2009-01-07 18:09:12 -0800 | [diff] [blame] | 973 | |
Randy Dunlap | e8c97af | 2017-10-13 15:58:11 -0700 | [diff] [blame] | 974 | /** |
| 975 | * swap - swap values of @a and @b |
| 976 | * @a: first value |
| 977 | * @b: second value |
Wu Fengguang | 91f68b7 | 2009-01-07 18:09:12 -0800 | [diff] [blame] | 978 | */ |
Peter Zijlstra | ac7b900 | 2009-02-04 15:11:59 -0800 | [diff] [blame] | 979 | #define swap(a, b) \ |
| 980 | do { typeof(a) __tmp = (a); (a) = (b); (b) = __tmp; } while (0) |
Wu Fengguang | 91f68b7 | 2009-01-07 18:09:12 -0800 | [diff] [blame] | 981 | |
Alexei Starovoitov | cf14f27 | 2018-03-28 12:05:36 -0700 | [diff] [blame] | 982 | /* This counts to 12. Any more, it will return 13th argument. */ |
| 983 | #define __COUNT_ARGS(_0, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _n, X...) _n |
| 984 | #define COUNT_ARGS(X...) __COUNT_ARGS(, ##X, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0) |
| 985 | |
| 986 | #define __CONCAT(a, b) a ## b |
| 987 | #define CONCATENATE(a, b) __CONCAT(a, b) |
| 988 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 989 | /** |
| 990 | * container_of - cast a member of a structure out to the containing structure |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 991 | * @ptr: the pointer to the member. |
| 992 | * @type: the type of the container struct this is embedded in. |
| 993 | * @member: the name of the member within the struct. |
| 994 | * |
| 995 | */ |
Ian Abbott | c7acec71 | 2017-07-12 14:33:04 -0700 | [diff] [blame] | 996 | #define container_of(ptr, type, member) ({ \ |
| 997 | void *__mptr = (void *)(ptr); \ |
| 998 | BUILD_BUG_ON_MSG(!__same_type(*(ptr), ((type *)0)->member) && \ |
| 999 | !__same_type(*(ptr), void), \ |
| 1000 | "pointer type mismatch in container_of()"); \ |
| 1001 | ((type *)(__mptr - offsetof(type, member))); }) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1002 | |
NeilBrown | 05e6557 | 2018-03-29 15:26:48 +1100 | [diff] [blame] | 1003 | /** |
| 1004 | * container_of_safe - cast a member of a structure out to the containing structure |
| 1005 | * @ptr: the pointer to the member. |
| 1006 | * @type: the type of the container struct this is embedded in. |
| 1007 | * @member: the name of the member within the struct. |
| 1008 | * |
| 1009 | * If IS_ERR_OR_NULL(ptr), ptr is returned unchanged. |
| 1010 | */ |
| 1011 | #define container_of_safe(ptr, type, member) ({ \ |
| 1012 | void *__mptr = (void *)(ptr); \ |
| 1013 | BUILD_BUG_ON_MSG(!__same_type(*(ptr), ((type *)0)->member) && \ |
| 1014 | !__same_type(*(ptr), void), \ |
| 1015 | "pointer type mismatch in container_of()"); \ |
Dan Carpenter | 227abcc | 2018-04-26 08:58:27 +0300 | [diff] [blame] | 1016 | IS_ERR_OR_NULL(__mptr) ? ERR_CAST(__mptr) : \ |
NeilBrown | 05e6557 | 2018-03-29 15:26:48 +1100 | [diff] [blame] | 1017 | ((type *)(__mptr - offsetof(type, member))); }) |
| 1018 | |
Arnaud Lacombe | b9d4f42 | 2011-07-25 17:13:03 -0700 | [diff] [blame] | 1019 | /* Rebuild everything on CONFIG_FTRACE_MCOUNT_RECORD */ |
| 1020 | #ifdef CONFIG_FTRACE_MCOUNT_RECORD |
| 1021 | # define REBUILD_DUE_TO_FTRACE_MCOUNT_RECORD |
| 1022 | #endif |
WANG Cong | 9d00f92 | 2011-07-25 17:13:02 -0700 | [diff] [blame] | 1023 | |
Rusty Russell | 58f86cc | 2014-03-24 12:00:34 +1030 | [diff] [blame] | 1024 | /* Permissions on a sysfs file: you didn't miss the 0 prefix did you? */ |
Gobinda Charan Maji | 28b8d0c | 2015-05-27 11:09:38 +0930 | [diff] [blame] | 1025 | #define VERIFY_OCTAL_PERMISSIONS(perms) \ |
| 1026 | (BUILD_BUG_ON_ZERO((perms) < 0) + \ |
| 1027 | BUILD_BUG_ON_ZERO((perms) > 0777) + \ |
| 1028 | /* USER_READABLE >= GROUP_READABLE >= OTHER_READABLE */ \ |
| 1029 | BUILD_BUG_ON_ZERO((((perms) >> 6) & 4) < (((perms) >> 3) & 4)) + \ |
| 1030 | BUILD_BUG_ON_ZERO((((perms) >> 3) & 4) < ((perms) & 4)) + \ |
| 1031 | /* USER_WRITABLE >= GROUP_WRITABLE */ \ |
| 1032 | BUILD_BUG_ON_ZERO((((perms) >> 6) & 2) < (((perms) >> 3) & 2)) + \ |
| 1033 | /* OTHER_WRITABLE? Generally considered a bad idea. */ \ |
| 1034 | BUILD_BUG_ON_ZERO((perms) & 2) + \ |
Rusty Russell | 58f86cc | 2014-03-24 12:00:34 +1030 | [diff] [blame] | 1035 | (perms)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1036 | #endif |