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