blob: 3b9d2bade8ad105e44440b3b33b0ae25f77b0e1f [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001/* SPDX-License-Identifier: GPL-2.0 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002#ifndef _LINUX_KERNEL_H
3#define _LINUX_KERNEL_H
4
Linus Torvalds1da177e2005-04-16 15:20:36 -07005
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 Howellsf0d1b0b2006-12-08 02:37:49 -080012#include <linux/log2.h>
Andrew Mortone0deaff42008-07-25 01:45:24 -070013#include <linux/typecheck.h>
Linus Torvalds968ab182010-11-15 13:37:37 -080014#include <linux/printk.h>
Ian Abbottc7acec712017-07-12 14:33:04 -070015#include <linux/build_bug.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070016#include <asm/byteorder.h>
Jani Nikulac461aed2019-03-07 16:26:32 -080017#include <asm/div64.h>
David Howells607ca462012-10-13 10:46:48 +010018#include <uapi/linux/kernel.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070019
Alexey Dobriyan4be929b2010-05-24 14:33:03 -070020#define USHRT_MAX ((u16)(~0U))
21#define SHRT_MAX ((s16)(USHRT_MAX>>1))
22#define SHRT_MIN ((s16)(-SHRT_MAX - 1))
Linus Torvalds1da177e2005-04-16 15:20:36 -070023#define INT_MAX ((int)(~0U>>1))
24#define INT_MIN (-INT_MAX - 1)
25#define UINT_MAX (~0U)
26#define LONG_MAX ((long)(~0UL>>1))
27#define LONG_MIN (-LONG_MAX - 1)
28#define ULONG_MAX (~0UL)
OGAWA Hirofumi111ebb62006-06-23 02:03:26 -070029#define LLONG_MAX ((long long)(~0ULL>>1))
30#define LLONG_MIN (-LLONG_MAX - 1)
31#define ULLONG_MAX (~0ULL)
Xi Wanga3860c12012-05-31 16:26:04 -070032#define SIZE_MAX (~(size_t)0)
Stefan Agner1c4bc432018-06-07 17:06:15 -070033#define PHYS_ADDR_MAX (~(phys_addr_t)0)
Linus Torvalds1da177e2005-04-16 15:20:36 -070034
Alex Elder89a07142014-01-23 15:54:00 -080035#define U8_MAX ((u8)~0U)
36#define S8_MAX ((s8)(U8_MAX>>1))
37#define S8_MIN ((s8)(-S8_MAX - 1))
38#define U16_MAX ((u16)~0U)
39#define S16_MAX ((s16)(U16_MAX>>1))
40#define S16_MIN ((s16)(-S16_MAX - 1))
41#define U32_MAX ((u32)~0U)
42#define S32_MAX ((s32)(U32_MAX>>1))
43#define S32_MIN ((s32)(-S32_MAX - 1))
44#define U64_MAX ((u64)~0ULL)
45#define S64_MAX ((s64)(U64_MAX>>1))
46#define S64_MIN ((s64)(-S64_MAX - 1))
47
Linus Torvalds1da177e2005-04-16 15:20:36 -070048#define STACK_MAGIC 0xdeadbeef
49
Randy Dunlape8c97af2017-10-13 15:58:11 -070050/**
51 * REPEAT_BYTE - repeat the value @x multiple times as an unsigned long value
52 * @x: value to repeat
53 *
54 * NOTE: @x is not checked for > 0xff; larger values produce odd results.
55 */
David S. Miller44696902012-05-23 20:12:50 -070056#define REPEAT_BYTE(x) ((~0ul / 0xff) * (x))
57
zijun_hu3ca45a42016-10-14 15:12:54 +080058/* @a is a power of 2 value */
Alexey Dobriyana79ff732010-04-13 11:21:46 +020059#define ALIGN(x, a) __ALIGN_KERNEL((x), (a))
Krzysztof Kozlowskied067d42017-04-11 20:08:34 +020060#define ALIGN_DOWN(x, a) __ALIGN_KERNEL((x) - ((a) - 1), (a))
Alexey Dobriyan9f93ff52010-04-13 14:09:15 +020061#define __ALIGN_MASK(x, mask) __ALIGN_KERNEL_MASK((x), (mask))
Matthew Wilcoxa83308e2007-09-11 15:23:47 -070062#define PTR_ALIGN(p, a) ((typeof(p))ALIGN((unsigned long)(p), (a)))
Herbert Xuf10db622008-02-06 01:37:05 -080063#define IS_ALIGNED(x, a) (((x) & ((typeof(x))(a) - 1)) == 0)
Linus Torvalds2ea58142006-11-26 19:05:22 -080064
Christoph Hellwigd3849952016-11-01 07:40:11 -060065/* generic data direction definitions */
66#define READ 0
67#define WRITE 1
68
Randy Dunlape8c97af2017-10-13 15:58:11 -070069/**
70 * ARRAY_SIZE - get the number of elements in array @arr
71 * @arr: array to be sized
72 */
Rusty Russellc5e631cf2007-05-06 14:51:05 -070073#define ARRAY_SIZE(arr) (sizeof(arr) / sizeof((arr)[0]) + __must_be_array(arr))
74
Gustavo Padovan3ed605b2016-04-26 12:32:27 -030075#define u64_to_user_ptr(x) ( \
76{ \
77 typecheck(u64, x); \
78 (void __user *)(uintptr_t)x; \
79} \
80)
81
Yinghai Lu9b3be9f2010-02-10 01:20:29 -080082/*
83 * This looks more complex than it should be. But we need to
84 * get the type for the ~ right in round_down (it needs to be
85 * as wide as the result!), and we want to evaluate the macro
86 * arguments just once each.
87 */
88#define __round_mask(x, y) ((__typeof__(x))((y)-1))
Kees Cookcedc5b62018-08-21 21:55:28 -070089/**
90 * round_up - round up to next specified power of 2
91 * @x: the value to round
92 * @y: multiple to round up to (must be a power of 2)
93 *
94 * Rounds @x up to next multiple of @y (which must be a power of 2).
95 * To perform arbitrary rounding up, use roundup() below.
96 */
Yinghai Lu9b3be9f2010-02-10 01:20:29 -080097#define round_up(x, y) ((((x)-1) | __round_mask(x, y))+1)
Kees Cookcedc5b62018-08-21 21:55:28 -070098/**
99 * round_down - round down to next specified power of 2
100 * @x: the value to round
101 * @y: multiple to round down to (must be a power of 2)
102 *
103 * Rounds @x down to next multiple of @y (which must be a power of 2).
104 * To perform arbitrary rounding down, use rounddown() below.
105 */
Yinghai Lu9b3be9f2010-02-10 01:20:29 -0800106#define round_down(x, y) ((x) & ~__round_mask(x, y))
107
Randy Dunlape8c97af2017-10-13 15:58:11 -0700108/**
109 * FIELD_SIZEOF - get the size of a struct's field
110 * @t: the target struct
111 * @f: the target struct's field
112 * Return: the size of @f in the struct definition without having a
113 * declared instance of @t.
114 */
Jan Beulich4552d5d2006-06-26 13:57:28 +0200115#define FIELD_SIZEOF(t, f) (sizeof(((t*)0)->f))
Randy Dunlape8c97af2017-10-13 15:58:11 -0700116
Nicolas Dichtelb5d37552016-03-04 11:52:16 +0100117#define DIV_ROUND_UP __KERNEL_DIV_ROUND_UP
Masahiro Yamada604df322017-09-08 16:13:45 -0700118
119#define DIV_ROUND_DOWN_ULL(ll, d) \
120 ({ unsigned long long _tmp = (ll); do_div(_tmp, d); _tmp; })
121
122#define DIV_ROUND_UP_ULL(ll, d) DIV_ROUND_DOWN_ULL((ll) + (d) - 1, (d))
Nicholas Bellinger36a26c62011-07-26 00:35:26 -0700123
124#if BITS_PER_LONG == 32
125# define DIV_ROUND_UP_SECTOR_T(ll,d) DIV_ROUND_UP_ULL(ll, d)
126#else
127# define DIV_ROUND_UP_SECTOR_T(ll,d) DIV_ROUND_UP(ll,d)
128#endif
James Morris074e61e2010-11-10 09:01:31 +1100129
Kees Cookcedc5b62018-08-21 21:55:28 -0700130/**
131 * roundup - round up to the next specified multiple
132 * @x: the value to up
133 * @y: multiple to round up to
134 *
135 * Rounds @x up to next multiple of @y. If @y will always be a power
136 * of 2, consider using the faster round_up().
137 *
138 * The `const' here prevents gcc-3.3 from calling __divdi3
139 */
Eric Parisb28efd52010-10-13 17:50:08 -0400140#define roundup(x, y) ( \
141{ \
Tetsuo Handa6070bf32010-11-08 11:20:49 +0900142 const typeof(y) __y = y; \
Eric Parisb28efd52010-10-13 17:50:08 -0400143 (((x) + (__y - 1)) / __y) * __y; \
144} \
145)
Kees Cookcedc5b62018-08-21 21:55:28 -0700146/**
147 * rounddown - round down to next specified multiple
148 * @x: the value to round
149 * @y: multiple to round down to
150 *
151 * Rounds @x down to next multiple of @y. If @y will always be a power
152 * of 2, consider using the faster round_down().
153 */
Eric Paris686a0f32010-10-13 17:50:02 -0400154#define rounddown(x, y) ( \
155{ \
156 typeof(x) __x = (x); \
157 __x - (__x % (y)); \
158} \
159)
Guenter Roeckb6d86d32012-08-24 17:25:01 -0700160
161/*
Niklas Söderlund4f5901f52017-02-24 15:01:01 -0800162 * Divide positive or negative dividend by positive or negative divisor
163 * and round to closest integer. Result is undefined for negative
Randy Dunlape8c97af2017-10-13 15:58:11 -0700164 * divisors if the dividend variable type is unsigned and for negative
Niklas Söderlund4f5901f52017-02-24 15:01:01 -0800165 * dividends if the divisor variable type is unsigned.
Guenter Roeckb6d86d32012-08-24 17:25:01 -0700166 */
Darrick J. Wong9fe06082009-01-06 14:40:51 -0800167#define DIV_ROUND_CLOSEST(x, divisor)( \
168{ \
Guenter Roeckb6d86d32012-08-24 17:25:01 -0700169 typeof(x) __x = x; \
170 typeof(divisor) __d = divisor; \
Guenter Roeckc4e18492012-12-20 15:05:42 -0800171 (((typeof(x))-1) > 0 || \
Niklas Söderlund4f5901f52017-02-24 15:01:01 -0800172 ((typeof(divisor))-1) > 0 || \
173 (((__x) > 0) == ((__d) > 0))) ? \
Guenter Roeckb6d86d32012-08-24 17:25:01 -0700174 (((__x) + ((__d) / 2)) / (__d)) : \
175 (((__x) - ((__d) / 2)) / (__d)); \
Darrick J. Wong9fe06082009-01-06 14:40:51 -0800176} \
177)
Javi Merinof7660932015-04-16 12:43:45 -0700178/*
179 * Same as above but for u64 dividends. divisor must be a 32-bit
180 * number.
181 */
182#define DIV_ROUND_CLOSEST_ULL(x, divisor)( \
183{ \
184 typeof(divisor) __d = divisor; \
185 unsigned long long _tmp = (x) + (__d) / 2; \
186 do_div(_tmp, __d); \
187 _tmp; \
188} \
189)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190
Salman Qazi9993bc632012-03-09 16:41:01 -0800191/*
192 * Multiplies an integer by a fraction, while avoiding unnecessary
193 * overflow or loss of precision.
194 */
195#define mult_frac(x, numer, denom)( \
196{ \
197 typeof(x) quot = (x) / (denom); \
198 typeof(x) rem = (x) % (denom); \
199 (quot * (numer)) + ((rem * (numer)) / (denom)); \
200} \
201)
202
203
Eduard - Gabriel Munteanuca31e142008-07-05 12:14:23 +0300204#define _RET_IP_ (unsigned long)__builtin_return_address(0)
205#define _THIS_IP_ ({ __label__ __here; __here: (unsigned long)&&__here; })
206
Bartlomiej Zolnierkiewicz90c699a2009-06-19 08:08:50 +0200207#ifdef CONFIG_LBDAF
Jens Axboe2da96ac2007-10-12 12:40:38 +0200208# 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 Morton218e1802007-05-10 03:15:18 -0700220/**
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 Roedel204b8852008-07-29 22:33:42 -0700230/**
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 Torvalds1da177e2005-04-16 15:20:36 -0700236struct completion;
akpm@osdl.orgdf2e71f2006-01-09 20:51:37 -0800237struct pt_regs;
238struct user;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700239
Uwe Kleine-König070cb062008-08-12 15:08:59 -0700240#ifdef CONFIG_PREEMPT_VOLUNTARY
241extern int _cond_resched(void);
242# define might_resched() _cond_resched()
243#else
244# define might_resched() do { } while (0)
245#endif
246
Frederic Weisbeckerd902db12011-06-08 19:31:56 +0200247#ifdef CONFIG_DEBUG_ATOMIC_SLEEP
Peter Zijlstra568f1962019-01-28 17:21:52 -0800248extern void ___might_sleep(const char *file, int line, int preempt_offset);
249extern void __might_sleep(const char *file, int line, int preempt_offset);
250extern void __cant_sleep(const char *file, int line, int preempt_offset);
251
Linus Torvalds1da177e2005-04-16 15:20:36 -0700252/**
253 * might_sleep - annotation for functions that can sleep
254 *
255 * this macro will print a stack trace if it is executed in an atomic
256 * context (spinlock, irq-handler, ...).
257 *
258 * This is a useful debugging help to be able to catch problems early and not
Jim Cromiee20ec992006-11-30 04:46:13 +0100259 * be bitten later when the calling function happens to sleep when it is not
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260 * supposed to.
261 */
Ingo Molnarf8cbd992005-06-25 14:57:39 -0700262# define might_sleep() \
Frederic Weisbeckere4aafea2009-07-16 15:44:29 +0200263 do { __might_sleep(__FILE__, __LINE__, 0); might_resched(); } while (0)
Peter Zijlstra568f1962019-01-28 17:21:52 -0800264/**
265 * cant_sleep - annotation for functions that cannot sleep
266 *
267 * this macro will print a stack trace if it is executed with preemption enabled
268 */
269# define cant_sleep() \
270 do { __cant_sleep(__FILE__, __LINE__, 0); } while (0)
Linus Torvalds00845eb2015-02-01 12:23:32 -0800271# define sched_annotate_sleep() (current->task_state_change = 0)
Ingo Molnarf8cbd992005-06-25 14:57:39 -0700272#else
Peter Zijlstra34274452014-09-24 10:18:56 +0200273 static inline void ___might_sleep(const char *file, int line,
274 int preempt_offset) { }
Simon Kagstromd8948372009-12-23 11:08:18 +0100275 static inline void __might_sleep(const char *file, int line,
276 int preempt_offset) { }
Ingo Molnarf8cbd992005-06-25 14:57:39 -0700277# define might_sleep() do { might_resched(); } while (0)
Peter Zijlstra568f1962019-01-28 17:21:52 -0800278# define cant_sleep() do { } while (0)
Peter Zijlstra1029a2b2014-09-24 10:18:49 +0200279# define sched_annotate_sleep() do { } while (0)
Ingo Molnarf8cbd992005-06-25 14:57:39 -0700280#endif
281
Hua Zhong368a5fa2006-06-23 02:05:42 -0700282#define might_sleep_if(cond) do { if (cond) might_sleep(); } while (0)
Ingo Molnarf8cbd992005-06-25 14:57:39 -0700283
Michal Nazarewiczc8299cb2015-11-09 14:58:10 -0800284/**
285 * abs - return absolute value of an argument
Michal Nazarewicz8f57e4d2016-01-15 16:57:58 -0800286 * @x: the value. If it is unsigned type, it is converted to signed type first.
287 * char is treated as if it was signed (regardless of whether it really is)
288 * but the macro's return type is preserved as char.
Michal Nazarewiczc8299cb2015-11-09 14:58:10 -0800289 *
Michal Nazarewicz8f57e4d2016-01-15 16:57:58 -0800290 * Return: an absolute value of x.
Andrew Morton71a90482011-01-12 16:59:35 -0800291 */
Michal Nazarewicz8f57e4d2016-01-15 16:57:58 -0800292#define abs(x) __abs_choose_expr(x, long long, \
293 __abs_choose_expr(x, long, \
294 __abs_choose_expr(x, int, \
295 __abs_choose_expr(x, short, \
296 __abs_choose_expr(x, char, \
297 __builtin_choose_expr( \
298 __builtin_types_compatible_p(typeof(x), char), \
299 (char)({ signed char __x = (x); __x<0?-__x:__x; }), \
300 ((void)0)))))))
301
302#define __abs_choose_expr(x, type, other) __builtin_choose_expr( \
303 __builtin_types_compatible_p(typeof(x), signed type) || \
304 __builtin_types_compatible_p(typeof(x), unsigned type), \
305 ({ signed type __x = (x); __x < 0 ? -__x : __x; }), other)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306
Daniel Borkmann89770b02014-01-22 02:29:40 +0100307/**
308 * reciprocal_scale - "scale" a value into range [0, ep_ro)
309 * @val: value
310 * @ep_ro: right open interval endpoint
311 *
312 * Perform a "reciprocal multiplication" in order to "scale" a value into
Randy Dunlape8c97af2017-10-13 15:58:11 -0700313 * range [0, @ep_ro), where the upper interval endpoint is right-open.
Daniel Borkmann89770b02014-01-22 02:29:40 +0100314 * This is useful, e.g. for accessing a index of an array containing
Randy Dunlape8c97af2017-10-13 15:58:11 -0700315 * @ep_ro elements, for example. Think of it as sort of modulus, only that
Daniel Borkmann89770b02014-01-22 02:29:40 +0100316 * the result isn't that of modulo. ;) Note that if initial input is a
317 * small value, then result will return 0.
318 *
Randy Dunlape8c97af2017-10-13 15:58:11 -0700319 * Return: a result based on @val in interval [0, @ep_ro).
Daniel Borkmann89770b02014-01-22 02:29:40 +0100320 */
321static inline u32 reciprocal_scale(u32 val, u32 ep_ro)
322{
323 return (u32)(((u64) val * ep_ro) >> 32);
324}
325
Axel Lin386e7902013-12-12 17:12:24 -0800326#if defined(CONFIG_MMU) && \
327 (defined(CONFIG_PROVE_LOCKING) || defined(CONFIG_DEBUG_ATOMIC_SLEEP))
David Hildenbrand9ec23532015-05-11 17:52:07 +0200328#define might_fault() __might_fault(__FILE__, __LINE__)
329void __might_fault(const char *file, int line);
Nick Piggin3ee1afa2008-09-10 13:37:17 +0200330#else
Michael S. Tsirkin662bbcb2013-05-26 17:32:23 +0300331static inline void might_fault(void) { }
Nick Piggin3ee1afa2008-09-10 13:37:17 +0200332#endif
333
Alan Sterne041c682006-03-27 01:16:30 -0800334extern struct atomic_notifier_head panic_notifier_list;
TAMUKI Shoichic7ff0d92010-08-10 18:03:28 -0700335extern long (*panic_blink)(int state);
Joe Perches9402c952012-01-12 17:17:17 -0800336__printf(1, 2)
Peter Zijlstra9af65282016-09-13 18:37:29 +0200337void panic(const char *fmt, ...) __noreturn __cold;
Hidehiro Kawaiebc41f22016-03-22 14:27:17 -0700338void nmi_panic(struct pt_regs *regs, const char *msg);
Andrew Mortondd287792006-03-23 03:00:57 -0800339extern void oops_enter(void);
340extern void oops_exit(void);
Anton Blanchard863a6042010-08-10 18:03:30 -0700341void print_oops_end_marker(void);
Andrew Mortondd287792006-03-23 03:00:57 -0800342extern int oops_may_print(void);
Peter Zijlstra9af65282016-09-13 18:37:29 +0200343void do_exit(long error_code) __noreturn;
344void complete_and_exit(struct completion *, long) __noreturn;
Alexey Dobriyan33ee3b22011-03-22 16:34:40 -0700345
Kees Cook7a46ec02017-08-15 09:19:24 -0700346#ifdef CONFIG_ARCH_HAS_REFCOUNT
347void refcount_error_report(struct pt_regs *regs, const char *err);
348#else
349static inline void refcount_error_report(struct pt_regs *regs, const char *err)
350{ }
351#endif
352
Alexey Dobriyan33ee3b22011-03-22 16:34:40 -0700353/* Internal, do not use. */
354int __must_check _kstrtoul(const char *s, unsigned int base, unsigned long *res);
355int __must_check _kstrtol(const char *s, unsigned int base, long *res);
356
357int __must_check kstrtoull(const char *s, unsigned int base, unsigned long long *res);
358int __must_check kstrtoll(const char *s, unsigned int base, long long *res);
Eldad Zack4c925d62012-12-17 16:03:04 -0800359
360/**
361 * kstrtoul - convert a string to an unsigned long
362 * @s: The start of the string. The string must be null-terminated, and may also
363 * include a single newline before its terminating null. The first character
364 * may also be a plus sign, but not a minus sign.
365 * @base: The number base to use. The maximum supported base is 16. If base is
366 * given as 0, then the base of the string is automatically detected with the
367 * conventional semantics - If it begins with 0x the number will be parsed as a
368 * hexadecimal (case insensitive), if it otherwise begins with 0, it will be
369 * parsed as an octal number. Otherwise it will be parsed as a decimal.
370 * @res: Where to write the result of the conversion on success.
371 *
372 * Returns 0 on success, -ERANGE on overflow and -EINVAL on parsing error.
373 * Used as a replacement for the obsolete simple_strtoull. Return code must
374 * be checked.
375*/
Alexey Dobriyan33ee3b22011-03-22 16:34:40 -0700376static inline int __must_check kstrtoul(const char *s, unsigned int base, unsigned long *res)
377{
378 /*
379 * We want to shortcut function call, but
380 * __builtin_types_compatible_p(unsigned long, unsigned long long) = 0.
381 */
382 if (sizeof(unsigned long) == sizeof(unsigned long long) &&
383 __alignof__(unsigned long) == __alignof__(unsigned long long))
384 return kstrtoull(s, base, (unsigned long long *)res);
385 else
386 return _kstrtoul(s, base, res);
387}
388
Eldad Zack4c925d62012-12-17 16:03:04 -0800389/**
390 * kstrtol - convert a string to a long
391 * @s: The start of the string. The string must be null-terminated, and may also
392 * include a single newline before its terminating null. The first character
393 * may also be a plus sign or a minus sign.
394 * @base: The number base to use. The maximum supported base is 16. If base is
395 * given as 0, then the base of the string is automatically detected with the
396 * conventional semantics - If it begins with 0x the number will be parsed as a
397 * hexadecimal (case insensitive), if it otherwise begins with 0, it will be
398 * parsed as an octal number. Otherwise it will be parsed as a decimal.
399 * @res: Where to write the result of the conversion on success.
400 *
401 * Returns 0 on success, -ERANGE on overflow and -EINVAL on parsing error.
402 * Used as a replacement for the obsolete simple_strtoull. Return code must
403 * be checked.
404 */
Alexey Dobriyan33ee3b22011-03-22 16:34:40 -0700405static inline int __must_check kstrtol(const char *s, unsigned int base, long *res)
406{
407 /*
408 * We want to shortcut function call, but
409 * __builtin_types_compatible_p(long, long long) = 0.
410 */
411 if (sizeof(long) == sizeof(long long) &&
412 __alignof__(long) == __alignof__(long long))
413 return kstrtoll(s, base, (long long *)res);
414 else
415 return _kstrtol(s, base, res);
416}
417
418int __must_check kstrtouint(const char *s, unsigned int base, unsigned int *res);
419int __must_check kstrtoint(const char *s, unsigned int base, int *res);
420
421static inline int __must_check kstrtou64(const char *s, unsigned int base, u64 *res)
422{
423 return kstrtoull(s, base, res);
424}
425
426static inline int __must_check kstrtos64(const char *s, unsigned int base, s64 *res)
427{
428 return kstrtoll(s, base, res);
429}
430
431static inline int __must_check kstrtou32(const char *s, unsigned int base, u32 *res)
432{
433 return kstrtouint(s, base, res);
434}
435
436static inline int __must_check kstrtos32(const char *s, unsigned int base, s32 *res)
437{
438 return kstrtoint(s, base, res);
439}
440
441int __must_check kstrtou16(const char *s, unsigned int base, u16 *res);
442int __must_check kstrtos16(const char *s, unsigned int base, s16 *res);
443int __must_check kstrtou8(const char *s, unsigned int base, u8 *res);
444int __must_check kstrtos8(const char *s, unsigned int base, s8 *res);
Kees Cookef951592016-03-17 14:22:50 -0700445int __must_check kstrtobool(const char *s, bool *res);
Alexey Dobriyan33ee3b22011-03-22 16:34:40 -0700446
Alexey Dobriyanc196e322011-05-24 17:13:31 -0700447int __must_check kstrtoull_from_user(const char __user *s, size_t count, unsigned int base, unsigned long long *res);
448int __must_check kstrtoll_from_user(const char __user *s, size_t count, unsigned int base, long long *res);
449int __must_check kstrtoul_from_user(const char __user *s, size_t count, unsigned int base, unsigned long *res);
450int __must_check kstrtol_from_user(const char __user *s, size_t count, unsigned int base, long *res);
451int __must_check kstrtouint_from_user(const char __user *s, size_t count, unsigned int base, unsigned int *res);
452int __must_check kstrtoint_from_user(const char __user *s, size_t count, unsigned int base, int *res);
453int __must_check kstrtou16_from_user(const char __user *s, size_t count, unsigned int base, u16 *res);
454int __must_check kstrtos16_from_user(const char __user *s, size_t count, unsigned int base, s16 *res);
455int __must_check kstrtou8_from_user(const char __user *s, size_t count, unsigned int base, u8 *res);
456int __must_check kstrtos8_from_user(const char __user *s, size_t count, unsigned int base, s8 *res);
Kees Cookef951592016-03-17 14:22:50 -0700457int __must_check kstrtobool_from_user(const char __user *s, size_t count, bool *res);
Alexey Dobriyanc196e322011-05-24 17:13:31 -0700458
459static inline int __must_check kstrtou64_from_user(const char __user *s, size_t count, unsigned int base, u64 *res)
460{
461 return kstrtoull_from_user(s, count, base, res);
462}
463
464static inline int __must_check kstrtos64_from_user(const char __user *s, size_t count, unsigned int base, s64 *res)
465{
466 return kstrtoll_from_user(s, count, base, res);
467}
468
469static inline int __must_check kstrtou32_from_user(const char __user *s, size_t count, unsigned int base, u32 *res)
470{
471 return kstrtouint_from_user(s, count, base, res);
472}
473
474static inline int __must_check kstrtos32_from_user(const char __user *s, size_t count, unsigned int base, s32 *res)
475{
476 return kstrtoint_from_user(s, count, base, res);
477}
478
Joe Perches67d0a072011-10-31 17:13:10 -0700479/* Obsolete, do not use. Use kstrto<foo> instead */
480
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481extern unsigned long simple_strtoul(const char *,char **,unsigned int);
482extern long simple_strtol(const char *,char **,unsigned int);
483extern unsigned long long simple_strtoull(const char *,char **,unsigned int);
484extern long long simple_strtoll(const char *,char **,unsigned int);
Alexey Dobriyan33ee3b22011-03-22 16:34:40 -0700485
Andrei Vagind1be35c2018-04-10 16:31:16 -0700486extern int num_to_str(char *buf, int size,
487 unsigned long long num, unsigned int width);
KAMEZAWA Hiroyuki1ac101a2012-03-23 15:02:54 -0700488
Joe Perches67d0a072011-10-31 17:13:10 -0700489/* lib/printf utilities */
490
Joe Perchesb9075fa2011-10-31 17:11:33 -0700491extern __printf(2, 3) int sprintf(char *buf, const char * fmt, ...);
492extern __printf(2, 0) int vsprintf(char *buf, const char *, va_list);
493extern __printf(3, 4)
494int snprintf(char *buf, size_t size, const char *fmt, ...);
495extern __printf(3, 0)
496int vsnprintf(char *buf, size_t size, const char *fmt, va_list args);
497extern __printf(3, 4)
498int scnprintf(char *buf, size_t size, const char *fmt, ...);
499extern __printf(3, 0)
500int vscnprintf(char *buf, size_t size, const char *fmt, va_list args);
Rasmus Villemoes48a27052016-05-19 17:10:55 -0700501extern __printf(2, 3) __malloc
Joe Perchesb9075fa2011-10-31 17:11:33 -0700502char *kasprintf(gfp_t gfp, const char *fmt, ...);
Rasmus Villemoes48a27052016-05-19 17:10:55 -0700503extern __printf(2, 0) __malloc
Nicolas Iooss8db14862015-07-17 16:23:42 -0700504char *kvasprintf(gfp_t gfp, const char *fmt, va_list args);
Rasmus Villemoes0a9df782015-11-06 16:31:20 -0800505extern __printf(2, 0)
506const char *kvasprintf_const(gfp_t gfp, const char *fmt, va_list args);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700507
Joe Perches6061d942012-03-23 15:02:16 -0700508extern __scanf(2, 3)
509int sscanf(const char *, const char *, ...);
510extern __scanf(2, 0)
511int vsscanf(const char *, const char *, va_list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700512
513extern int get_option(char **str, int *pint);
514extern char *get_options(const char *str, int nints, int *ints);
Jeremy Fitzhardinged974ae32008-07-24 16:27:46 -0700515extern unsigned long long memparse(const char *ptr, char **retptr);
Dave Young6ccc72b82014-08-14 17:15:27 +0800516extern bool parse_option_str(const char *str, const char *option);
Baoquan Hef51b17c2017-04-17 21:34:56 +0800517extern char *next_arg(char *args, char **param, char **val);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700518
Trent Piepho5e376612006-05-15 09:44:06 -0700519extern int core_kernel_text(unsigned long addr);
Josh Poimboeuf9fbcc572018-02-20 11:37:53 -0600520extern int init_kernel_text(unsigned long addr);
Steven Rostedtcdbe61b2011-05-05 21:14:55 -0400521extern int core_kernel_data(unsigned long addr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700522extern int __kernel_text_address(unsigned long addr);
523extern int kernel_text_address(unsigned long addr);
Arjan van de Venab7476c2008-08-15 15:29:38 -0700524extern int func_ptr_is_kernel_text(void *ptr);
Arjan van de Venab7476c2008-08-15 15:29:38 -0700525
Linus Torvalds1da177e2005-04-16 15:20:36 -0700526unsigned long int_sqrt(unsigned long);
527
Crt Mori47a36162018-01-11 11:19:57 +0100528#if BITS_PER_LONG < 64
529u32 int_sqrt64(u64 x);
530#else
531static inline u32 int_sqrt64(u64 x)
532{
533 return (u32)int_sqrt(x);
534}
535#endif
536
Linus Torvalds1da177e2005-04-16 15:20:36 -0700537extern void bust_spinlocks(int yes);
538extern int oops_in_progress; /* If set, an oops, panic(), BUG() or die() is in progress */
Adrian Bunkaa727102006-04-10 22:53:59 -0700539extern int panic_timeout;
Feng Tang81c9d432019-01-03 15:28:20 -0800540extern unsigned long panic_print;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700541extern int panic_on_oops;
Don Zickus8da5add2006-09-26 10:52:27 +0200542extern int panic_on_unrecovered_nmi;
Kurt Garloff5211a242009-06-24 14:32:11 -0700543extern int panic_on_io_nmi;
Prarit Bhargava9e3961a2014-12-10 15:45:50 -0800544extern int panic_on_warn;
Daniel Bristot de Oliveira088e9d22016-06-02 13:51:41 -0300545extern int sysctl_panic_on_rcu_stall;
Mitsuo Hayasaka55af7792011-11-29 15:08:36 +0900546extern int sysctl_panic_on_stackoverflow;
HATAYAMA Daisuke5375b702015-06-30 14:57:46 -0700547
548extern bool crash_kexec_post_notifiers;
549
Jason Baron5800dc32013-11-25 23:23:04 +0000550/*
Hidehiro Kawai1717f202015-12-14 11:19:09 +0100551 * panic_cpu is used for synchronizing panic() and crash_kexec() execution. It
552 * holds a CPU number which is executing panic() currently. A value of
553 * PANIC_CPU_INVALID means no CPU has entered panic() or crash_kexec().
554 */
555extern atomic_t panic_cpu;
556#define PANIC_CPU_INVALID -1
557
558/*
Jason Baron5800dc32013-11-25 23:23:04 +0000559 * Only to be used by arch init code. If the user over-wrote the default
560 * CONFIG_PANIC_TIMEOUT, honor it.
561 */
562static inline void set_arch_panic_timeout(int timeout, int arch_default_timeout)
563{
564 if (panic_timeout == arch_default_timeout)
565 panic_timeout = timeout;
566}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700567extern const char *print_tainted(void);
Rusty Russell373d4d02013-01-21 17:17:39 +1030568enum lockdep_ok {
569 LOCKDEP_STILL_OK,
570 LOCKDEP_NOW_UNRELIABLE
571};
572extern void add_taint(unsigned flag, enum lockdep_ok);
Andi Kleen25ddbb12008-10-15 22:01:41 -0700573extern int test_taint(unsigned flag);
574extern unsigned long get_taint(void);
David Howellsb920de12008-02-08 04:19:31 -0800575extern int root_mountflags;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700576
Tejun Heo2ce802f2011-01-20 12:06:35 +0100577extern bool early_boot_irqs_disabled;
578
Thomas Gleixner69a78ff2017-05-16 20:42:47 +0200579/*
580 * Values used for system_state. Ordering of the states must not be changed
581 * as code checks for <, <=, >, >= STATE.
582 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700583extern enum system_states {
584 SYSTEM_BOOTING,
Thomas Gleixner69a78ff2017-05-16 20:42:47 +0200585 SYSTEM_SCHEDULING,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700586 SYSTEM_RUNNING,
587 SYSTEM_HALT,
588 SYSTEM_POWER_OFF,
589 SYSTEM_RESTART,
Thomas Gleixnerc1a957d2018-05-25 17:54:41 +0200590 SYSTEM_SUSPEND,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700591} system_state;
592
Kees Cook47d4b262018-04-10 16:32:26 -0700593/* This cannot be an enum because some may be used in assembly source. */
Andi Kleen25ddbb12008-10-15 22:01:41 -0700594#define TAINT_PROPRIETARY_MODULE 0
595#define TAINT_FORCED_MODULE 1
Dave Jones8c904872014-02-26 10:49:49 -0500596#define TAINT_CPU_OUT_OF_SPEC 2
Andi Kleen25ddbb12008-10-15 22:01:41 -0700597#define TAINT_FORCED_RMMOD 3
598#define TAINT_MACHINE_CHECK 4
599#define TAINT_BAD_PAGE 5
600#define TAINT_USER 6
601#define TAINT_DIE 7
602#define TAINT_OVERRIDDEN_ACPI_TABLE 8
603#define TAINT_WARN 9
Linus Torvalds26e9a392008-10-17 09:50:12 -0700604#define TAINT_CRAP 10
Ben Hutchings92946bc2010-04-03 19:36:42 +0100605#define TAINT_FIRMWARE_WORKAROUND 11
Ben Hutchings2449b8b2011-10-24 15:12:28 +0200606#define TAINT_OOT_MODULE 12
Mathieu Desnoyers66cc69e2014-03-13 12:11:30 +1030607#define TAINT_UNSIGNED_MODULE 13
Josh Hunt69361ee2014-08-08 14:22:31 -0700608#define TAINT_SOFTLOCKUP 14
Seth Jenningsc5f45462014-12-16 11:58:18 -0600609#define TAINT_LIVEPATCH 15
Borislav Petkov4efb442c2017-11-17 15:30:38 -0800610#define TAINT_AUX 16
Kees Cookbc4f2f52018-04-10 16:32:33 -0700611#define TAINT_RANDSTRUCT 17
612#define TAINT_FLAGS_COUNT 18
Petr Mladek7fd83292016-09-21 13:47:22 +0200613
614struct taint_flag {
Larry Finger5eb7c0d2017-01-01 20:25:25 -0600615 char c_true; /* character printed when tainted */
616 char c_false; /* character printed when not tainted */
Petr Mladek7fd83292016-09-21 13:47:22 +0200617 bool module; /* also show as a per-module taint flag */
618};
619
620extern const struct taint_flag taint_flags[TAINT_FLAGS_COUNT];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700621
Harvey Harrison3fc95772008-05-14 16:05:49 -0700622extern const char hex_asc[];
623#define hex_asc_lo(x) hex_asc[((x) & 0x0f)]
624#define hex_asc_hi(x) hex_asc[((x) & 0xf0) >> 4]
625
Andy Shevchenko55036ba2011-10-31 17:12:41 -0700626static inline char *hex_byte_pack(char *buf, u8 byte)
Harvey Harrison3fc95772008-05-14 16:05:49 -0700627{
628 *buf++ = hex_asc_hi(byte);
629 *buf++ = hex_asc_lo(byte);
630 return buf;
631}
Randy Dunlap99eaf3c2007-05-10 22:22:39 -0700632
Andre Naujoksc26d4362013-09-13 19:37:12 +0200633extern const char hex_asc_upper[];
634#define hex_asc_upper_lo(x) hex_asc_upper[((x) & 0x0f)]
635#define hex_asc_upper_hi(x) hex_asc_upper[((x) & 0xf0) >> 4]
636
637static inline char *hex_byte_pack_upper(char *buf, u8 byte)
638{
639 *buf++ = hex_asc_upper_hi(byte);
640 *buf++ = hex_asc_upper_lo(byte);
641 return buf;
642}
643
Andy Shevchenko903788892010-05-24 14:33:23 -0700644extern int hex_to_bin(char ch);
Mimi Zoharb7804982011-09-20 11:23:49 -0400645extern int __must_check hex2bin(u8 *dst, const char *src, size_t count);
David Howells53d91c52014-09-16 17:36:01 +0100646extern char *bin2hex(char *dst, const void *src, size_t count);
Andy Shevchenko903788892010-05-24 14:33:23 -0700647
Joe Perchesa69f5ed2014-06-24 11:20:48 -0700648bool mac_pton(const char *s, u8 *mac);
Andy Shevchenko4cd57732013-06-04 19:46:26 +0300649
Joe Perches8a64f332009-12-14 18:00:25 -0800650/*
Ingo Molnar526211b2009-03-05 10:28:45 +0100651 * General tracing related utility functions - trace_printk(),
Steven Rostedt2002c252009-03-05 10:35:56 -0500652 * tracing_on/tracing_off and tracing_start()/tracing_stop
653 *
654 * Use tracing_on/tracing_off when you want to quickly turn on or off
655 * tracing. It simply enables or disables the recording of the trace events.
GeunSik Lim156f5a72009-06-02 15:01:37 +0900656 * This also corresponds to the user space /sys/kernel/debug/tracing/tracing_on
Steven Rostedt2002c252009-03-05 10:35:56 -0500657 * file, which gives a means for the kernel and userspace to interact.
658 * Place a tracing_off() in the kernel where you want tracing to end.
659 * From user space, examine the trace, and then echo 1 > tracing_on
660 * to continue tracing.
661 *
662 * tracing_stop/tracing_start has slightly more overhead. It is used
663 * by things like suspend to ram where disabling the recording of the
664 * trace is not enough, but tracing must actually stop because things
665 * like calling smp_processor_id() may crash the system.
666 *
667 * Most likely, you want to use tracing_on/tracing_off.
Ingo Molnar526211b2009-03-05 10:28:45 +0100668 */
Frederic Weisbeckercecbca92010-04-18 19:08:41 +0200669
670enum ftrace_dump_mode {
671 DUMP_NONE,
672 DUMP_ALL,
673 DUMP_ORIG,
674};
675
Ingo Molnar526211b2009-03-05 10:28:45 +0100676#ifdef CONFIG_TRACING
Steven Rostedt93d68e52012-03-20 12:28:29 -0400677void tracing_on(void);
678void tracing_off(void);
679int tracing_is_on(void);
Steven Rostedt (Red Hat)ad909e22013-03-06 21:45:37 -0500680void tracing_snapshot(void);
681void tracing_snapshot_alloc(void);
Steven Rostedt93d68e52012-03-20 12:28:29 -0400682
Ingo Molnar526211b2009-03-05 10:28:45 +0100683extern void tracing_start(void);
684extern void tracing_stop(void);
Ingo Molnar526211b2009-03-05 10:28:45 +0100685
Joe Perchesb9075fa2011-10-31 17:11:33 -0700686static inline __printf(1, 2)
687void ____trace_printk_check_format(const char *fmt, ...)
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100688{
689}
690#define __trace_printk_check_format(fmt, args...) \
691do { \
692 if (0) \
693 ____trace_printk_check_format(fmt, ##args); \
694} while (0)
695
Ingo Molnar526211b2009-03-05 10:28:45 +0100696/**
697 * trace_printk - printf formatting in the ftrace buffer
698 * @fmt: the printf format for printing
699 *
Randy Dunlape8c97af2017-10-13 15:58:11 -0700700 * Note: __trace_printk is an internal function for trace_printk() and
701 * the @ip is passed in via the trace_printk() macro.
Ingo Molnar526211b2009-03-05 10:28:45 +0100702 *
703 * This function allows a kernel developer to debug fast path sections
704 * that printk is not appropriate for. By scattering in various
705 * printk like tracing in the code, a developer can quickly see
706 * where problems are occurring.
707 *
708 * This is intended as a debugging tool for the developer only.
709 * Please refrain from leaving trace_printks scattered around in
Steven Rostedt (Red Hat)09ae7232013-03-08 21:02:34 -0500710 * your code. (Extra memory is used for special buffers that are
Randy Dunlape8c97af2017-10-13 15:58:11 -0700711 * allocated when trace_printk() is used.)
Steven Rostedt (Red Hat)9d3c752c2013-03-08 22:11:57 -0500712 *
Wei Wang87306622018-04-24 14:22:38 -0700713 * A little optimization trick is done here. If there's only one
Steven Rostedt (Red Hat)9d3c752c2013-03-08 22:11:57 -0500714 * argument, there's no need to scan the string for printf formats.
715 * The trace_puts() will suffice. But how can we take advantage of
716 * using trace_puts() when trace_printk() has only one argument?
717 * By stringifying the args and checking the size we can tell
718 * whether or not there are args. __stringify((__VA_ARGS__)) will
719 * turn into "()\0" with a size of 3 when there are no args, anything
720 * else will be bigger. All we need to do is define a string to this,
721 * and then take its size and compare to 3. If it's bigger, use
722 * do_trace_printk() otherwise, optimize it to trace_puts(). Then just
723 * let gcc optimize the rest.
Ingo Molnar526211b2009-03-05 10:28:45 +0100724 */
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100725
Steven Rostedt (Red Hat)9d3c752c2013-03-08 22:11:57 -0500726#define trace_printk(fmt, ...) \
727do { \
728 char _______STR[] = __stringify((__VA_ARGS__)); \
729 if (sizeof(_______STR) > 3) \
730 do_trace_printk(fmt, ##__VA_ARGS__); \
731 else \
732 trace_puts(fmt); \
733} while (0)
734
735#define do_trace_printk(fmt, args...) \
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100736do { \
Steven Rostedt (Red Hat)3debb0a2016-03-22 17:30:58 -0400737 static const char *trace_printk_fmt __used \
Steven Rostedt07d777f2011-09-22 14:01:55 -0400738 __attribute__((section("__trace_printk_fmt"))) = \
739 __builtin_constant_p(fmt) ? fmt : NULL; \
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100740 \
Steven Rostedt07d777f2011-09-22 14:01:55 -0400741 __trace_printk_check_format(fmt, ##args); \
742 \
743 if (__builtin_constant_p(fmt)) \
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100744 __trace_bprintk(_THIS_IP_, trace_printk_fmt, ##args); \
Steven Rostedt07d777f2011-09-22 14:01:55 -0400745 else \
746 __trace_printk(_THIS_IP_, fmt, ##args); \
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100747} while (0)
748
Joe Perchesb9075fa2011-10-31 17:11:33 -0700749extern __printf(2, 3)
750int __trace_bprintk(unsigned long ip, const char *fmt, ...);
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100751
Joe Perchesb9075fa2011-10-31 17:11:33 -0700752extern __printf(2, 3)
753int __trace_printk(unsigned long ip, const char *fmt, ...);
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100754
Steven Rostedt (Red Hat)09ae7232013-03-08 21:02:34 -0500755/**
756 * trace_puts - write a string into the ftrace buffer
757 * @str: the string to record
758 *
759 * Note: __trace_bputs is an internal function for trace_puts and
760 * the @ip is passed in via the trace_puts macro.
761 *
762 * This is similar to trace_printk() but is made for those really fast
Randy Dunlape8c97af2017-10-13 15:58:11 -0700763 * paths that a developer wants the least amount of "Heisenbug" effects,
Steven Rostedt (Red Hat)09ae7232013-03-08 21:02:34 -0500764 * where the processing of the print format is still too much.
765 *
766 * This function allows a kernel developer to debug fast path sections
767 * that printk is not appropriate for. By scattering in various
768 * printk like tracing in the code, a developer can quickly see
769 * where problems are occurring.
770 *
771 * This is intended as a debugging tool for the developer only.
772 * Please refrain from leaving trace_puts scattered around in
773 * your code. (Extra memory is used for special buffers that are
Randy Dunlape8c97af2017-10-13 15:58:11 -0700774 * allocated when trace_puts() is used.)
Steven Rostedt (Red Hat)09ae7232013-03-08 21:02:34 -0500775 *
776 * Returns: 0 if nothing was written, positive # if string was.
777 * (1 when __trace_bputs is used, strlen(str) when __trace_puts is used)
778 */
779
Steven Rostedt (Red Hat)09ae7232013-03-08 21:02:34 -0500780#define trace_puts(str) ({ \
Steven Rostedt (Red Hat)3debb0a2016-03-22 17:30:58 -0400781 static const char *trace_printk_fmt __used \
Steven Rostedt (Red Hat)09ae7232013-03-08 21:02:34 -0500782 __attribute__((section("__trace_printk_fmt"))) = \
783 __builtin_constant_p(str) ? str : NULL; \
784 \
785 if (__builtin_constant_p(str)) \
786 __trace_bputs(_THIS_IP_, trace_printk_fmt); \
787 else \
788 __trace_puts(_THIS_IP_, str, strlen(str)); \
789})
Steven Rostedtbcf312c2013-05-02 11:26:13 -0400790extern int __trace_bputs(unsigned long ip, const char *str);
791extern int __trace_puts(unsigned long ip, const char *str, int size);
Steven Rostedt (Red Hat)09ae7232013-03-08 21:02:34 -0500792
Steven Rostedt (Red Hat)c142be82013-03-13 09:55:57 -0400793extern void trace_dump_stack(int skip);
Steven Rostedt03889382009-12-11 09:48:22 -0500794
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100795/*
796 * The double __builtin_constant_p is because gcc will give us an error
797 * if we try to allocate the static variable to fmt if it is not a
798 * constant. Even with the outer if statement.
799 */
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100800#define ftrace_vprintk(fmt, vargs) \
801do { \
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100802 if (__builtin_constant_p(fmt)) { \
Steven Rostedt (Red Hat)3debb0a2016-03-22 17:30:58 -0400803 static const char *trace_printk_fmt __used \
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100804 __attribute__((section("__trace_printk_fmt"))) = \
805 __builtin_constant_p(fmt) ? fmt : NULL; \
Ingo Molnar7bffc232009-03-09 10:11:36 +0100806 \
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100807 __ftrace_vbprintk(_THIS_IP_, trace_printk_fmt, vargs); \
808 } else \
809 __ftrace_vprintk(_THIS_IP_, fmt, vargs); \
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100810} while (0)
811
Nicolas Iooss8db14862015-07-17 16:23:42 -0700812extern __printf(2, 0) int
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100813__ftrace_vbprintk(unsigned long ip, const char *fmt, va_list ap);
814
Nicolas Iooss8db14862015-07-17 16:23:42 -0700815extern __printf(2, 0) int
Ingo Molnar526211b2009-03-05 10:28:45 +0100816__ftrace_vprintk(unsigned long ip, const char *fmt, va_list ap);
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100817
Frederic Weisbeckercecbca92010-04-18 19:08:41 +0200818extern void ftrace_dump(enum ftrace_dump_mode oops_dump_mode);
Ingo Molnar526211b2009-03-05 10:28:45 +0100819#else
Ingo Molnar526211b2009-03-05 10:28:45 +0100820static inline void tracing_start(void) { }
821static inline void tracing_stop(void) { }
Dhaval Gianie67bc512013-08-02 14:47:29 -0400822static inline void trace_dump_stack(int skip) { }
Steven Rostedt93d68e52012-03-20 12:28:29 -0400823
824static inline void tracing_on(void) { }
825static inline void tracing_off(void) { }
826static inline int tracing_is_on(void) { return 0; }
Steven Rostedt (Red Hat)ad909e22013-03-06 21:45:37 -0500827static inline void tracing_snapshot(void) { }
828static inline void tracing_snapshot_alloc(void) { }
Steven Rostedt93d68e52012-03-20 12:28:29 -0400829
Michal Hocko60efc152012-10-25 15:41:51 +0200830static inline __printf(1, 2)
831int trace_printk(const char *fmt, ...)
Ingo Molnar526211b2009-03-05 10:28:45 +0100832{
833 return 0;
834}
Nicolas Iooss8db14862015-07-17 16:23:42 -0700835static __printf(1, 0) inline int
Ingo Molnar526211b2009-03-05 10:28:45 +0100836ftrace_vprintk(const char *fmt, va_list ap)
837{
838 return 0;
839}
Frederic Weisbeckercecbca92010-04-18 19:08:41 +0200840static inline void ftrace_dump(enum ftrace_dump_mode oops_dump_mode) { }
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100841#endif /* CONFIG_TRACING */
Ingo Molnar526211b2009-03-05 10:28:45 +0100842
843/*
Kees Cook3c8ba0d2018-03-30 18:52:36 -0700844 * min()/max()/clamp() macros must accomplish three things:
845 *
846 * - avoid multiple evaluations of the arguments (so side-effects like
847 * "x++" happen only once) when non-constant.
848 * - perform strict type-checking (to generate warnings instead of
849 * nasty runtime surprises). See the "unnecessary" pointer comparison
850 * in __typecheck().
851 * - retain result as a constant expressions when called with only
852 * constant expressions (to avoid tripping VLA warnings in stack
853 * allocation usage).
Linus Torvalds1da177e2005-04-16 15:20:36 -0700854 */
Kees Cook3c8ba0d2018-03-30 18:52:36 -0700855#define __typecheck(x, y) \
856 (!!(sizeof((typeof(x) *)1 == (typeof(y) *)1)))
857
858/*
859 * This returns a constant expression while determining if an argument is
860 * a constant expression, most importantly without evaluating the argument.
861 * Glory to Martin Uecker <Martin.Uecker@med.uni-goettingen.de>
862 */
863#define __is_constexpr(x) \
864 (sizeof(int) == sizeof(*(8 ? ((void *)((long)(x) * 0l)) : (int *)8)))
865
866#define __no_side_effects(x, y) \
867 (__is_constexpr(x) && __is_constexpr(y))
868
869#define __safe_cmp(x, y) \
870 (__typecheck(x, y) && __no_side_effects(x, y))
871
872#define __cmp(x, y, op) ((x) op (y) ? (x) : (y))
873
Linus Torvaldse9092d02018-04-09 10:34:07 -0700874#define __cmp_once(x, y, unique_x, unique_y, op) ({ \
875 typeof(x) unique_x = (x); \
876 typeof(y) unique_y = (y); \
877 __cmp(unique_x, unique_y, op); })
Kees Cook3c8ba0d2018-03-30 18:52:36 -0700878
Linus Torvaldse9092d02018-04-09 10:34:07 -0700879#define __careful_cmp(x, y, op) \
880 __builtin_choose_expr(__safe_cmp(x, y), \
881 __cmp(x, y, op), \
882 __cmp_once(x, y, __UNIQUE_ID(__x), __UNIQUE_ID(__y), op))
Randy Dunlape8c97af2017-10-13 15:58:11 -0700883
884/**
885 * min - return minimum of two values of the same or compatible types
886 * @x: first value
887 * @y: second value
888 */
Kees Cook3c8ba0d2018-03-30 18:52:36 -0700889#define min(x, y) __careful_cmp(x, y, <)
Randy Dunlape8c97af2017-10-13 15:58:11 -0700890
891/**
892 * max - return maximum of two values of the same or compatible types
893 * @x: first value
894 * @y: second value
895 */
Kees Cook3c8ba0d2018-03-30 18:52:36 -0700896#define max(x, y) __careful_cmp(x, y, >)
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700897
Randy Dunlape8c97af2017-10-13 15:58:11 -0700898/**
899 * min3 - return minimum of three values
900 * @x: first value
901 * @y: second value
902 * @z: third value
903 */
Michal Nazarewicz2e1d06e2014-10-09 15:30:13 -0700904#define min3(x, y, z) min((typeof(x))min(x, y), z)
Randy Dunlape8c97af2017-10-13 15:58:11 -0700905
906/**
907 * max3 - return maximum of three values
908 * @x: first value
909 * @y: second value
910 * @z: third value
911 */
Michal Nazarewicz2e1d06e2014-10-09 15:30:13 -0700912#define max3(x, y, z) max((typeof(x))max(x, y), z)
Hagen Paul Pfeiferf27c85c2010-10-26 14:22:21 -0700913
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700914/**
Martin K. Petersenc8bf1332010-09-10 20:07:38 +0200915 * min_not_zero - return the minimum that is _not_ zero, unless both are zero
916 * @x: value1
917 * @y: value2
918 */
919#define min_not_zero(x, y) ({ \
920 typeof(x) __x = (x); \
921 typeof(y) __y = (y); \
922 __x == 0 ? __y : ((__y == 0) ? __x : min(__x, __y)); })
923
924/**
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700925 * clamp - return a value clamped to a given range with strict typechecking
926 * @val: current value
Michal Nazarewicz2e1d06e2014-10-09 15:30:13 -0700927 * @lo: lowest allowable value
928 * @hi: highest allowable value
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700929 *
Randy Dunlape8c97af2017-10-13 15:58:11 -0700930 * This macro does strict typechecking of @lo/@hi to make sure they are of the
931 * same type as @val. See the unnecessary pointer comparisons.
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700932 */
Michal Nazarewicz2e1d06e2014-10-09 15:30:13 -0700933#define clamp(val, lo, hi) min((typeof(val))max(val, lo), hi)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700934
935/*
936 * ..and if you can't take the strict
937 * types, you can specify one yourself.
938 *
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700939 * Or not use min/max/clamp at all, of course.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700940 */
Randy Dunlape8c97af2017-10-13 15:58:11 -0700941
942/**
943 * min_t - return minimum of two values, using the specified type
944 * @type: data type to use
945 * @x: first value
946 * @y: second value
947 */
Kees Cook3c8ba0d2018-03-30 18:52:36 -0700948#define min_t(type, x, y) __careful_cmp((type)(x), (type)(y), <)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700949
Randy Dunlape8c97af2017-10-13 15:58:11 -0700950/**
951 * max_t - return maximum of two values, using the specified type
952 * @type: data type to use
953 * @x: first value
954 * @y: second value
955 */
Kees Cook3c8ba0d2018-03-30 18:52:36 -0700956#define max_t(type, x, y) __careful_cmp((type)(x), (type)(y), >)
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700957
958/**
959 * clamp_t - return a value clamped to a given range using a given type
960 * @type: the type of variable to use
961 * @val: current value
Michal Nazarewiczc185b072014-10-09 15:30:15 -0700962 * @lo: minimum allowable value
963 * @hi: maximum allowable value
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700964 *
965 * This macro does no typechecking and uses temporary variables of type
Randy Dunlape8c97af2017-10-13 15:58:11 -0700966 * @type to make all the comparisons.
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700967 */
Michal Nazarewiczc185b072014-10-09 15:30:15 -0700968#define clamp_t(type, val, lo, hi) min_t(type, max_t(type, val, lo), hi)
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700969
970/**
971 * clamp_val - return a value clamped to a given range using val's type
972 * @val: current value
Michal Nazarewiczc185b072014-10-09 15:30:15 -0700973 * @lo: minimum allowable value
974 * @hi: maximum allowable value
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700975 *
976 * This macro does no typechecking and uses temporary variables of whatever
Randy Dunlape8c97af2017-10-13 15:58:11 -0700977 * type the input argument @val is. This is useful when @val is an unsigned
978 * type and @lo and @hi are literals that will otherwise be assigned a signed
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700979 * integer type.
980 */
Michal Nazarewiczc185b072014-10-09 15:30:15 -0700981#define clamp_val(val, lo, hi) clamp_t(typeof(val), val, lo, hi)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700982
Wu Fengguang91f68b72009-01-07 18:09:12 -0800983
Randy Dunlape8c97af2017-10-13 15:58:11 -0700984/**
985 * swap - swap values of @a and @b
986 * @a: first value
987 * @b: second value
Wu Fengguang91f68b72009-01-07 18:09:12 -0800988 */
Peter Zijlstraac7b9002009-02-04 15:11:59 -0800989#define swap(a, b) \
990 do { typeof(a) __tmp = (a); (a) = (b); (b) = __tmp; } while (0)
Wu Fengguang91f68b72009-01-07 18:09:12 -0800991
Alexei Starovoitovcf14f272018-03-28 12:05:36 -0700992/* This counts to 12. Any more, it will return 13th argument. */
993#define __COUNT_ARGS(_0, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _n, X...) _n
994#define COUNT_ARGS(X...) __COUNT_ARGS(, ##X, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0)
995
996#define __CONCAT(a, b) a ## b
997#define CONCATENATE(a, b) __CONCAT(a, b)
998
Linus Torvalds1da177e2005-04-16 15:20:36 -0700999/**
1000 * container_of - cast a member of a structure out to the containing structure
Linus Torvalds1da177e2005-04-16 15:20:36 -07001001 * @ptr: the pointer to the member.
1002 * @type: the type of the container struct this is embedded in.
1003 * @member: the name of the member within the struct.
1004 *
1005 */
Ian Abbottc7acec712017-07-12 14:33:04 -07001006#define container_of(ptr, type, member) ({ \
1007 void *__mptr = (void *)(ptr); \
1008 BUILD_BUG_ON_MSG(!__same_type(*(ptr), ((type *)0)->member) && \
1009 !__same_type(*(ptr), void), \
1010 "pointer type mismatch in container_of()"); \
1011 ((type *)(__mptr - offsetof(type, member))); })
Linus Torvalds1da177e2005-04-16 15:20:36 -07001012
NeilBrown05e65572018-03-29 15:26:48 +11001013/**
1014 * container_of_safe - cast a member of a structure out to the containing structure
1015 * @ptr: the pointer to the member.
1016 * @type: the type of the container struct this is embedded in.
1017 * @member: the name of the member within the struct.
1018 *
1019 * If IS_ERR_OR_NULL(ptr), ptr is returned unchanged.
1020 */
1021#define container_of_safe(ptr, type, member) ({ \
1022 void *__mptr = (void *)(ptr); \
1023 BUILD_BUG_ON_MSG(!__same_type(*(ptr), ((type *)0)->member) && \
1024 !__same_type(*(ptr), void), \
1025 "pointer type mismatch in container_of()"); \
Dan Carpenter227abcc2018-04-26 08:58:27 +03001026 IS_ERR_OR_NULL(__mptr) ? ERR_CAST(__mptr) : \
NeilBrown05e65572018-03-29 15:26:48 +11001027 ((type *)(__mptr - offsetof(type, member))); })
1028
Arnaud Lacombeb9d4f422011-07-25 17:13:03 -07001029/* Rebuild everything on CONFIG_FTRACE_MCOUNT_RECORD */
1030#ifdef CONFIG_FTRACE_MCOUNT_RECORD
1031# define REBUILD_DUE_TO_FTRACE_MCOUNT_RECORD
1032#endif
WANG Cong9d00f922011-07-25 17:13:02 -07001033
Rusty Russell58f86cc2014-03-24 12:00:34 +10301034/* Permissions on a sysfs file: you didn't miss the 0 prefix did you? */
Gobinda Charan Maji28b8d0c2015-05-27 11:09:38 +09301035#define VERIFY_OCTAL_PERMISSIONS(perms) \
1036 (BUILD_BUG_ON_ZERO((perms) < 0) + \
1037 BUILD_BUG_ON_ZERO((perms) > 0777) + \
1038 /* USER_READABLE >= GROUP_READABLE >= OTHER_READABLE */ \
1039 BUILD_BUG_ON_ZERO((((perms) >> 6) & 4) < (((perms) >> 3) & 4)) + \
1040 BUILD_BUG_ON_ZERO((((perms) >> 3) & 4) < ((perms) & 4)) + \
1041 /* USER_WRITABLE >= GROUP_WRITABLE */ \
1042 BUILD_BUG_ON_ZERO((((perms) >> 6) & 2) < (((perms) >> 3) & 2)) + \
1043 /* OTHER_WRITABLE? Generally considered a bad idea. */ \
1044 BUILD_BUG_ON_ZERO((perms) & 2) + \
Rusty Russell58f86cc2014-03-24 12:00:34 +10301045 (perms))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001046#endif