blob: 6a1eb0b0aad96f2e8f890efb71ad5013a7241f20 [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>
David Howells607ca462012-10-13 10:46:48 +010017#include <uapi/linux/kernel.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070018
Alexey Dobriyan4be929b2010-05-24 14:33:03 -070019#define USHRT_MAX ((u16)(~0U))
20#define SHRT_MAX ((s16)(USHRT_MAX>>1))
21#define SHRT_MIN ((s16)(-SHRT_MAX - 1))
Linus Torvalds1da177e2005-04-16 15:20:36 -070022#define INT_MAX ((int)(~0U>>1))
23#define INT_MIN (-INT_MAX - 1)
24#define UINT_MAX (~0U)
25#define LONG_MAX ((long)(~0UL>>1))
26#define LONG_MIN (-LONG_MAX - 1)
27#define ULONG_MAX (~0UL)
OGAWA Hirofumi111ebb62006-06-23 02:03:26 -070028#define LLONG_MAX ((long long)(~0ULL>>1))
29#define LLONG_MIN (-LLONG_MAX - 1)
30#define ULLONG_MAX (~0ULL)
Xi Wanga3860c12012-05-31 16:26:04 -070031#define SIZE_MAX (~(size_t)0)
Linus Torvalds1da177e2005-04-16 15:20:36 -070032
Alex Elder89a07142014-01-23 15:54:00 -080033#define U8_MAX ((u8)~0U)
34#define S8_MAX ((s8)(U8_MAX>>1))
35#define S8_MIN ((s8)(-S8_MAX - 1))
36#define U16_MAX ((u16)~0U)
37#define S16_MAX ((s16)(U16_MAX>>1))
38#define S16_MIN ((s16)(-S16_MAX - 1))
39#define U32_MAX ((u32)~0U)
40#define S32_MAX ((s32)(U32_MAX>>1))
41#define S32_MIN ((s32)(-S32_MAX - 1))
42#define U64_MAX ((u64)~0ULL)
43#define S64_MAX ((s64)(U64_MAX>>1))
44#define S64_MIN ((s64)(-S64_MAX - 1))
45
Linus Torvalds1da177e2005-04-16 15:20:36 -070046#define STACK_MAGIC 0xdeadbeef
47
Randy Dunlape8c97af2017-10-13 15:58:11 -070048/**
49 * REPEAT_BYTE - repeat the value @x multiple times as an unsigned long value
50 * @x: value to repeat
51 *
52 * NOTE: @x is not checked for > 0xff; larger values produce odd results.
53 */
David S. Miller44696902012-05-23 20:12:50 -070054#define REPEAT_BYTE(x) ((~0ul / 0xff) * (x))
55
zijun_hu3ca45a42016-10-14 15:12:54 +080056/* @a is a power of 2 value */
Alexey Dobriyana79ff732010-04-13 11:21:46 +020057#define ALIGN(x, a) __ALIGN_KERNEL((x), (a))
Krzysztof Kozlowskied067d42017-04-11 20:08:34 +020058#define ALIGN_DOWN(x, a) __ALIGN_KERNEL((x) - ((a) - 1), (a))
Alexey Dobriyan9f93ff52010-04-13 14:09:15 +020059#define __ALIGN_MASK(x, mask) __ALIGN_KERNEL_MASK((x), (mask))
Matthew Wilcoxa83308e2007-09-11 15:23:47 -070060#define PTR_ALIGN(p, a) ((typeof(p))ALIGN((unsigned long)(p), (a)))
Herbert Xuf10db622008-02-06 01:37:05 -080061#define IS_ALIGNED(x, a) (((x) & ((typeof(x))(a) - 1)) == 0)
Linus Torvalds2ea58142006-11-26 19:05:22 -080062
Christoph Hellwigd3849952016-11-01 07:40:11 -060063/* generic data direction definitions */
64#define READ 0
65#define WRITE 1
66
Randy Dunlape8c97af2017-10-13 15:58:11 -070067/**
68 * ARRAY_SIZE - get the number of elements in array @arr
69 * @arr: array to be sized
70 */
Rusty Russellc5e631cf2007-05-06 14:51:05 -070071#define ARRAY_SIZE(arr) (sizeof(arr) / sizeof((arr)[0]) + __must_be_array(arr))
72
Gustavo Padovan3ed605b2016-04-26 12:32:27 -030073#define u64_to_user_ptr(x) ( \
74{ \
75 typecheck(u64, x); \
76 (void __user *)(uintptr_t)x; \
77} \
78)
79
Yinghai Lu9b3be9f2010-02-10 01:20:29 -080080/*
81 * This looks more complex than it should be. But we need to
82 * get the type for the ~ right in round_down (it needs to be
83 * as wide as the result!), and we want to evaluate the macro
84 * arguments just once each.
85 */
86#define __round_mask(x, y) ((__typeof__(x))((y)-1))
87#define round_up(x, y) ((((x)-1) | __round_mask(x, y))+1)
88#define round_down(x, y) ((x) & ~__round_mask(x, y))
89
Randy Dunlape8c97af2017-10-13 15:58:11 -070090/**
91 * FIELD_SIZEOF - get the size of a struct's field
92 * @t: the target struct
93 * @f: the target struct's field
94 * Return: the size of @f in the struct definition without having a
95 * declared instance of @t.
96 */
Jan Beulich4552d5d2006-06-26 13:57:28 +020097#define FIELD_SIZEOF(t, f) (sizeof(((t*)0)->f))
Randy Dunlape8c97af2017-10-13 15:58:11 -070098
Nicolas Dichtelb5d37552016-03-04 11:52:16 +010099#define DIV_ROUND_UP __KERNEL_DIV_ROUND_UP
Masahiro Yamada604df322017-09-08 16:13:45 -0700100
101#define DIV_ROUND_DOWN_ULL(ll, d) \
102 ({ unsigned long long _tmp = (ll); do_div(_tmp, d); _tmp; })
103
104#define DIV_ROUND_UP_ULL(ll, d) DIV_ROUND_DOWN_ULL((ll) + (d) - 1, (d))
Nicholas Bellinger36a26c62011-07-26 00:35:26 -0700105
106#if BITS_PER_LONG == 32
107# define DIV_ROUND_UP_SECTOR_T(ll,d) DIV_ROUND_UP_ULL(ll, d)
108#else
109# define DIV_ROUND_UP_SECTOR_T(ll,d) DIV_ROUND_UP(ll,d)
110#endif
James Morris074e61e2010-11-10 09:01:31 +1100111
112/* The `const' in roundup() prevents gcc-3.3 from calling __divdi3 */
Eric Parisb28efd52010-10-13 17:50:08 -0400113#define roundup(x, y) ( \
114{ \
Tetsuo Handa6070bf32010-11-08 11:20:49 +0900115 const typeof(y) __y = y; \
Eric Parisb28efd52010-10-13 17:50:08 -0400116 (((x) + (__y - 1)) / __y) * __y; \
117} \
118)
Eric Paris686a0f32010-10-13 17:50:02 -0400119#define rounddown(x, y) ( \
120{ \
121 typeof(x) __x = (x); \
122 __x - (__x % (y)); \
123} \
124)
Guenter Roeckb6d86d32012-08-24 17:25:01 -0700125
126/*
Niklas Söderlund4f5901f52017-02-24 15:01:01 -0800127 * Divide positive or negative dividend by positive or negative divisor
128 * and round to closest integer. Result is undefined for negative
Randy Dunlape8c97af2017-10-13 15:58:11 -0700129 * divisors if the dividend variable type is unsigned and for negative
Niklas Söderlund4f5901f52017-02-24 15:01:01 -0800130 * dividends if the divisor variable type is unsigned.
Guenter Roeckb6d86d32012-08-24 17:25:01 -0700131 */
Darrick J. Wong9fe06082009-01-06 14:40:51 -0800132#define DIV_ROUND_CLOSEST(x, divisor)( \
133{ \
Guenter Roeckb6d86d32012-08-24 17:25:01 -0700134 typeof(x) __x = x; \
135 typeof(divisor) __d = divisor; \
Guenter Roeckc4e18492012-12-20 15:05:42 -0800136 (((typeof(x))-1) > 0 || \
Niklas Söderlund4f5901f52017-02-24 15:01:01 -0800137 ((typeof(divisor))-1) > 0 || \
138 (((__x) > 0) == ((__d) > 0))) ? \
Guenter Roeckb6d86d32012-08-24 17:25:01 -0700139 (((__x) + ((__d) / 2)) / (__d)) : \
140 (((__x) - ((__d) / 2)) / (__d)); \
Darrick J. Wong9fe06082009-01-06 14:40:51 -0800141} \
142)
Javi Merinof7660932015-04-16 12:43:45 -0700143/*
144 * Same as above but for u64 dividends. divisor must be a 32-bit
145 * number.
146 */
147#define DIV_ROUND_CLOSEST_ULL(x, divisor)( \
148{ \
149 typeof(divisor) __d = divisor; \
150 unsigned long long _tmp = (x) + (__d) / 2; \
151 do_div(_tmp, __d); \
152 _tmp; \
153} \
154)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155
Salman Qazi9993bc632012-03-09 16:41:01 -0800156/*
157 * Multiplies an integer by a fraction, while avoiding unnecessary
158 * overflow or loss of precision.
159 */
160#define mult_frac(x, numer, denom)( \
161{ \
162 typeof(x) quot = (x) / (denom); \
163 typeof(x) rem = (x) % (denom); \
164 (quot * (numer)) + ((rem * (numer)) / (denom)); \
165} \
166)
167
168
Eduard - Gabriel Munteanuca31e142008-07-05 12:14:23 +0300169#define _RET_IP_ (unsigned long)__builtin_return_address(0)
170#define _THIS_IP_ ({ __label__ __here; __here: (unsigned long)&&__here; })
171
Bartlomiej Zolnierkiewicz90c699a2009-06-19 08:08:50 +0200172#ifdef CONFIG_LBDAF
Jens Axboe2da96ac2007-10-12 12:40:38 +0200173# include <asm/div64.h>
174# define sector_div(a, b) do_div(a, b)
175#else
176# define sector_div(n, b)( \
177{ \
178 int _res; \
179 _res = (n) % (b); \
180 (n) /= (b); \
181 _res; \
182} \
183)
184#endif
185
Andrew Morton218e1802007-05-10 03:15:18 -0700186/**
187 * upper_32_bits - return bits 32-63 of a number
188 * @n: the number we're accessing
189 *
190 * A basic shift-right of a 64- or 32-bit quantity. Use this to suppress
191 * the "right shift count >= width of type" warning when that quantity is
192 * 32-bits.
193 */
194#define upper_32_bits(n) ((u32)(((n) >> 16) >> 16))
195
Joerg Roedel204b8852008-07-29 22:33:42 -0700196/**
197 * lower_32_bits - return bits 0-31 of a number
198 * @n: the number we're accessing
199 */
200#define lower_32_bits(n) ((u32)(n))
201
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202struct completion;
akpm@osdl.orgdf2e71f2006-01-09 20:51:37 -0800203struct pt_regs;
204struct user;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700205
Uwe Kleine-König070cb062008-08-12 15:08:59 -0700206#ifdef CONFIG_PREEMPT_VOLUNTARY
207extern int _cond_resched(void);
208# define might_resched() _cond_resched()
209#else
210# define might_resched() do { } while (0)
211#endif
212
Frederic Weisbeckerd902db12011-06-08 19:31:56 +0200213#ifdef CONFIG_DEBUG_ATOMIC_SLEEP
Peter Zijlstra34274452014-09-24 10:18:56 +0200214 void ___might_sleep(const char *file, int line, int preempt_offset);
Simon Kagstromd8948372009-12-23 11:08:18 +0100215 void __might_sleep(const char *file, int line, int preempt_offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700216/**
217 * might_sleep - annotation for functions that can sleep
218 *
219 * this macro will print a stack trace if it is executed in an atomic
220 * context (spinlock, irq-handler, ...).
221 *
222 * This is a useful debugging help to be able to catch problems early and not
Jim Cromiee20ec992006-11-30 04:46:13 +0100223 * be bitten later when the calling function happens to sleep when it is not
Linus Torvalds1da177e2005-04-16 15:20:36 -0700224 * supposed to.
225 */
Ingo Molnarf8cbd992005-06-25 14:57:39 -0700226# define might_sleep() \
Frederic Weisbeckere4aafea2009-07-16 15:44:29 +0200227 do { __might_sleep(__FILE__, __LINE__, 0); might_resched(); } while (0)
Linus Torvalds00845eb2015-02-01 12:23:32 -0800228# define sched_annotate_sleep() (current->task_state_change = 0)
Ingo Molnarf8cbd992005-06-25 14:57:39 -0700229#else
Peter Zijlstra34274452014-09-24 10:18:56 +0200230 static inline void ___might_sleep(const char *file, int line,
231 int preempt_offset) { }
Simon Kagstromd8948372009-12-23 11:08:18 +0100232 static inline void __might_sleep(const char *file, int line,
233 int preempt_offset) { }
Ingo Molnarf8cbd992005-06-25 14:57:39 -0700234# define might_sleep() do { might_resched(); } while (0)
Peter Zijlstra1029a2b2014-09-24 10:18:49 +0200235# define sched_annotate_sleep() do { } while (0)
Ingo Molnarf8cbd992005-06-25 14:57:39 -0700236#endif
237
Hua Zhong368a5fa2006-06-23 02:05:42 -0700238#define might_sleep_if(cond) do { if (cond) might_sleep(); } while (0)
Ingo Molnarf8cbd992005-06-25 14:57:39 -0700239
Michal Nazarewiczc8299cb2015-11-09 14:58:10 -0800240/**
241 * abs - return absolute value of an argument
Michal Nazarewicz8f57e4d2016-01-15 16:57:58 -0800242 * @x: the value. If it is unsigned type, it is converted to signed type first.
243 * char is treated as if it was signed (regardless of whether it really is)
244 * but the macro's return type is preserved as char.
Michal Nazarewiczc8299cb2015-11-09 14:58:10 -0800245 *
Michal Nazarewicz8f57e4d2016-01-15 16:57:58 -0800246 * Return: an absolute value of x.
Andrew Morton71a90482011-01-12 16:59:35 -0800247 */
Michal Nazarewicz8f57e4d2016-01-15 16:57:58 -0800248#define abs(x) __abs_choose_expr(x, long long, \
249 __abs_choose_expr(x, long, \
250 __abs_choose_expr(x, int, \
251 __abs_choose_expr(x, short, \
252 __abs_choose_expr(x, char, \
253 __builtin_choose_expr( \
254 __builtin_types_compatible_p(typeof(x), char), \
255 (char)({ signed char __x = (x); __x<0?-__x:__x; }), \
256 ((void)0)))))))
257
258#define __abs_choose_expr(x, type, other) __builtin_choose_expr( \
259 __builtin_types_compatible_p(typeof(x), signed type) || \
260 __builtin_types_compatible_p(typeof(x), unsigned type), \
261 ({ signed type __x = (x); __x < 0 ? -__x : __x; }), other)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700262
Daniel Borkmann89770b02014-01-22 02:29:40 +0100263/**
264 * reciprocal_scale - "scale" a value into range [0, ep_ro)
265 * @val: value
266 * @ep_ro: right open interval endpoint
267 *
268 * Perform a "reciprocal multiplication" in order to "scale" a value into
Randy Dunlape8c97af2017-10-13 15:58:11 -0700269 * range [0, @ep_ro), where the upper interval endpoint is right-open.
Daniel Borkmann89770b02014-01-22 02:29:40 +0100270 * This is useful, e.g. for accessing a index of an array containing
Randy Dunlape8c97af2017-10-13 15:58:11 -0700271 * @ep_ro elements, for example. Think of it as sort of modulus, only that
Daniel Borkmann89770b02014-01-22 02:29:40 +0100272 * the result isn't that of modulo. ;) Note that if initial input is a
273 * small value, then result will return 0.
274 *
Randy Dunlape8c97af2017-10-13 15:58:11 -0700275 * Return: a result based on @val in interval [0, @ep_ro).
Daniel Borkmann89770b02014-01-22 02:29:40 +0100276 */
277static inline u32 reciprocal_scale(u32 val, u32 ep_ro)
278{
279 return (u32)(((u64) val * ep_ro) >> 32);
280}
281
Axel Lin386e7902013-12-12 17:12:24 -0800282#if defined(CONFIG_MMU) && \
283 (defined(CONFIG_PROVE_LOCKING) || defined(CONFIG_DEBUG_ATOMIC_SLEEP))
David Hildenbrand9ec23532015-05-11 17:52:07 +0200284#define might_fault() __might_fault(__FILE__, __LINE__)
285void __might_fault(const char *file, int line);
Nick Piggin3ee1afa2008-09-10 13:37:17 +0200286#else
Michael S. Tsirkin662bbcb2013-05-26 17:32:23 +0300287static inline void might_fault(void) { }
Nick Piggin3ee1afa2008-09-10 13:37:17 +0200288#endif
289
Alan Sterne041c682006-03-27 01:16:30 -0800290extern struct atomic_notifier_head panic_notifier_list;
TAMUKI Shoichic7ff0d92010-08-10 18:03:28 -0700291extern long (*panic_blink)(int state);
Joe Perches9402c952012-01-12 17:17:17 -0800292__printf(1, 2)
Peter Zijlstra9af65282016-09-13 18:37:29 +0200293void panic(const char *fmt, ...) __noreturn __cold;
Hidehiro Kawaiebc41f22016-03-22 14:27:17 -0700294void nmi_panic(struct pt_regs *regs, const char *msg);
Andrew Mortondd287792006-03-23 03:00:57 -0800295extern void oops_enter(void);
296extern void oops_exit(void);
Anton Blanchard863a6042010-08-10 18:03:30 -0700297void print_oops_end_marker(void);
Andrew Mortondd287792006-03-23 03:00:57 -0800298extern int oops_may_print(void);
Peter Zijlstra9af65282016-09-13 18:37:29 +0200299void do_exit(long error_code) __noreturn;
300void complete_and_exit(struct completion *, long) __noreturn;
Alexey Dobriyan33ee3b22011-03-22 16:34:40 -0700301
Kees Cook7a46ec02017-08-15 09:19:24 -0700302#ifdef CONFIG_ARCH_HAS_REFCOUNT
303void refcount_error_report(struct pt_regs *regs, const char *err);
304#else
305static inline void refcount_error_report(struct pt_regs *regs, const char *err)
306{ }
307#endif
308
Alexey Dobriyan33ee3b22011-03-22 16:34:40 -0700309/* Internal, do not use. */
310int __must_check _kstrtoul(const char *s, unsigned int base, unsigned long *res);
311int __must_check _kstrtol(const char *s, unsigned int base, long *res);
312
313int __must_check kstrtoull(const char *s, unsigned int base, unsigned long long *res);
314int __must_check kstrtoll(const char *s, unsigned int base, long long *res);
Eldad Zack4c925d62012-12-17 16:03:04 -0800315
316/**
317 * kstrtoul - convert a string to an unsigned long
318 * @s: The start of the string. The string must be null-terminated, and may also
319 * include a single newline before its terminating null. The first character
320 * may also be a plus sign, but not a minus sign.
321 * @base: The number base to use. The maximum supported base is 16. If base is
322 * given as 0, then the base of the string is automatically detected with the
323 * conventional semantics - If it begins with 0x the number will be parsed as a
324 * hexadecimal (case insensitive), if it otherwise begins with 0, it will be
325 * parsed as an octal number. Otherwise it will be parsed as a decimal.
326 * @res: Where to write the result of the conversion on success.
327 *
328 * Returns 0 on success, -ERANGE on overflow and -EINVAL on parsing error.
329 * Used as a replacement for the obsolete simple_strtoull. Return code must
330 * be checked.
331*/
Alexey Dobriyan33ee3b22011-03-22 16:34:40 -0700332static inline int __must_check kstrtoul(const char *s, unsigned int base, unsigned long *res)
333{
334 /*
335 * We want to shortcut function call, but
336 * __builtin_types_compatible_p(unsigned long, unsigned long long) = 0.
337 */
338 if (sizeof(unsigned long) == sizeof(unsigned long long) &&
339 __alignof__(unsigned long) == __alignof__(unsigned long long))
340 return kstrtoull(s, base, (unsigned long long *)res);
341 else
342 return _kstrtoul(s, base, res);
343}
344
Eldad Zack4c925d62012-12-17 16:03:04 -0800345/**
346 * kstrtol - convert a string to a long
347 * @s: The start of the string. The string must be null-terminated, and may also
348 * include a single newline before its terminating null. The first character
349 * may also be a plus sign or a minus sign.
350 * @base: The number base to use. The maximum supported base is 16. If base is
351 * given as 0, then the base of the string is automatically detected with the
352 * conventional semantics - If it begins with 0x the number will be parsed as a
353 * hexadecimal (case insensitive), if it otherwise begins with 0, it will be
354 * parsed as an octal number. Otherwise it will be parsed as a decimal.
355 * @res: Where to write the result of the conversion on success.
356 *
357 * Returns 0 on success, -ERANGE on overflow and -EINVAL on parsing error.
358 * Used as a replacement for the obsolete simple_strtoull. Return code must
359 * be checked.
360 */
Alexey Dobriyan33ee3b22011-03-22 16:34:40 -0700361static inline int __must_check kstrtol(const char *s, unsigned int base, long *res)
362{
363 /*
364 * We want to shortcut function call, but
365 * __builtin_types_compatible_p(long, long long) = 0.
366 */
367 if (sizeof(long) == sizeof(long long) &&
368 __alignof__(long) == __alignof__(long long))
369 return kstrtoll(s, base, (long long *)res);
370 else
371 return _kstrtol(s, base, res);
372}
373
374int __must_check kstrtouint(const char *s, unsigned int base, unsigned int *res);
375int __must_check kstrtoint(const char *s, unsigned int base, int *res);
376
377static inline int __must_check kstrtou64(const char *s, unsigned int base, u64 *res)
378{
379 return kstrtoull(s, base, res);
380}
381
382static inline int __must_check kstrtos64(const char *s, unsigned int base, s64 *res)
383{
384 return kstrtoll(s, base, res);
385}
386
387static inline int __must_check kstrtou32(const char *s, unsigned int base, u32 *res)
388{
389 return kstrtouint(s, base, res);
390}
391
392static inline int __must_check kstrtos32(const char *s, unsigned int base, s32 *res)
393{
394 return kstrtoint(s, base, res);
395}
396
397int __must_check kstrtou16(const char *s, unsigned int base, u16 *res);
398int __must_check kstrtos16(const char *s, unsigned int base, s16 *res);
399int __must_check kstrtou8(const char *s, unsigned int base, u8 *res);
400int __must_check kstrtos8(const char *s, unsigned int base, s8 *res);
Kees Cookef951592016-03-17 14:22:50 -0700401int __must_check kstrtobool(const char *s, bool *res);
Alexey Dobriyan33ee3b22011-03-22 16:34:40 -0700402
Alexey Dobriyanc196e322011-05-24 17:13:31 -0700403int __must_check kstrtoull_from_user(const char __user *s, size_t count, unsigned int base, unsigned long long *res);
404int __must_check kstrtoll_from_user(const char __user *s, size_t count, unsigned int base, long long *res);
405int __must_check kstrtoul_from_user(const char __user *s, size_t count, unsigned int base, unsigned long *res);
406int __must_check kstrtol_from_user(const char __user *s, size_t count, unsigned int base, long *res);
407int __must_check kstrtouint_from_user(const char __user *s, size_t count, unsigned int base, unsigned int *res);
408int __must_check kstrtoint_from_user(const char __user *s, size_t count, unsigned int base, int *res);
409int __must_check kstrtou16_from_user(const char __user *s, size_t count, unsigned int base, u16 *res);
410int __must_check kstrtos16_from_user(const char __user *s, size_t count, unsigned int base, s16 *res);
411int __must_check kstrtou8_from_user(const char __user *s, size_t count, unsigned int base, u8 *res);
412int __must_check kstrtos8_from_user(const char __user *s, size_t count, unsigned int base, s8 *res);
Kees Cookef951592016-03-17 14:22:50 -0700413int __must_check kstrtobool_from_user(const char __user *s, size_t count, bool *res);
Alexey Dobriyanc196e322011-05-24 17:13:31 -0700414
415static inline int __must_check kstrtou64_from_user(const char __user *s, size_t count, unsigned int base, u64 *res)
416{
417 return kstrtoull_from_user(s, count, base, res);
418}
419
420static inline int __must_check kstrtos64_from_user(const char __user *s, size_t count, unsigned int base, s64 *res)
421{
422 return kstrtoll_from_user(s, count, base, res);
423}
424
425static inline int __must_check kstrtou32_from_user(const char __user *s, size_t count, unsigned int base, u32 *res)
426{
427 return kstrtouint_from_user(s, count, base, res);
428}
429
430static inline int __must_check kstrtos32_from_user(const char __user *s, size_t count, unsigned int base, s32 *res)
431{
432 return kstrtoint_from_user(s, count, base, res);
433}
434
Joe Perches67d0a072011-10-31 17:13:10 -0700435/* Obsolete, do not use. Use kstrto<foo> instead */
436
Linus Torvalds1da177e2005-04-16 15:20:36 -0700437extern unsigned long simple_strtoul(const char *,char **,unsigned int);
438extern long simple_strtol(const char *,char **,unsigned int);
439extern unsigned long long simple_strtoull(const char *,char **,unsigned int);
440extern long long simple_strtoll(const char *,char **,unsigned int);
Alexey Dobriyan33ee3b22011-03-22 16:34:40 -0700441
Andrei Vagind1be35c2018-04-10 16:31:16 -0700442extern int num_to_str(char *buf, int size,
443 unsigned long long num, unsigned int width);
KAMEZAWA Hiroyuki1ac101a2012-03-23 15:02:54 -0700444
Joe Perches67d0a072011-10-31 17:13:10 -0700445/* lib/printf utilities */
446
Joe Perchesb9075fa2011-10-31 17:11:33 -0700447extern __printf(2, 3) int sprintf(char *buf, const char * fmt, ...);
448extern __printf(2, 0) int vsprintf(char *buf, const char *, va_list);
449extern __printf(3, 4)
450int snprintf(char *buf, size_t size, const char *fmt, ...);
451extern __printf(3, 0)
452int vsnprintf(char *buf, size_t size, const char *fmt, va_list args);
453extern __printf(3, 4)
454int scnprintf(char *buf, size_t size, const char *fmt, ...);
455extern __printf(3, 0)
456int vscnprintf(char *buf, size_t size, const char *fmt, va_list args);
Rasmus Villemoes48a270552016-05-19 17:10:55 -0700457extern __printf(2, 3) __malloc
Joe Perchesb9075fa2011-10-31 17:11:33 -0700458char *kasprintf(gfp_t gfp, const char *fmt, ...);
Rasmus Villemoes48a270552016-05-19 17:10:55 -0700459extern __printf(2, 0) __malloc
Nicolas Iooss8db14862015-07-17 16:23:42 -0700460char *kvasprintf(gfp_t gfp, const char *fmt, va_list args);
Rasmus Villemoes0a9df782015-11-06 16:31:20 -0800461extern __printf(2, 0)
462const char *kvasprintf_const(gfp_t gfp, const char *fmt, va_list args);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700463
Joe Perches6061d942012-03-23 15:02:16 -0700464extern __scanf(2, 3)
465int sscanf(const char *, const char *, ...);
466extern __scanf(2, 0)
467int vsscanf(const char *, const char *, va_list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700468
469extern int get_option(char **str, int *pint);
470extern char *get_options(const char *str, int nints, int *ints);
Jeremy Fitzhardinged974ae32008-07-24 16:27:46 -0700471extern unsigned long long memparse(const char *ptr, char **retptr);
Dave Young6ccc72b82014-08-14 17:15:27 +0800472extern bool parse_option_str(const char *str, const char *option);
Baoquan Hef51b17c2017-04-17 21:34:56 +0800473extern char *next_arg(char *args, char **param, char **val);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700474
Trent Piepho5e376612006-05-15 09:44:06 -0700475extern int core_kernel_text(unsigned long addr);
Josh Poimboeuf9fbcc572018-02-20 11:37:53 -0600476extern int init_kernel_text(unsigned long addr);
Steven Rostedtcdbe61b2011-05-05 21:14:55 -0400477extern int core_kernel_data(unsigned long addr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700478extern int __kernel_text_address(unsigned long addr);
479extern int kernel_text_address(unsigned long addr);
Arjan van de Venab7476c2008-08-15 15:29:38 -0700480extern int func_ptr_is_kernel_text(void *ptr);
Arjan van de Venab7476c2008-08-15 15:29:38 -0700481
Linus Torvalds1da177e2005-04-16 15:20:36 -0700482unsigned long int_sqrt(unsigned long);
483
Crt Mori47a36162018-01-11 11:19:57 +0100484#if BITS_PER_LONG < 64
485u32 int_sqrt64(u64 x);
486#else
487static inline u32 int_sqrt64(u64 x)
488{
489 return (u32)int_sqrt(x);
490}
491#endif
492
Linus Torvalds1da177e2005-04-16 15:20:36 -0700493extern void bust_spinlocks(int yes);
494extern int oops_in_progress; /* If set, an oops, panic(), BUG() or die() is in progress */
Adrian Bunkaa727102006-04-10 22:53:59 -0700495extern int panic_timeout;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496extern int panic_on_oops;
Don Zickus8da5add2006-09-26 10:52:27 +0200497extern int panic_on_unrecovered_nmi;
Kurt Garloff5211a242009-06-24 14:32:11 -0700498extern int panic_on_io_nmi;
Prarit Bhargava9e3961a2014-12-10 15:45:50 -0800499extern int panic_on_warn;
Daniel Bristot de Oliveira088e9d22016-06-02 13:51:41 -0300500extern int sysctl_panic_on_rcu_stall;
Mitsuo Hayasaka55af7792011-11-29 15:08:36 +0900501extern int sysctl_panic_on_stackoverflow;
HATAYAMA Daisuke5375b702015-06-30 14:57:46 -0700502
503extern bool crash_kexec_post_notifiers;
504
Jason Baron5800dc32013-11-25 23:23:04 +0000505/*
Hidehiro Kawai1717f202015-12-14 11:19:09 +0100506 * panic_cpu is used for synchronizing panic() and crash_kexec() execution. It
507 * holds a CPU number which is executing panic() currently. A value of
508 * PANIC_CPU_INVALID means no CPU has entered panic() or crash_kexec().
509 */
510extern atomic_t panic_cpu;
511#define PANIC_CPU_INVALID -1
512
513/*
Jason Baron5800dc32013-11-25 23:23:04 +0000514 * Only to be used by arch init code. If the user over-wrote the default
515 * CONFIG_PANIC_TIMEOUT, honor it.
516 */
517static inline void set_arch_panic_timeout(int timeout, int arch_default_timeout)
518{
519 if (panic_timeout == arch_default_timeout)
520 panic_timeout = timeout;
521}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700522extern const char *print_tainted(void);
Rusty Russell373d4d02013-01-21 17:17:39 +1030523enum lockdep_ok {
524 LOCKDEP_STILL_OK,
525 LOCKDEP_NOW_UNRELIABLE
526};
527extern void add_taint(unsigned flag, enum lockdep_ok);
Andi Kleen25ddbb12008-10-15 22:01:41 -0700528extern int test_taint(unsigned flag);
529extern unsigned long get_taint(void);
David Howellsb920de12008-02-08 04:19:31 -0800530extern int root_mountflags;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700531
Tejun Heo2ce802f2011-01-20 12:06:35 +0100532extern bool early_boot_irqs_disabled;
533
Thomas Gleixner69a78ff2017-05-16 20:42:47 +0200534/*
535 * Values used for system_state. Ordering of the states must not be changed
536 * as code checks for <, <=, >, >= STATE.
537 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700538extern enum system_states {
539 SYSTEM_BOOTING,
Thomas Gleixner69a78ff2017-05-16 20:42:47 +0200540 SYSTEM_SCHEDULING,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700541 SYSTEM_RUNNING,
542 SYSTEM_HALT,
543 SYSTEM_POWER_OFF,
544 SYSTEM_RESTART,
545} system_state;
546
Kees Cook47d4b262018-04-10 16:32:26 -0700547/* This cannot be an enum because some may be used in assembly source. */
Andi Kleen25ddbb12008-10-15 22:01:41 -0700548#define TAINT_PROPRIETARY_MODULE 0
549#define TAINT_FORCED_MODULE 1
Dave Jones8c904872014-02-26 10:49:49 -0500550#define TAINT_CPU_OUT_OF_SPEC 2
Andi Kleen25ddbb12008-10-15 22:01:41 -0700551#define TAINT_FORCED_RMMOD 3
552#define TAINT_MACHINE_CHECK 4
553#define TAINT_BAD_PAGE 5
554#define TAINT_USER 6
555#define TAINT_DIE 7
556#define TAINT_OVERRIDDEN_ACPI_TABLE 8
557#define TAINT_WARN 9
Linus Torvalds26e9a392008-10-17 09:50:12 -0700558#define TAINT_CRAP 10
Ben Hutchings92946bc2010-04-03 19:36:42 +0100559#define TAINT_FIRMWARE_WORKAROUND 11
Ben Hutchings2449b8b2011-10-24 15:12:28 +0200560#define TAINT_OOT_MODULE 12
Mathieu Desnoyers66cc69e2014-03-13 12:11:30 +1030561#define TAINT_UNSIGNED_MODULE 13
Josh Hunt69361ee2014-08-08 14:22:31 -0700562#define TAINT_SOFTLOCKUP 14
Seth Jenningsc5f45462014-12-16 11:58:18 -0600563#define TAINT_LIVEPATCH 15
Borislav Petkov4efb442c2017-11-17 15:30:38 -0800564#define TAINT_AUX 16
Kees Cookbc4f2f52018-04-10 16:32:33 -0700565#define TAINT_RANDSTRUCT 17
566#define TAINT_FLAGS_COUNT 18
Petr Mladek7fd83292016-09-21 13:47:22 +0200567
568struct taint_flag {
Larry Finger5eb7c0d2017-01-01 20:25:25 -0600569 char c_true; /* character printed when tainted */
570 char c_false; /* character printed when not tainted */
Petr Mladek7fd83292016-09-21 13:47:22 +0200571 bool module; /* also show as a per-module taint flag */
572};
573
574extern const struct taint_flag taint_flags[TAINT_FLAGS_COUNT];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700575
Harvey Harrison3fc95772008-05-14 16:05:49 -0700576extern const char hex_asc[];
577#define hex_asc_lo(x) hex_asc[((x) & 0x0f)]
578#define hex_asc_hi(x) hex_asc[((x) & 0xf0) >> 4]
579
Andy Shevchenko55036ba2011-10-31 17:12:41 -0700580static inline char *hex_byte_pack(char *buf, u8 byte)
Harvey Harrison3fc95772008-05-14 16:05:49 -0700581{
582 *buf++ = hex_asc_hi(byte);
583 *buf++ = hex_asc_lo(byte);
584 return buf;
585}
Randy Dunlap99eaf3c2007-05-10 22:22:39 -0700586
Andre Naujoksc26d4362013-09-13 19:37:12 +0200587extern const char hex_asc_upper[];
588#define hex_asc_upper_lo(x) hex_asc_upper[((x) & 0x0f)]
589#define hex_asc_upper_hi(x) hex_asc_upper[((x) & 0xf0) >> 4]
590
591static inline char *hex_byte_pack_upper(char *buf, u8 byte)
592{
593 *buf++ = hex_asc_upper_hi(byte);
594 *buf++ = hex_asc_upper_lo(byte);
595 return buf;
596}
597
Andy Shevchenko903788892010-05-24 14:33:23 -0700598extern int hex_to_bin(char ch);
Mimi Zoharb7804982011-09-20 11:23:49 -0400599extern int __must_check hex2bin(u8 *dst, const char *src, size_t count);
David Howells53d91c52014-09-16 17:36:01 +0100600extern char *bin2hex(char *dst, const void *src, size_t count);
Andy Shevchenko903788892010-05-24 14:33:23 -0700601
Joe Perchesa69f5ed2014-06-24 11:20:48 -0700602bool mac_pton(const char *s, u8 *mac);
Andy Shevchenko4cd57732013-06-04 19:46:26 +0300603
Joe Perches8a64f332009-12-14 18:00:25 -0800604/*
Ingo Molnar526211b2009-03-05 10:28:45 +0100605 * General tracing related utility functions - trace_printk(),
Steven Rostedt2002c252009-03-05 10:35:56 -0500606 * tracing_on/tracing_off and tracing_start()/tracing_stop
607 *
608 * Use tracing_on/tracing_off when you want to quickly turn on or off
609 * tracing. It simply enables or disables the recording of the trace events.
GeunSik Lim156f5a72009-06-02 15:01:37 +0900610 * This also corresponds to the user space /sys/kernel/debug/tracing/tracing_on
Steven Rostedt2002c252009-03-05 10:35:56 -0500611 * file, which gives a means for the kernel and userspace to interact.
612 * Place a tracing_off() in the kernel where you want tracing to end.
613 * From user space, examine the trace, and then echo 1 > tracing_on
614 * to continue tracing.
615 *
616 * tracing_stop/tracing_start has slightly more overhead. It is used
617 * by things like suspend to ram where disabling the recording of the
618 * trace is not enough, but tracing must actually stop because things
619 * like calling smp_processor_id() may crash the system.
620 *
621 * Most likely, you want to use tracing_on/tracing_off.
Ingo Molnar526211b2009-03-05 10:28:45 +0100622 */
Frederic Weisbeckercecbca92010-04-18 19:08:41 +0200623
624enum ftrace_dump_mode {
625 DUMP_NONE,
626 DUMP_ALL,
627 DUMP_ORIG,
628};
629
Ingo Molnar526211b2009-03-05 10:28:45 +0100630#ifdef CONFIG_TRACING
Steven Rostedt93d68e52012-03-20 12:28:29 -0400631void tracing_on(void);
632void tracing_off(void);
633int tracing_is_on(void);
Steven Rostedt (Red Hat)ad909e22013-03-06 21:45:37 -0500634void tracing_snapshot(void);
635void tracing_snapshot_alloc(void);
Steven Rostedt93d68e52012-03-20 12:28:29 -0400636
Ingo Molnar526211b2009-03-05 10:28:45 +0100637extern void tracing_start(void);
638extern void tracing_stop(void);
Ingo Molnar526211b2009-03-05 10:28:45 +0100639
Joe Perchesb9075fa2011-10-31 17:11:33 -0700640static inline __printf(1, 2)
641void ____trace_printk_check_format(const char *fmt, ...)
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100642{
643}
644#define __trace_printk_check_format(fmt, args...) \
645do { \
646 if (0) \
647 ____trace_printk_check_format(fmt, ##args); \
648} while (0)
649
Ingo Molnar526211b2009-03-05 10:28:45 +0100650/**
651 * trace_printk - printf formatting in the ftrace buffer
652 * @fmt: the printf format for printing
653 *
Randy Dunlape8c97af2017-10-13 15:58:11 -0700654 * Note: __trace_printk is an internal function for trace_printk() and
655 * the @ip is passed in via the trace_printk() macro.
Ingo Molnar526211b2009-03-05 10:28:45 +0100656 *
657 * This function allows a kernel developer to debug fast path sections
658 * that printk is not appropriate for. By scattering in various
659 * printk like tracing in the code, a developer can quickly see
660 * where problems are occurring.
661 *
662 * This is intended as a debugging tool for the developer only.
663 * Please refrain from leaving trace_printks scattered around in
Steven Rostedt (Red Hat)09ae7232013-03-08 21:02:34 -0500664 * your code. (Extra memory is used for special buffers that are
Randy Dunlape8c97af2017-10-13 15:58:11 -0700665 * allocated when trace_printk() is used.)
Steven Rostedt (Red Hat)9d3c752c2013-03-08 22:11:57 -0500666 *
667 * A little optization trick is done here. If there's only one
668 * argument, there's no need to scan the string for printf formats.
669 * The trace_puts() will suffice. But how can we take advantage of
670 * using trace_puts() when trace_printk() has only one argument?
671 * By stringifying the args and checking the size we can tell
672 * whether or not there are args. __stringify((__VA_ARGS__)) will
673 * turn into "()\0" with a size of 3 when there are no args, anything
674 * else will be bigger. All we need to do is define a string to this,
675 * and then take its size and compare to 3. If it's bigger, use
676 * do_trace_printk() otherwise, optimize it to trace_puts(). Then just
677 * let gcc optimize the rest.
Ingo Molnar526211b2009-03-05 10:28:45 +0100678 */
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100679
Steven Rostedt (Red Hat)9d3c752c2013-03-08 22:11:57 -0500680#define trace_printk(fmt, ...) \
681do { \
682 char _______STR[] = __stringify((__VA_ARGS__)); \
683 if (sizeof(_______STR) > 3) \
684 do_trace_printk(fmt, ##__VA_ARGS__); \
685 else \
686 trace_puts(fmt); \
687} while (0)
688
689#define do_trace_printk(fmt, args...) \
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100690do { \
Steven Rostedt (Red Hat)3debb0a2016-03-22 17:30:58 -0400691 static const char *trace_printk_fmt __used \
Steven Rostedt07d777f2011-09-22 14:01:55 -0400692 __attribute__((section("__trace_printk_fmt"))) = \
693 __builtin_constant_p(fmt) ? fmt : NULL; \
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100694 \
Steven Rostedt07d777f2011-09-22 14:01:55 -0400695 __trace_printk_check_format(fmt, ##args); \
696 \
697 if (__builtin_constant_p(fmt)) \
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100698 __trace_bprintk(_THIS_IP_, trace_printk_fmt, ##args); \
Steven Rostedt07d777f2011-09-22 14:01:55 -0400699 else \
700 __trace_printk(_THIS_IP_, fmt, ##args); \
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100701} while (0)
702
Joe Perchesb9075fa2011-10-31 17:11:33 -0700703extern __printf(2, 3)
704int __trace_bprintk(unsigned long ip, const char *fmt, ...);
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100705
Joe Perchesb9075fa2011-10-31 17:11:33 -0700706extern __printf(2, 3)
707int __trace_printk(unsigned long ip, const char *fmt, ...);
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100708
Steven Rostedt (Red Hat)09ae7232013-03-08 21:02:34 -0500709/**
710 * trace_puts - write a string into the ftrace buffer
711 * @str: the string to record
712 *
713 * Note: __trace_bputs is an internal function for trace_puts and
714 * the @ip is passed in via the trace_puts macro.
715 *
716 * This is similar to trace_printk() but is made for those really fast
Randy Dunlape8c97af2017-10-13 15:58:11 -0700717 * paths that a developer wants the least amount of "Heisenbug" effects,
Steven Rostedt (Red Hat)09ae7232013-03-08 21:02:34 -0500718 * where the processing of the print format is still too much.
719 *
720 * This function allows a kernel developer to debug fast path sections
721 * that printk is not appropriate for. By scattering in various
722 * printk like tracing in the code, a developer can quickly see
723 * where problems are occurring.
724 *
725 * This is intended as a debugging tool for the developer only.
726 * Please refrain from leaving trace_puts scattered around in
727 * your code. (Extra memory is used for special buffers that are
Randy Dunlape8c97af2017-10-13 15:58:11 -0700728 * allocated when trace_puts() is used.)
Steven Rostedt (Red Hat)09ae7232013-03-08 21:02:34 -0500729 *
730 * Returns: 0 if nothing was written, positive # if string was.
731 * (1 when __trace_bputs is used, strlen(str) when __trace_puts is used)
732 */
733
Steven Rostedt (Red Hat)09ae7232013-03-08 21:02:34 -0500734#define trace_puts(str) ({ \
Steven Rostedt (Red Hat)3debb0a2016-03-22 17:30:58 -0400735 static const char *trace_printk_fmt __used \
Steven Rostedt (Red Hat)09ae7232013-03-08 21:02:34 -0500736 __attribute__((section("__trace_printk_fmt"))) = \
737 __builtin_constant_p(str) ? str : NULL; \
738 \
739 if (__builtin_constant_p(str)) \
740 __trace_bputs(_THIS_IP_, trace_printk_fmt); \
741 else \
742 __trace_puts(_THIS_IP_, str, strlen(str)); \
743})
Steven Rostedtbcf312c2013-05-02 11:26:13 -0400744extern int __trace_bputs(unsigned long ip, const char *str);
745extern int __trace_puts(unsigned long ip, const char *str, int size);
Steven Rostedt (Red Hat)09ae7232013-03-08 21:02:34 -0500746
Steven Rostedt (Red Hat)c142be82013-03-13 09:55:57 -0400747extern void trace_dump_stack(int skip);
Steven Rostedt03889382009-12-11 09:48:22 -0500748
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100749/*
750 * The double __builtin_constant_p is because gcc will give us an error
751 * if we try to allocate the static variable to fmt if it is not a
752 * constant. Even with the outer if statement.
753 */
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100754#define ftrace_vprintk(fmt, vargs) \
755do { \
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100756 if (__builtin_constant_p(fmt)) { \
Steven Rostedt (Red Hat)3debb0a2016-03-22 17:30:58 -0400757 static const char *trace_printk_fmt __used \
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100758 __attribute__((section("__trace_printk_fmt"))) = \
759 __builtin_constant_p(fmt) ? fmt : NULL; \
Ingo Molnar7bffc232009-03-09 10:11:36 +0100760 \
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100761 __ftrace_vbprintk(_THIS_IP_, trace_printk_fmt, vargs); \
762 } else \
763 __ftrace_vprintk(_THIS_IP_, fmt, vargs); \
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100764} while (0)
765
Nicolas Iooss8db14862015-07-17 16:23:42 -0700766extern __printf(2, 0) int
Frederic Weisbecker48ead022009-03-12 18:24:49 +0100767__ftrace_vbprintk(unsigned long ip, const char *fmt, va_list ap);
768
Nicolas Iooss8db14862015-07-17 16:23:42 -0700769extern __printf(2, 0) int
Ingo Molnar526211b2009-03-05 10:28:45 +0100770__ftrace_vprintk(unsigned long ip, const char *fmt, va_list ap);
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100771
Frederic Weisbeckercecbca92010-04-18 19:08:41 +0200772extern void ftrace_dump(enum ftrace_dump_mode oops_dump_mode);
Ingo Molnar526211b2009-03-05 10:28:45 +0100773#else
Ingo Molnar526211b2009-03-05 10:28:45 +0100774static inline void tracing_start(void) { }
775static inline void tracing_stop(void) { }
Dhaval Gianie67bc512013-08-02 14:47:29 -0400776static inline void trace_dump_stack(int skip) { }
Steven Rostedt93d68e52012-03-20 12:28:29 -0400777
778static inline void tracing_on(void) { }
779static inline void tracing_off(void) { }
780static inline int tracing_is_on(void) { return 0; }
Steven Rostedt (Red Hat)ad909e22013-03-06 21:45:37 -0500781static inline void tracing_snapshot(void) { }
782static inline void tracing_snapshot_alloc(void) { }
Steven Rostedt93d68e52012-03-20 12:28:29 -0400783
Michal Hocko60efc152012-10-25 15:41:51 +0200784static inline __printf(1, 2)
785int trace_printk(const char *fmt, ...)
Ingo Molnar526211b2009-03-05 10:28:45 +0100786{
787 return 0;
788}
Nicolas Iooss8db14862015-07-17 16:23:42 -0700789static __printf(1, 0) inline int
Ingo Molnar526211b2009-03-05 10:28:45 +0100790ftrace_vprintk(const char *fmt, va_list ap)
791{
792 return 0;
793}
Frederic Weisbeckercecbca92010-04-18 19:08:41 +0200794static inline void ftrace_dump(enum ftrace_dump_mode oops_dump_mode) { }
Frederic Weisbecker769b0442009-03-06 17:21:49 +0100795#endif /* CONFIG_TRACING */
Ingo Molnar526211b2009-03-05 10:28:45 +0100796
797/*
Kees Cook3c8ba0d2018-03-30 18:52:36 -0700798 * min()/max()/clamp() macros must accomplish three things:
799 *
800 * - avoid multiple evaluations of the arguments (so side-effects like
801 * "x++" happen only once) when non-constant.
802 * - perform strict type-checking (to generate warnings instead of
803 * nasty runtime surprises). See the "unnecessary" pointer comparison
804 * in __typecheck().
805 * - retain result as a constant expressions when called with only
806 * constant expressions (to avoid tripping VLA warnings in stack
807 * allocation usage).
Linus Torvalds1da177e2005-04-16 15:20:36 -0700808 */
Kees Cook3c8ba0d2018-03-30 18:52:36 -0700809#define __typecheck(x, y) \
810 (!!(sizeof((typeof(x) *)1 == (typeof(y) *)1)))
811
812/*
813 * This returns a constant expression while determining if an argument is
814 * a constant expression, most importantly without evaluating the argument.
815 * Glory to Martin Uecker <Martin.Uecker@med.uni-goettingen.de>
816 */
817#define __is_constexpr(x) \
818 (sizeof(int) == sizeof(*(8 ? ((void *)((long)(x) * 0l)) : (int *)8)))
819
820#define __no_side_effects(x, y) \
821 (__is_constexpr(x) && __is_constexpr(y))
822
823#define __safe_cmp(x, y) \
824 (__typecheck(x, y) && __no_side_effects(x, y))
825
826#define __cmp(x, y, op) ((x) op (y) ? (x) : (y))
827
Linus Torvaldse9092d02018-04-09 10:34:07 -0700828#define __cmp_once(x, y, unique_x, unique_y, op) ({ \
829 typeof(x) unique_x = (x); \
830 typeof(y) unique_y = (y); \
831 __cmp(unique_x, unique_y, op); })
Kees Cook3c8ba0d2018-03-30 18:52:36 -0700832
Linus Torvaldse9092d02018-04-09 10:34:07 -0700833#define __careful_cmp(x, y, op) \
834 __builtin_choose_expr(__safe_cmp(x, y), \
835 __cmp(x, y, op), \
836 __cmp_once(x, y, __UNIQUE_ID(__x), __UNIQUE_ID(__y), op))
Randy Dunlape8c97af2017-10-13 15:58:11 -0700837
838/**
839 * min - return minimum of two values of the same or compatible types
840 * @x: first value
841 * @y: second value
842 */
Kees Cook3c8ba0d2018-03-30 18:52:36 -0700843#define min(x, y) __careful_cmp(x, y, <)
Randy Dunlape8c97af2017-10-13 15:58:11 -0700844
845/**
846 * max - return maximum of two values of the same or compatible types
847 * @x: first value
848 * @y: second value
849 */
Kees Cook3c8ba0d2018-03-30 18:52:36 -0700850#define max(x, y) __careful_cmp(x, y, >)
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700851
Randy Dunlape8c97af2017-10-13 15:58:11 -0700852/**
853 * min3 - return minimum of three values
854 * @x: first value
855 * @y: second value
856 * @z: third value
857 */
Michal Nazarewicz2e1d06e2014-10-09 15:30:13 -0700858#define min3(x, y, z) min((typeof(x))min(x, y), z)
Randy Dunlape8c97af2017-10-13 15:58:11 -0700859
860/**
861 * max3 - return maximum of three values
862 * @x: first value
863 * @y: second value
864 * @z: third value
865 */
Michal Nazarewicz2e1d06e2014-10-09 15:30:13 -0700866#define max3(x, y, z) max((typeof(x))max(x, y), z)
Hagen Paul Pfeiferf27c85c2010-10-26 14:22:21 -0700867
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700868/**
Martin K. Petersenc8bf1332010-09-10 20:07:38 +0200869 * min_not_zero - return the minimum that is _not_ zero, unless both are zero
870 * @x: value1
871 * @y: value2
872 */
873#define min_not_zero(x, y) ({ \
874 typeof(x) __x = (x); \
875 typeof(y) __y = (y); \
876 __x == 0 ? __y : ((__y == 0) ? __x : min(__x, __y)); })
877
878/**
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700879 * clamp - return a value clamped to a given range with strict typechecking
880 * @val: current value
Michal Nazarewicz2e1d06e2014-10-09 15:30:13 -0700881 * @lo: lowest allowable value
882 * @hi: highest allowable value
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700883 *
Randy Dunlape8c97af2017-10-13 15:58:11 -0700884 * This macro does strict typechecking of @lo/@hi to make sure they are of the
885 * same type as @val. See the unnecessary pointer comparisons.
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700886 */
Michal Nazarewicz2e1d06e2014-10-09 15:30:13 -0700887#define clamp(val, lo, hi) min((typeof(val))max(val, lo), hi)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700888
889/*
890 * ..and if you can't take the strict
891 * types, you can specify one yourself.
892 *
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700893 * Or not use min/max/clamp at all, of course.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700894 */
Randy Dunlape8c97af2017-10-13 15:58:11 -0700895
896/**
897 * min_t - return minimum of two values, using the specified type
898 * @type: data type to use
899 * @x: first value
900 * @y: second value
901 */
Kees Cook3c8ba0d2018-03-30 18:52:36 -0700902#define min_t(type, x, y) __careful_cmp((type)(x), (type)(y), <)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700903
Randy Dunlape8c97af2017-10-13 15:58:11 -0700904/**
905 * max_t - return maximum of two values, using the specified type
906 * @type: data type to use
907 * @x: first value
908 * @y: second value
909 */
Kees Cook3c8ba0d2018-03-30 18:52:36 -0700910#define max_t(type, x, y) __careful_cmp((type)(x), (type)(y), >)
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700911
912/**
913 * clamp_t - return a value clamped to a given range using a given type
914 * @type: the type of variable to use
915 * @val: current value
Michal Nazarewiczc185b072014-10-09 15:30:15 -0700916 * @lo: minimum allowable value
917 * @hi: maximum allowable value
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700918 *
919 * This macro does no typechecking and uses temporary variables of type
Randy Dunlape8c97af2017-10-13 15:58:11 -0700920 * @type to make all the comparisons.
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700921 */
Michal Nazarewiczc185b072014-10-09 15:30:15 -0700922#define clamp_t(type, val, lo, hi) min_t(type, max_t(type, val, lo), hi)
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700923
924/**
925 * clamp_val - return a value clamped to a given range using val's type
926 * @val: current value
Michal Nazarewiczc185b072014-10-09 15:30:15 -0700927 * @lo: minimum allowable value
928 * @hi: maximum allowable value
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700929 *
930 * This macro does no typechecking and uses temporary variables of whatever
Randy Dunlape8c97af2017-10-13 15:58:11 -0700931 * type the input argument @val is. This is useful when @val is an unsigned
932 * type and @lo and @hi are literals that will otherwise be assigned a signed
Harvey Harrisonbdf4bba2008-04-30 00:54:55 -0700933 * integer type.
934 */
Michal Nazarewiczc185b072014-10-09 15:30:15 -0700935#define clamp_val(val, lo, hi) clamp_t(typeof(val), val, lo, hi)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700936
Wu Fengguang91f68b72009-01-07 18:09:12 -0800937
Randy Dunlape8c97af2017-10-13 15:58:11 -0700938/**
939 * swap - swap values of @a and @b
940 * @a: first value
941 * @b: second value
Wu Fengguang91f68b72009-01-07 18:09:12 -0800942 */
Peter Zijlstraac7b9002009-02-04 15:11:59 -0800943#define swap(a, b) \
944 do { typeof(a) __tmp = (a); (a) = (b); (b) = __tmp; } while (0)
Wu Fengguang91f68b72009-01-07 18:09:12 -0800945
Alexei Starovoitovcf14f272018-03-28 12:05:36 -0700946/* This counts to 12. Any more, it will return 13th argument. */
947#define __COUNT_ARGS(_0, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _n, X...) _n
948#define COUNT_ARGS(X...) __COUNT_ARGS(, ##X, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0)
949
950#define __CONCAT(a, b) a ## b
951#define CONCATENATE(a, b) __CONCAT(a, b)
952
Linus Torvalds1da177e2005-04-16 15:20:36 -0700953/**
954 * container_of - cast a member of a structure out to the containing structure
Linus Torvalds1da177e2005-04-16 15:20:36 -0700955 * @ptr: the pointer to the member.
956 * @type: the type of the container struct this is embedded in.
957 * @member: the name of the member within the struct.
958 *
959 */
Ian Abbottc7acec712017-07-12 14:33:04 -0700960#define container_of(ptr, type, member) ({ \
961 void *__mptr = (void *)(ptr); \
962 BUILD_BUG_ON_MSG(!__same_type(*(ptr), ((type *)0)->member) && \
963 !__same_type(*(ptr), void), \
964 "pointer type mismatch in container_of()"); \
965 ((type *)(__mptr - offsetof(type, member))); })
Linus Torvalds1da177e2005-04-16 15:20:36 -0700966
Arnaud Lacombeb9d4f422011-07-25 17:13:03 -0700967/* Rebuild everything on CONFIG_FTRACE_MCOUNT_RECORD */
968#ifdef CONFIG_FTRACE_MCOUNT_RECORD
969# define REBUILD_DUE_TO_FTRACE_MCOUNT_RECORD
970#endif
WANG Cong9d00f922011-07-25 17:13:02 -0700971
Rusty Russell58f86cc2014-03-24 12:00:34 +1030972/* Permissions on a sysfs file: you didn't miss the 0 prefix did you? */
Gobinda Charan Maji28b8d0c2015-05-27 11:09:38 +0930973#define VERIFY_OCTAL_PERMISSIONS(perms) \
974 (BUILD_BUG_ON_ZERO((perms) < 0) + \
975 BUILD_BUG_ON_ZERO((perms) > 0777) + \
976 /* USER_READABLE >= GROUP_READABLE >= OTHER_READABLE */ \
977 BUILD_BUG_ON_ZERO((((perms) >> 6) & 4) < (((perms) >> 3) & 4)) + \
978 BUILD_BUG_ON_ZERO((((perms) >> 3) & 4) < ((perms) & 4)) + \
979 /* USER_WRITABLE >= GROUP_WRITABLE */ \
980 BUILD_BUG_ON_ZERO((((perms) >> 6) & 2) < (((perms) >> 3) & 2)) + \
981 /* OTHER_WRITABLE? Generally considered a bad idea. */ \
982 BUILD_BUG_ON_ZERO((perms) & 2) + \
Rusty Russell58f86cc2014-03-24 12:00:34 +1030983 (perms))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700984#endif