]>
Commit | Line | Data |
---|---|---|
b2441318 | 1 | /* SPDX-License-Identifier: GPL-2.0 */ |
1da177e4 LT |
2 | #ifndef _LINUX_KERNEL_H |
3 | #define _LINUX_KERNEL_H | |
4 | ||
1da177e4 LT |
5 | |
6 | #include <stdarg.h> | |
7 | #include <linux/linkage.h> | |
8 | #include <linux/stddef.h> | |
9 | #include <linux/types.h> | |
10 | #include <linux/compiler.h> | |
11 | #include <linux/bitops.h> | |
f0d1b0b3 | 12 | #include <linux/log2.h> |
e0deaff4 | 13 | #include <linux/typecheck.h> |
968ab183 | 14 | #include <linux/printk.h> |
c7acec71 | 15 | #include <linux/build_bug.h> |
1da177e4 | 16 | #include <asm/byteorder.h> |
607ca46e | 17 | #include <uapi/linux/kernel.h> |
1da177e4 | 18 | |
4be929be AD |
19 | #define USHRT_MAX ((u16)(~0U)) |
20 | #define SHRT_MAX ((s16)(USHRT_MAX>>1)) | |
21 | #define SHRT_MIN ((s16)(-SHRT_MAX - 1)) | |
1da177e4 LT |
22 | #define INT_MAX ((int)(~0U>>1)) |
23 | #define INT_MIN (-INT_MAX - 1) | |
24 | #define UINT_MAX (~0U) | |
25 | #define LONG_MAX ((long)(~0UL>>1)) | |
26 | #define LONG_MIN (-LONG_MAX - 1) | |
27 | #define ULONG_MAX (~0UL) | |
111ebb6e OH |
28 | #define LLONG_MAX ((long long)(~0ULL>>1)) |
29 | #define LLONG_MIN (-LLONG_MAX - 1) | |
30 | #define ULLONG_MAX (~0ULL) | |
a3860c1c | 31 | #define SIZE_MAX (~(size_t)0) |
1c4bc43d | 32 | #define PHYS_ADDR_MAX (~(phys_addr_t)0) |
1da177e4 | 33 | |
89a07141 AE |
34 | #define U8_MAX ((u8)~0U) |
35 | #define S8_MAX ((s8)(U8_MAX>>1)) | |
36 | #define S8_MIN ((s8)(-S8_MAX - 1)) | |
37 | #define U16_MAX ((u16)~0U) | |
38 | #define S16_MAX ((s16)(U16_MAX>>1)) | |
39 | #define S16_MIN ((s16)(-S16_MAX - 1)) | |
40 | #define U32_MAX ((u32)~0U) | |
41 | #define S32_MAX ((s32)(U32_MAX>>1)) | |
42 | #define S32_MIN ((s32)(-S32_MAX - 1)) | |
43 | #define U64_MAX ((u64)~0ULL) | |
44 | #define S64_MAX ((s64)(U64_MAX>>1)) | |
45 | #define S64_MIN ((s64)(-S64_MAX - 1)) | |
46 | ||
1da177e4 LT |
47 | #define STACK_MAGIC 0xdeadbeef |
48 | ||
e8c97af0 RD |
49 | /** |
50 | * REPEAT_BYTE - repeat the value @x multiple times as an unsigned long value | |
51 | * @x: value to repeat | |
52 | * | |
53 | * NOTE: @x is not checked for > 0xff; larger values produce odd results. | |
54 | */ | |
44696908 DM |
55 | #define REPEAT_BYTE(x) ((~0ul / 0xff) * (x)) |
56 | ||
3ca45a46 | 57 | /* @a is a power of 2 value */ |
a79ff731 | 58 | #define ALIGN(x, a) __ALIGN_KERNEL((x), (a)) |
ed067d4a | 59 | #define ALIGN_DOWN(x, a) __ALIGN_KERNEL((x) - ((a) - 1), (a)) |
9f93ff5b | 60 | #define __ALIGN_MASK(x, mask) __ALIGN_KERNEL_MASK((x), (mask)) |
a83308e6 | 61 | #define PTR_ALIGN(p, a) ((typeof(p))ALIGN((unsigned long)(p), (a))) |
f10db627 | 62 | #define IS_ALIGNED(x, a) (((x) & ((typeof(x))(a) - 1)) == 0) |
2ea58144 | 63 | |
d3849953 CH |
64 | /* generic data direction definitions */ |
65 | #define READ 0 | |
66 | #define WRITE 1 | |
67 | ||
e8c97af0 RD |
68 | /** |
69 | * ARRAY_SIZE - get the number of elements in array @arr | |
70 | * @arr: array to be sized | |
71 | */ | |
c5e631cf RR |
72 | #define ARRAY_SIZE(arr) (sizeof(arr) / sizeof((arr)[0]) + __must_be_array(arr)) |
73 | ||
3ed605bc GP |
74 | #define u64_to_user_ptr(x) ( \ |
75 | { \ | |
76 | typecheck(u64, x); \ | |
77 | (void __user *)(uintptr_t)x; \ | |
78 | } \ | |
79 | ) | |
80 | ||
9b3be9f9 YL |
81 | /* |
82 | * This looks more complex than it should be. But we need to | |
83 | * get the type for the ~ right in round_down (it needs to be | |
84 | * as wide as the result!), and we want to evaluate the macro | |
85 | * arguments just once each. | |
86 | */ | |
87 | #define __round_mask(x, y) ((__typeof__(x))((y)-1)) | |
cedc5b6a KC |
88 | /** |
89 | * round_up - round up to next specified power of 2 | |
90 | * @x: the value to round | |
91 | * @y: multiple to round up to (must be a power of 2) | |
92 | * | |
93 | * Rounds @x up to next multiple of @y (which must be a power of 2). | |
94 | * To perform arbitrary rounding up, use roundup() below. | |
95 | */ | |
9b3be9f9 | 96 | #define round_up(x, y) ((((x)-1) | __round_mask(x, y))+1) |
cedc5b6a KC |
97 | /** |
98 | * round_down - round down to next specified power of 2 | |
99 | * @x: the value to round | |
100 | * @y: multiple to round down to (must be a power of 2) | |
101 | * | |
102 | * Rounds @x down to next multiple of @y (which must be a power of 2). | |
103 | * To perform arbitrary rounding down, use rounddown() below. | |
104 | */ | |
9b3be9f9 YL |
105 | #define round_down(x, y) ((x) & ~__round_mask(x, y)) |
106 | ||
e8c97af0 RD |
107 | /** |
108 | * FIELD_SIZEOF - get the size of a struct's field | |
109 | * @t: the target struct | |
110 | * @f: the target struct's field | |
111 | * Return: the size of @f in the struct definition without having a | |
112 | * declared instance of @t. | |
113 | */ | |
4552d5dc | 114 | #define FIELD_SIZEOF(t, f) (sizeof(((t*)0)->f)) |
e8c97af0 | 115 | |
b5d3755a | 116 | #define DIV_ROUND_UP __KERNEL_DIV_ROUND_UP |
604df322 MY |
117 | |
118 | #define DIV_ROUND_DOWN_ULL(ll, d) \ | |
119 | ({ unsigned long long _tmp = (ll); do_div(_tmp, d); _tmp; }) | |
120 | ||
121 | #define DIV_ROUND_UP_ULL(ll, d) DIV_ROUND_DOWN_ULL((ll) + (d) - 1, (d)) | |
36a26c69 NB |
122 | |
123 | #if BITS_PER_LONG == 32 | |
124 | # define DIV_ROUND_UP_SECTOR_T(ll,d) DIV_ROUND_UP_ULL(ll, d) | |
125 | #else | |
126 | # define DIV_ROUND_UP_SECTOR_T(ll,d) DIV_ROUND_UP(ll,d) | |
127 | #endif | |
074e61ec | 128 | |
cedc5b6a KC |
129 | /** |
130 | * roundup - round up to the next specified multiple | |
131 | * @x: the value to up | |
132 | * @y: multiple to round up to | |
133 | * | |
134 | * Rounds @x up to next multiple of @y. If @y will always be a power | |
135 | * of 2, consider using the faster round_up(). | |
136 | * | |
137 | * The `const' here prevents gcc-3.3 from calling __divdi3 | |
138 | */ | |
b28efd54 EP |
139 | #define roundup(x, y) ( \ |
140 | { \ | |
6070bf35 | 141 | const typeof(y) __y = y; \ |
b28efd54 EP |
142 | (((x) + (__y - 1)) / __y) * __y; \ |
143 | } \ | |
144 | ) | |
cedc5b6a KC |
145 | /** |
146 | * rounddown - round down to next specified multiple | |
147 | * @x: the value to round | |
148 | * @y: multiple to round down to | |
149 | * | |
150 | * Rounds @x down to next multiple of @y. If @y will always be a power | |
151 | * of 2, consider using the faster round_down(). | |
152 | */ | |
686a0f3d EP |
153 | #define rounddown(x, y) ( \ |
154 | { \ | |
155 | typeof(x) __x = (x); \ | |
156 | __x - (__x % (y)); \ | |
157 | } \ | |
158 | ) | |
b6d86d3d GR |
159 | |
160 | /* | |
4f5901f5 NS |
161 | * Divide positive or negative dividend by positive or negative divisor |
162 | * and round to closest integer. Result is undefined for negative | |
e8c97af0 | 163 | * divisors if the dividend variable type is unsigned and for negative |
4f5901f5 | 164 | * dividends if the divisor variable type is unsigned. |
b6d86d3d | 165 | */ |
9fe06081 DW |
166 | #define DIV_ROUND_CLOSEST(x, divisor)( \ |
167 | { \ | |
b6d86d3d GR |
168 | typeof(x) __x = x; \ |
169 | typeof(divisor) __d = divisor; \ | |
c4e18497 | 170 | (((typeof(x))-1) > 0 || \ |
4f5901f5 NS |
171 | ((typeof(divisor))-1) > 0 || \ |
172 | (((__x) > 0) == ((__d) > 0))) ? \ | |
b6d86d3d GR |
173 | (((__x) + ((__d) / 2)) / (__d)) : \ |
174 | (((__x) - ((__d) / 2)) / (__d)); \ | |
9fe06081 DW |
175 | } \ |
176 | ) | |
f766093e JM |
177 | /* |
178 | * Same as above but for u64 dividends. divisor must be a 32-bit | |
179 | * number. | |
180 | */ | |
181 | #define DIV_ROUND_CLOSEST_ULL(x, divisor)( \ | |
182 | { \ | |
183 | typeof(divisor) __d = divisor; \ | |
184 | unsigned long long _tmp = (x) + (__d) / 2; \ | |
185 | do_div(_tmp, __d); \ | |
186 | _tmp; \ | |
187 | } \ | |
188 | ) | |
1da177e4 | 189 | |
9993bc63 SQ |
190 | /* |
191 | * Multiplies an integer by a fraction, while avoiding unnecessary | |
192 | * overflow or loss of precision. | |
193 | */ | |
194 | #define mult_frac(x, numer, denom)( \ | |
195 | { \ | |
196 | typeof(x) quot = (x) / (denom); \ | |
197 | typeof(x) rem = (x) % (denom); \ | |
198 | (quot * (numer)) + ((rem * (numer)) / (denom)); \ | |
199 | } \ | |
200 | ) | |
201 | ||
202 | ||
ca31e146 EGM |
203 | #define _RET_IP_ (unsigned long)__builtin_return_address(0) |
204 | #define _THIS_IP_ ({ __label__ __here; __here: (unsigned long)&&__here; }) | |
205 | ||
90c699a9 | 206 | #ifdef CONFIG_LBDAF |
2da96acd JA |
207 | # include <asm/div64.h> |
208 | # define sector_div(a, b) do_div(a, b) | |
209 | #else | |
210 | # define sector_div(n, b)( \ | |
211 | { \ | |
212 | int _res; \ | |
213 | _res = (n) % (b); \ | |
214 | (n) /= (b); \ | |
215 | _res; \ | |
216 | } \ | |
217 | ) | |
218 | #endif | |
219 | ||
218e180e AM |
220 | /** |
221 | * upper_32_bits - return bits 32-63 of a number | |
222 | * @n: the number we're accessing | |
223 | * | |
224 | * A basic shift-right of a 64- or 32-bit quantity. Use this to suppress | |
225 | * the "right shift count >= width of type" warning when that quantity is | |
226 | * 32-bits. | |
227 | */ | |
228 | #define upper_32_bits(n) ((u32)(((n) >> 16) >> 16)) | |
229 | ||
204b885e JR |
230 | /** |
231 | * lower_32_bits - return bits 0-31 of a number | |
232 | * @n: the number we're accessing | |
233 | */ | |
234 | #define lower_32_bits(n) ((u32)(n)) | |
235 | ||
1da177e4 | 236 | struct completion; |
df2e71fb | 237 | struct pt_regs; |
238 | struct user; | |
1da177e4 | 239 | |
070cb065 UKK |
240 | #ifdef CONFIG_PREEMPT_VOLUNTARY |
241 | extern int _cond_resched(void); | |
242 | # define might_resched() _cond_resched() | |
243 | #else | |
244 | # define might_resched() do { } while (0) | |
245 | #endif | |
246 | ||
d902db1e | 247 | #ifdef CONFIG_DEBUG_ATOMIC_SLEEP |
3427445a | 248 | void ___might_sleep(const char *file, int line, int preempt_offset); |
d894837f | 249 | void __might_sleep(const char *file, int line, int preempt_offset); |
1da177e4 LT |
250 | /** |
251 | * might_sleep - annotation for functions that can sleep | |
252 | * | |
253 | * this macro will print a stack trace if it is executed in an atomic | |
254 | * context (spinlock, irq-handler, ...). | |
255 | * | |
256 | * This is a useful debugging help to be able to catch problems early and not | |
e20ec991 | 257 | * be bitten later when the calling function happens to sleep when it is not |
1da177e4 LT |
258 | * supposed to. |
259 | */ | |
f8cbd99b | 260 | # define might_sleep() \ |
e4aafea2 | 261 | do { __might_sleep(__FILE__, __LINE__, 0); might_resched(); } while (0) |
00845eb9 | 262 | # define sched_annotate_sleep() (current->task_state_change = 0) |
1da177e4 | 263 | #else |
3427445a PZ |
264 | static inline void ___might_sleep(const char *file, int line, |
265 | int preempt_offset) { } | |
d894837f SK |
266 | static inline void __might_sleep(const char *file, int line, |
267 | int preempt_offset) { } | |
f8cbd99b | 268 | # define might_sleep() do { might_resched(); } while (0) |
1029a2b5 | 269 | # define sched_annotate_sleep() do { } while (0) |
1da177e4 LT |
270 | #endif |
271 | ||
368a5fa1 | 272 | #define might_sleep_if(cond) do { if (cond) might_sleep(); } while (0) |
f8cbd99b | 273 | |
c8299cb6 MN |
274 | /** |
275 | * abs - return absolute value of an argument | |
8f57e4d9 MN |
276 | * @x: the value. If it is unsigned type, it is converted to signed type first. |
277 | * char is treated as if it was signed (regardless of whether it really is) | |
278 | * but the macro's return type is preserved as char. | |
c8299cb6 | 279 | * |
8f57e4d9 | 280 | * Return: an absolute value of x. |
71a90484 | 281 | */ |
8f57e4d9 MN |
282 | #define abs(x) __abs_choose_expr(x, long long, \ |
283 | __abs_choose_expr(x, long, \ | |
284 | __abs_choose_expr(x, int, \ | |
285 | __abs_choose_expr(x, short, \ | |
286 | __abs_choose_expr(x, char, \ | |
287 | __builtin_choose_expr( \ | |
288 | __builtin_types_compatible_p(typeof(x), char), \ | |
289 | (char)({ signed char __x = (x); __x<0?-__x:__x; }), \ | |
290 | ((void)0))))))) | |
291 | ||
292 | #define __abs_choose_expr(x, type, other) __builtin_choose_expr( \ | |
293 | __builtin_types_compatible_p(typeof(x), signed type) || \ | |
294 | __builtin_types_compatible_p(typeof(x), unsigned type), \ | |
295 | ({ signed type __x = (x); __x < 0 ? -__x : __x; }), other) | |
c8299cb6 | 296 | |
89770b0a DB |
297 | /** |
298 | * reciprocal_scale - "scale" a value into range [0, ep_ro) | |
299 | * @val: value | |
300 | * @ep_ro: right open interval endpoint | |
301 | * | |
302 | * Perform a "reciprocal multiplication" in order to "scale" a value into | |
e8c97af0 | 303 | * range [0, @ep_ro), where the upper interval endpoint is right-open. |
89770b0a | 304 | * This is useful, e.g. for accessing a index of an array containing |
e8c97af0 | 305 | * @ep_ro elements, for example. Think of it as sort of modulus, only that |
89770b0a DB |
306 | * the result isn't that of modulo. ;) Note that if initial input is a |
307 | * small value, then result will return 0. | |
308 | * | |
e8c97af0 | 309 | * Return: a result based on @val in interval [0, @ep_ro). |
89770b0a DB |
310 | */ |
311 | static inline u32 reciprocal_scale(u32 val, u32 ep_ro) | |
312 | { | |
313 | return (u32)(((u64) val * ep_ro) >> 32); | |
314 | } | |
315 | ||
386e7906 AL |
316 | #if defined(CONFIG_MMU) && \ |
317 | (defined(CONFIG_PROVE_LOCKING) || defined(CONFIG_DEBUG_ATOMIC_SLEEP)) | |
9ec23531 DH |
318 | #define might_fault() __might_fault(__FILE__, __LINE__) |
319 | void __might_fault(const char *file, int line); | |
3ee1afa3 | 320 | #else |
662bbcb2 | 321 | static inline void might_fault(void) { } |
3ee1afa3 NP |
322 | #endif |
323 | ||
e041c683 | 324 | extern struct atomic_notifier_head panic_notifier_list; |
c7ff0d9c | 325 | extern long (*panic_blink)(int state); |
9402c95f | 326 | __printf(1, 2) |
9af6528e | 327 | void panic(const char *fmt, ...) __noreturn __cold; |
ebc41f20 | 328 | void nmi_panic(struct pt_regs *regs, const char *msg); |
dd287796 AM |
329 | extern void oops_enter(void); |
330 | extern void oops_exit(void); | |
863a6049 | 331 | void print_oops_end_marker(void); |
dd287796 | 332 | extern int oops_may_print(void); |
9af6528e PZ |
333 | void do_exit(long error_code) __noreturn; |
334 | void complete_and_exit(struct completion *, long) __noreturn; | |
33ee3b2e | 335 | |
7a46ec0e KC |
336 | #ifdef CONFIG_ARCH_HAS_REFCOUNT |
337 | void refcount_error_report(struct pt_regs *regs, const char *err); | |
338 | #else | |
339 | static inline void refcount_error_report(struct pt_regs *regs, const char *err) | |
340 | { } | |
341 | #endif | |
342 | ||
33ee3b2e AD |
343 | /* Internal, do not use. */ |
344 | int __must_check _kstrtoul(const char *s, unsigned int base, unsigned long *res); | |
345 | int __must_check _kstrtol(const char *s, unsigned int base, long *res); | |
346 | ||
347 | int __must_check kstrtoull(const char *s, unsigned int base, unsigned long long *res); | |
348 | int __must_check kstrtoll(const char *s, unsigned int base, long long *res); | |
4c925d60 EZ |
349 | |
350 | /** | |
351 | * kstrtoul - convert a string to an unsigned long | |
352 | * @s: The start of the string. The string must be null-terminated, and may also | |
353 | * include a single newline before its terminating null. The first character | |
354 | * may also be a plus sign, but not a minus sign. | |
355 | * @base: The number base to use. The maximum supported base is 16. If base is | |
356 | * given as 0, then the base of the string is automatically detected with the | |
357 | * conventional semantics - If it begins with 0x the number will be parsed as a | |
358 | * hexadecimal (case insensitive), if it otherwise begins with 0, it will be | |
359 | * parsed as an octal number. Otherwise it will be parsed as a decimal. | |
360 | * @res: Where to write the result of the conversion on success. | |
361 | * | |
362 | * Returns 0 on success, -ERANGE on overflow and -EINVAL on parsing error. | |
363 | * Used as a replacement for the obsolete simple_strtoull. Return code must | |
364 | * be checked. | |
365 | */ | |
33ee3b2e AD |
366 | static inline int __must_check kstrtoul(const char *s, unsigned int base, unsigned long *res) |
367 | { | |
368 | /* | |
369 | * We want to shortcut function call, but | |
370 | * __builtin_types_compatible_p(unsigned long, unsigned long long) = 0. | |
371 | */ | |
372 | if (sizeof(unsigned long) == sizeof(unsigned long long) && | |
373 | __alignof__(unsigned long) == __alignof__(unsigned long long)) | |
374 | return kstrtoull(s, base, (unsigned long long *)res); | |
375 | else | |
376 | return _kstrtoul(s, base, res); | |
377 | } | |
378 | ||
4c925d60 EZ |
379 | /** |
380 | * kstrtol - convert a string to a long | |
381 | * @s: The start of the string. The string must be null-terminated, and may also | |
382 | * include a single newline before its terminating null. The first character | |
383 | * may also be a plus sign or a minus sign. | |
384 | * @base: The number base to use. The maximum supported base is 16. If base is | |
385 | * given as 0, then the base of the string is automatically detected with the | |
386 | * conventional semantics - If it begins with 0x the number will be parsed as a | |
387 | * hexadecimal (case insensitive), if it otherwise begins with 0, it will be | |
388 | * parsed as an octal number. Otherwise it will be parsed as a decimal. | |
389 | * @res: Where to write the result of the conversion on success. | |
390 | * | |
391 | * Returns 0 on success, -ERANGE on overflow and -EINVAL on parsing error. | |
392 | * Used as a replacement for the obsolete simple_strtoull. Return code must | |
393 | * be checked. | |
394 | */ | |
33ee3b2e AD |
395 | static inline int __must_check kstrtol(const char *s, unsigned int base, long *res) |
396 | { | |
397 | /* | |
398 | * We want to shortcut function call, but | |
399 | * __builtin_types_compatible_p(long, long long) = 0. | |
400 | */ | |
401 | if (sizeof(long) == sizeof(long long) && | |
402 | __alignof__(long) == __alignof__(long long)) | |
403 | return kstrtoll(s, base, (long long *)res); | |
404 | else | |
405 | return _kstrtol(s, base, res); | |
406 | } | |
407 | ||
408 | int __must_check kstrtouint(const char *s, unsigned int base, unsigned int *res); | |
409 | int __must_check kstrtoint(const char *s, unsigned int base, int *res); | |
410 | ||
411 | static inline int __must_check kstrtou64(const char *s, unsigned int base, u64 *res) | |
412 | { | |
413 | return kstrtoull(s, base, res); | |
414 | } | |
415 | ||
416 | static inline int __must_check kstrtos64(const char *s, unsigned int base, s64 *res) | |
417 | { | |
418 | return kstrtoll(s, base, res); | |
419 | } | |
420 | ||
421 | static inline int __must_check kstrtou32(const char *s, unsigned int base, u32 *res) | |
422 | { | |
423 | return kstrtouint(s, base, res); | |
424 | } | |
425 | ||
426 | static inline int __must_check kstrtos32(const char *s, unsigned int base, s32 *res) | |
427 | { | |
428 | return kstrtoint(s, base, res); | |
429 | } | |
430 | ||
431 | int __must_check kstrtou16(const char *s, unsigned int base, u16 *res); | |
432 | int __must_check kstrtos16(const char *s, unsigned int base, s16 *res); | |
433 | int __must_check kstrtou8(const char *s, unsigned int base, u8 *res); | |
434 | int __must_check kstrtos8(const char *s, unsigned int base, s8 *res); | |
ef951599 | 435 | int __must_check kstrtobool(const char *s, bool *res); |
33ee3b2e | 436 | |
c196e32a AD |
437 | int __must_check kstrtoull_from_user(const char __user *s, size_t count, unsigned int base, unsigned long long *res); |
438 | int __must_check kstrtoll_from_user(const char __user *s, size_t count, unsigned int base, long long *res); | |
439 | int __must_check kstrtoul_from_user(const char __user *s, size_t count, unsigned int base, unsigned long *res); | |
440 | int __must_check kstrtol_from_user(const char __user *s, size_t count, unsigned int base, long *res); | |
441 | int __must_check kstrtouint_from_user(const char __user *s, size_t count, unsigned int base, unsigned int *res); | |
442 | int __must_check kstrtoint_from_user(const char __user *s, size_t count, unsigned int base, int *res); | |
443 | int __must_check kstrtou16_from_user(const char __user *s, size_t count, unsigned int base, u16 *res); | |
444 | int __must_check kstrtos16_from_user(const char __user *s, size_t count, unsigned int base, s16 *res); | |
445 | int __must_check kstrtou8_from_user(const char __user *s, size_t count, unsigned int base, u8 *res); | |
446 | int __must_check kstrtos8_from_user(const char __user *s, size_t count, unsigned int base, s8 *res); | |
ef951599 | 447 | int __must_check kstrtobool_from_user(const char __user *s, size_t count, bool *res); |
c196e32a AD |
448 | |
449 | static inline int __must_check kstrtou64_from_user(const char __user *s, size_t count, unsigned int base, u64 *res) | |
450 | { | |
451 | return kstrtoull_from_user(s, count, base, res); | |
452 | } | |
453 | ||
454 | static inline int __must_check kstrtos64_from_user(const char __user *s, size_t count, unsigned int base, s64 *res) | |
455 | { | |
456 | return kstrtoll_from_user(s, count, base, res); | |
457 | } | |
458 | ||
459 | static inline int __must_check kstrtou32_from_user(const char __user *s, size_t count, unsigned int base, u32 *res) | |
460 | { | |
461 | return kstrtouint_from_user(s, count, base, res); | |
462 | } | |
463 | ||
464 | static inline int __must_check kstrtos32_from_user(const char __user *s, size_t count, unsigned int base, s32 *res) | |
465 | { | |
466 | return kstrtoint_from_user(s, count, base, res); | |
467 | } | |
468 | ||
67d0a075 JP |
469 | /* Obsolete, do not use. Use kstrto<foo> instead */ |
470 | ||
1da177e4 LT |
471 | extern unsigned long simple_strtoul(const char *,char **,unsigned int); |
472 | extern long simple_strtol(const char *,char **,unsigned int); | |
473 | extern unsigned long long simple_strtoull(const char *,char **,unsigned int); | |
474 | extern long long simple_strtoll(const char *,char **,unsigned int); | |
33ee3b2e | 475 | |
d1be35cb AV |
476 | extern int num_to_str(char *buf, int size, |
477 | unsigned long long num, unsigned int width); | |
1ac101a5 | 478 | |
67d0a075 JP |
479 | /* lib/printf utilities */ |
480 | ||
b9075fa9 JP |
481 | extern __printf(2, 3) int sprintf(char *buf, const char * fmt, ...); |
482 | extern __printf(2, 0) int vsprintf(char *buf, const char *, va_list); | |
483 | extern __printf(3, 4) | |
484 | int snprintf(char *buf, size_t size, const char *fmt, ...); | |
485 | extern __printf(3, 0) | |
486 | int vsnprintf(char *buf, size_t size, const char *fmt, va_list args); | |
487 | extern __printf(3, 4) | |
488 | int scnprintf(char *buf, size_t size, const char *fmt, ...); | |
489 | extern __printf(3, 0) | |
490 | int vscnprintf(char *buf, size_t size, const char *fmt, va_list args); | |
48a27055 | 491 | extern __printf(2, 3) __malloc |
b9075fa9 | 492 | char *kasprintf(gfp_t gfp, const char *fmt, ...); |
48a27055 | 493 | extern __printf(2, 0) __malloc |
8db14860 | 494 | char *kvasprintf(gfp_t gfp, const char *fmt, va_list args); |
0a9df786 RV |
495 | extern __printf(2, 0) |
496 | const char *kvasprintf_const(gfp_t gfp, const char *fmt, va_list args); | |
1da177e4 | 497 | |
6061d949 JP |
498 | extern __scanf(2, 3) |
499 | int sscanf(const char *, const char *, ...); | |
500 | extern __scanf(2, 0) | |
501 | int vsscanf(const char *, const char *, va_list); | |
1da177e4 LT |
502 | |
503 | extern int get_option(char **str, int *pint); | |
504 | extern char *get_options(const char *str, int nints, int *ints); | |
d974ae37 | 505 | extern unsigned long long memparse(const char *ptr, char **retptr); |
6ccc72b8 | 506 | extern bool parse_option_str(const char *str, const char *option); |
f51b17c8 | 507 | extern char *next_arg(char *args, char **param, char **val); |
1da177e4 | 508 | |
5e376613 | 509 | extern int core_kernel_text(unsigned long addr); |
9fbcc57a | 510 | extern int init_kernel_text(unsigned long addr); |
cdbe61bf | 511 | extern int core_kernel_data(unsigned long addr); |
1da177e4 LT |
512 | extern int __kernel_text_address(unsigned long addr); |
513 | extern int kernel_text_address(unsigned long addr); | |
ab7476cf | 514 | extern int func_ptr_is_kernel_text(void *ptr); |
ab7476cf | 515 | |
1da177e4 LT |
516 | unsigned long int_sqrt(unsigned long); |
517 | ||
47a36163 CM |
518 | #if BITS_PER_LONG < 64 |
519 | u32 int_sqrt64(u64 x); | |
520 | #else | |
521 | static inline u32 int_sqrt64(u64 x) | |
522 | { | |
523 | return (u32)int_sqrt(x); | |
524 | } | |
525 | #endif | |
526 | ||
1da177e4 LT |
527 | extern void bust_spinlocks(int yes); |
528 | extern int oops_in_progress; /* If set, an oops, panic(), BUG() or die() is in progress */ | |
aa727107 | 529 | extern int panic_timeout; |
1da177e4 | 530 | extern int panic_on_oops; |
8da5adda | 531 | extern int panic_on_unrecovered_nmi; |
5211a242 | 532 | extern int panic_on_io_nmi; |
9e3961a0 | 533 | extern int panic_on_warn; |
088e9d25 | 534 | extern int sysctl_panic_on_rcu_stall; |
55af7796 | 535 | extern int sysctl_panic_on_stackoverflow; |
5375b708 HD |
536 | |
537 | extern bool crash_kexec_post_notifiers; | |
538 | ||
1717f209 HK |
539 | /* |
540 | * panic_cpu is used for synchronizing panic() and crash_kexec() execution. It | |
541 | * holds a CPU number which is executing panic() currently. A value of | |
542 | * PANIC_CPU_INVALID means no CPU has entered panic() or crash_kexec(). | |
543 | */ | |
544 | extern atomic_t panic_cpu; | |
545 | #define PANIC_CPU_INVALID -1 | |
546 | ||
5800dc3c JB |
547 | /* |
548 | * Only to be used by arch init code. If the user over-wrote the default | |
549 | * CONFIG_PANIC_TIMEOUT, honor it. | |
550 | */ | |
551 | static inline void set_arch_panic_timeout(int timeout, int arch_default_timeout) | |
552 | { | |
553 | if (panic_timeout == arch_default_timeout) | |
554 | panic_timeout = timeout; | |
555 | } | |
1da177e4 | 556 | extern const char *print_tainted(void); |
373d4d09 RR |
557 | enum lockdep_ok { |
558 | LOCKDEP_STILL_OK, | |
559 | LOCKDEP_NOW_UNRELIABLE | |
560 | }; | |
561 | extern void add_taint(unsigned flag, enum lockdep_ok); | |
25ddbb18 AK |
562 | extern int test_taint(unsigned flag); |
563 | extern unsigned long get_taint(void); | |
b920de1b | 564 | extern int root_mountflags; |
1da177e4 | 565 | |
2ce802f6 TH |
566 | extern bool early_boot_irqs_disabled; |
567 | ||
69a78ff2 TG |
568 | /* |
569 | * Values used for system_state. Ordering of the states must not be changed | |
570 | * as code checks for <, <=, >, >= STATE. | |
571 | */ | |
1da177e4 LT |
572 | extern enum system_states { |
573 | SYSTEM_BOOTING, | |
69a78ff2 | 574 | SYSTEM_SCHEDULING, |
1da177e4 LT |
575 | SYSTEM_RUNNING, |
576 | SYSTEM_HALT, | |
577 | SYSTEM_POWER_OFF, | |
578 | SYSTEM_RESTART, | |
c1a957d1 | 579 | SYSTEM_SUSPEND, |
1da177e4 LT |
580 | } system_state; |
581 | ||
47d4b263 | 582 | /* This cannot be an enum because some may be used in assembly source. */ |
25ddbb18 AK |
583 | #define TAINT_PROPRIETARY_MODULE 0 |
584 | #define TAINT_FORCED_MODULE 1 | |
8c90487c | 585 | #define TAINT_CPU_OUT_OF_SPEC 2 |
25ddbb18 AK |
586 | #define TAINT_FORCED_RMMOD 3 |
587 | #define TAINT_MACHINE_CHECK 4 | |
588 | #define TAINT_BAD_PAGE 5 | |
589 | #define TAINT_USER 6 | |
590 | #define TAINT_DIE 7 | |
591 | #define TAINT_OVERRIDDEN_ACPI_TABLE 8 | |
592 | #define TAINT_WARN 9 | |
26e9a397 | 593 | #define TAINT_CRAP 10 |
92946bc7 | 594 | #define TAINT_FIRMWARE_WORKAROUND 11 |
2449b8ba | 595 | #define TAINT_OOT_MODULE 12 |
66cc69e3 | 596 | #define TAINT_UNSIGNED_MODULE 13 |
69361eef | 597 | #define TAINT_SOFTLOCKUP 14 |
c5f45465 | 598 | #define TAINT_LIVEPATCH 15 |
4efb442c | 599 | #define TAINT_AUX 16 |
bc4f2f54 KC |
600 | #define TAINT_RANDSTRUCT 17 |
601 | #define TAINT_FLAGS_COUNT 18 | |
7fd8329b PM |
602 | |
603 | struct taint_flag { | |
5eb7c0d0 LF |
604 | char c_true; /* character printed when tainted */ |
605 | char c_false; /* character printed when not tainted */ | |
7fd8329b PM |
606 | bool module; /* also show as a per-module taint flag */ |
607 | }; | |
608 | ||
609 | extern const struct taint_flag taint_flags[TAINT_FLAGS_COUNT]; | |
1da177e4 | 610 | |
3fc95772 HH |
611 | extern const char hex_asc[]; |
612 | #define hex_asc_lo(x) hex_asc[((x) & 0x0f)] | |
613 | #define hex_asc_hi(x) hex_asc[((x) & 0xf0) >> 4] | |
614 | ||
55036ba7 | 615 | static inline char *hex_byte_pack(char *buf, u8 byte) |
3fc95772 HH |
616 | { |
617 | *buf++ = hex_asc_hi(byte); | |
618 | *buf++ = hex_asc_lo(byte); | |
619 | return buf; | |
620 | } | |
99eaf3c4 | 621 | |
c26d436c AN |
622 | extern const char hex_asc_upper[]; |
623 | #define hex_asc_upper_lo(x) hex_asc_upper[((x) & 0x0f)] | |
624 | #define hex_asc_upper_hi(x) hex_asc_upper[((x) & 0xf0) >> 4] | |
625 | ||
626 | static inline char *hex_byte_pack_upper(char *buf, u8 byte) | |
627 | { | |
628 | *buf++ = hex_asc_upper_hi(byte); | |
629 | *buf++ = hex_asc_upper_lo(byte); | |
630 | return buf; | |
631 | } | |
632 | ||
90378889 | 633 | extern int hex_to_bin(char ch); |
b7804983 | 634 | extern int __must_check hex2bin(u8 *dst, const char *src, size_t count); |
53d91c5c | 635 | extern char *bin2hex(char *dst, const void *src, size_t count); |
90378889 | 636 | |
a69f5edb | 637 | bool mac_pton(const char *s, u8 *mac); |
4cd5773a | 638 | |
526211bc IM |
639 | /* |
640 | * General tracing related utility functions - trace_printk(), | |
2002c258 SR |
641 | * tracing_on/tracing_off and tracing_start()/tracing_stop |
642 | * | |
643 | * Use tracing_on/tracing_off when you want to quickly turn on or off | |
644 | * tracing. It simply enables or disables the recording of the trace events. | |
156f5a78 | 645 | * This also corresponds to the user space /sys/kernel/debug/tracing/tracing_on |
2002c258 SR |
646 | * file, which gives a means for the kernel and userspace to interact. |
647 | * Place a tracing_off() in the kernel where you want tracing to end. | |
648 | * From user space, examine the trace, and then echo 1 > tracing_on | |
649 | * to continue tracing. | |
650 | * | |
651 | * tracing_stop/tracing_start has slightly more overhead. It is used | |
652 | * by things like suspend to ram where disabling the recording of the | |
653 | * trace is not enough, but tracing must actually stop because things | |
654 | * like calling smp_processor_id() may crash the system. | |
655 | * | |
656 | * Most likely, you want to use tracing_on/tracing_off. | |
526211bc | 657 | */ |
cecbca96 FW |
658 | |
659 | enum ftrace_dump_mode { | |
660 | DUMP_NONE, | |
661 | DUMP_ALL, | |
662 | DUMP_ORIG, | |
663 | }; | |
664 | ||
526211bc | 665 | #ifdef CONFIG_TRACING |
93d68e52 SR |
666 | void tracing_on(void); |
667 | void tracing_off(void); | |
668 | int tracing_is_on(void); | |
ad909e21 SRRH |
669 | void tracing_snapshot(void); |
670 | void tracing_snapshot_alloc(void); | |
93d68e52 | 671 | |
526211bc IM |
672 | extern void tracing_start(void); |
673 | extern void tracing_stop(void); | |
526211bc | 674 | |
b9075fa9 JP |
675 | static inline __printf(1, 2) |
676 | void ____trace_printk_check_format(const char *fmt, ...) | |
769b0441 FW |
677 | { |
678 | } | |
679 | #define __trace_printk_check_format(fmt, args...) \ | |
680 | do { \ | |
681 | if (0) \ | |
682 | ____trace_printk_check_format(fmt, ##args); \ | |
683 | } while (0) | |
684 | ||
526211bc IM |
685 | /** |
686 | * trace_printk - printf formatting in the ftrace buffer | |
687 | * @fmt: the printf format for printing | |
688 | * | |
e8c97af0 RD |
689 | * Note: __trace_printk is an internal function for trace_printk() and |
690 | * the @ip is passed in via the trace_printk() macro. | |
526211bc IM |
691 | * |
692 | * This function allows a kernel developer to debug fast path sections | |
693 | * that printk is not appropriate for. By scattering in various | |
694 | * printk like tracing in the code, a developer can quickly see | |
695 | * where problems are occurring. | |
696 | * | |
697 | * This is intended as a debugging tool for the developer only. | |
698 | * Please refrain from leaving trace_printks scattered around in | |
09ae7234 | 699 | * your code. (Extra memory is used for special buffers that are |
e8c97af0 | 700 | * allocated when trace_printk() is used.) |
9d3c752c | 701 | * |
8730662d | 702 | * A little optimization trick is done here. If there's only one |
9d3c752c SRRH |
703 | * argument, there's no need to scan the string for printf formats. |
704 | * The trace_puts() will suffice. But how can we take advantage of | |
705 | * using trace_puts() when trace_printk() has only one argument? | |
706 | * By stringifying the args and checking the size we can tell | |
707 | * whether or not there are args. __stringify((__VA_ARGS__)) will | |
708 | * turn into "()\0" with a size of 3 when there are no args, anything | |
709 | * else will be bigger. All we need to do is define a string to this, | |
710 | * and then take its size and compare to 3. If it's bigger, use | |
711 | * do_trace_printk() otherwise, optimize it to trace_puts(). Then just | |
712 | * let gcc optimize the rest. | |
526211bc | 713 | */ |
769b0441 | 714 | |
9d3c752c SRRH |
715 | #define trace_printk(fmt, ...) \ |
716 | do { \ | |
717 | char _______STR[] = __stringify((__VA_ARGS__)); \ | |
718 | if (sizeof(_______STR) > 3) \ | |
719 | do_trace_printk(fmt, ##__VA_ARGS__); \ | |
720 | else \ | |
721 | trace_puts(fmt); \ | |
722 | } while (0) | |
723 | ||
724 | #define do_trace_printk(fmt, args...) \ | |
769b0441 | 725 | do { \ |
3debb0a9 | 726 | static const char *trace_printk_fmt __used \ |
07d777fe SR |
727 | __attribute__((section("__trace_printk_fmt"))) = \ |
728 | __builtin_constant_p(fmt) ? fmt : NULL; \ | |
729 | \ | |
769b0441 | 730 | __trace_printk_check_format(fmt, ##args); \ |
48ead020 | 731 | \ |
07d777fe | 732 | if (__builtin_constant_p(fmt)) \ |
48ead020 | 733 | __trace_bprintk(_THIS_IP_, trace_printk_fmt, ##args); \ |
07d777fe SR |
734 | else \ |
735 | __trace_printk(_THIS_IP_, fmt, ##args); \ | |
769b0441 FW |
736 | } while (0) |
737 | ||
b9075fa9 JP |
738 | extern __printf(2, 3) |
739 | int __trace_bprintk(unsigned long ip, const char *fmt, ...); | |
48ead020 | 740 | |
b9075fa9 JP |
741 | extern __printf(2, 3) |
742 | int __trace_printk(unsigned long ip, const char *fmt, ...); | |
769b0441 | 743 | |
09ae7234 SRRH |
744 | /** |
745 | * trace_puts - write a string into the ftrace buffer | |
746 | * @str: the string to record | |
747 | * | |
748 | * Note: __trace_bputs is an internal function for trace_puts and | |
749 | * the @ip is passed in via the trace_puts macro. | |
750 | * | |
751 | * This is similar to trace_printk() but is made for those really fast | |
e8c97af0 | 752 | * paths that a developer wants the least amount of "Heisenbug" effects, |
09ae7234 SRRH |
753 | * where the processing of the print format is still too much. |
754 | * | |
755 | * This function allows a kernel developer to debug fast path sections | |
756 | * that printk is not appropriate for. By scattering in various | |
757 | * printk like tracing in the code, a developer can quickly see | |
758 | * where problems are occurring. | |
759 | * | |
760 | * This is intended as a debugging tool for the developer only. | |
761 | * Please refrain from leaving trace_puts scattered around in | |
762 | * your code. (Extra memory is used for special buffers that are | |
e8c97af0 | 763 | * allocated when trace_puts() is used.) |
09ae7234 SRRH |
764 | * |
765 | * Returns: 0 if nothing was written, positive # if string was. | |
766 | * (1 when __trace_bputs is used, strlen(str) when __trace_puts is used) | |
767 | */ | |
768 | ||
09ae7234 | 769 | #define trace_puts(str) ({ \ |
3debb0a9 | 770 | static const char *trace_printk_fmt __used \ |
09ae7234 SRRH |
771 | __attribute__((section("__trace_printk_fmt"))) = \ |
772 | __builtin_constant_p(str) ? str : NULL; \ | |
773 | \ | |
774 | if (__builtin_constant_p(str)) \ | |
775 | __trace_bputs(_THIS_IP_, trace_printk_fmt); \ | |
776 | else \ | |
777 | __trace_puts(_THIS_IP_, str, strlen(str)); \ | |
778 | }) | |
bcf312cf SR |
779 | extern int __trace_bputs(unsigned long ip, const char *str); |
780 | extern int __trace_puts(unsigned long ip, const char *str, int size); | |
09ae7234 | 781 | |
c142be8e | 782 | extern void trace_dump_stack(int skip); |
03889384 | 783 | |
48ead020 FW |
784 | /* |
785 | * The double __builtin_constant_p is because gcc will give us an error | |
786 | * if we try to allocate the static variable to fmt if it is not a | |
787 | * constant. Even with the outer if statement. | |
788 | */ | |
769b0441 FW |
789 | #define ftrace_vprintk(fmt, vargs) \ |
790 | do { \ | |
48ead020 | 791 | if (__builtin_constant_p(fmt)) { \ |
3debb0a9 | 792 | static const char *trace_printk_fmt __used \ |
48ead020 FW |
793 | __attribute__((section("__trace_printk_fmt"))) = \ |
794 | __builtin_constant_p(fmt) ? fmt : NULL; \ | |
7bffc23e | 795 | \ |
48ead020 FW |
796 | __ftrace_vbprintk(_THIS_IP_, trace_printk_fmt, vargs); \ |
797 | } else \ | |
798 | __ftrace_vprintk(_THIS_IP_, fmt, vargs); \ | |
769b0441 FW |
799 | } while (0) |
800 | ||
8db14860 | 801 | extern __printf(2, 0) int |
48ead020 FW |
802 | __ftrace_vbprintk(unsigned long ip, const char *fmt, va_list ap); |
803 | ||
8db14860 | 804 | extern __printf(2, 0) int |
526211bc | 805 | __ftrace_vprintk(unsigned long ip, const char *fmt, va_list ap); |
769b0441 | 806 | |
cecbca96 | 807 | extern void ftrace_dump(enum ftrace_dump_mode oops_dump_mode); |
526211bc | 808 | #else |
526211bc IM |
809 | static inline void tracing_start(void) { } |
810 | static inline void tracing_stop(void) { } | |
e67bc51e | 811 | static inline void trace_dump_stack(int skip) { } |
93d68e52 SR |
812 | |
813 | static inline void tracing_on(void) { } | |
814 | static inline void tracing_off(void) { } | |
815 | static inline int tracing_is_on(void) { return 0; } | |
ad909e21 SRRH |
816 | static inline void tracing_snapshot(void) { } |
817 | static inline void tracing_snapshot_alloc(void) { } | |
93d68e52 | 818 | |
60efc15a MH |
819 | static inline __printf(1, 2) |
820 | int trace_printk(const char *fmt, ...) | |
526211bc IM |
821 | { |
822 | return 0; | |
823 | } | |
8db14860 | 824 | static __printf(1, 0) inline int |
526211bc IM |
825 | ftrace_vprintk(const char *fmt, va_list ap) |
826 | { | |
827 | return 0; | |
828 | } | |
cecbca96 | 829 | static inline void ftrace_dump(enum ftrace_dump_mode oops_dump_mode) { } |
769b0441 | 830 | #endif /* CONFIG_TRACING */ |
526211bc | 831 | |
1da177e4 | 832 | /* |
3c8ba0d6 KC |
833 | * min()/max()/clamp() macros must accomplish three things: |
834 | * | |
835 | * - avoid multiple evaluations of the arguments (so side-effects like | |
836 | * "x++" happen only once) when non-constant. | |
837 | * - perform strict type-checking (to generate warnings instead of | |
838 | * nasty runtime surprises). See the "unnecessary" pointer comparison | |
839 | * in __typecheck(). | |
840 | * - retain result as a constant expressions when called with only | |
841 | * constant expressions (to avoid tripping VLA warnings in stack | |
842 | * allocation usage). | |
1da177e4 | 843 | */ |
3c8ba0d6 KC |
844 | #define __typecheck(x, y) \ |
845 | (!!(sizeof((typeof(x) *)1 == (typeof(y) *)1))) | |
846 | ||
847 | /* | |
848 | * This returns a constant expression while determining if an argument is | |
849 | * a constant expression, most importantly without evaluating the argument. | |
850 | * Glory to Martin Uecker <Martin.Uecker@med.uni-goettingen.de> | |
851 | */ | |
852 | #define __is_constexpr(x) \ | |
853 | (sizeof(int) == sizeof(*(8 ? ((void *)((long)(x) * 0l)) : (int *)8))) | |
854 | ||
855 | #define __no_side_effects(x, y) \ | |
856 | (__is_constexpr(x) && __is_constexpr(y)) | |
857 | ||
858 | #define __safe_cmp(x, y) \ | |
859 | (__typecheck(x, y) && __no_side_effects(x, y)) | |
860 | ||
861 | #define __cmp(x, y, op) ((x) op (y) ? (x) : (y)) | |
862 | ||
e9092d0d LT |
863 | #define __cmp_once(x, y, unique_x, unique_y, op) ({ \ |
864 | typeof(x) unique_x = (x); \ | |
865 | typeof(y) unique_y = (y); \ | |
866 | __cmp(unique_x, unique_y, op); }) | |
867 | ||
868 | #define __careful_cmp(x, y, op) \ | |
869 | __builtin_choose_expr(__safe_cmp(x, y), \ | |
870 | __cmp(x, y, op), \ | |
871 | __cmp_once(x, y, __UNIQUE_ID(__x), __UNIQUE_ID(__y), op)) | |
e8c97af0 RD |
872 | |
873 | /** | |
874 | * min - return minimum of two values of the same or compatible types | |
875 | * @x: first value | |
876 | * @y: second value | |
877 | */ | |
3c8ba0d6 | 878 | #define min(x, y) __careful_cmp(x, y, <) |
e8c97af0 RD |
879 | |
880 | /** | |
881 | * max - return maximum of two values of the same or compatible types | |
882 | * @x: first value | |
883 | * @y: second value | |
884 | */ | |
3c8ba0d6 | 885 | #define max(x, y) __careful_cmp(x, y, >) |
bdf4bbaa | 886 | |
e8c97af0 RD |
887 | /** |
888 | * min3 - return minimum of three values | |
889 | * @x: first value | |
890 | * @y: second value | |
891 | * @z: third value | |
892 | */ | |
2e1d06e1 | 893 | #define min3(x, y, z) min((typeof(x))min(x, y), z) |
e8c97af0 RD |
894 | |
895 | /** | |
896 | * max3 - return maximum of three values | |
897 | * @x: first value | |
898 | * @y: second value | |
899 | * @z: third value | |
900 | */ | |
2e1d06e1 | 901 | #define max3(x, y, z) max((typeof(x))max(x, y), z) |
f27c85c5 | 902 | |
c8bf1336 MP |
903 | /** |
904 | * min_not_zero - return the minimum that is _not_ zero, unless both are zero | |
905 | * @x: value1 | |
906 | * @y: value2 | |
907 | */ | |
908 | #define min_not_zero(x, y) ({ \ | |
909 | typeof(x) __x = (x); \ | |
910 | typeof(y) __y = (y); \ | |
911 | __x == 0 ? __y : ((__y == 0) ? __x : min(__x, __y)); }) | |
912 | ||
bdf4bbaa HH |
913 | /** |
914 | * clamp - return a value clamped to a given range with strict typechecking | |
915 | * @val: current value | |
2e1d06e1 MN |
916 | * @lo: lowest allowable value |
917 | * @hi: highest allowable value | |
bdf4bbaa | 918 | * |
e8c97af0 RD |
919 | * This macro does strict typechecking of @lo/@hi to make sure they are of the |
920 | * same type as @val. See the unnecessary pointer comparisons. | |
bdf4bbaa | 921 | */ |
2e1d06e1 | 922 | #define clamp(val, lo, hi) min((typeof(val))max(val, lo), hi) |
1da177e4 LT |
923 | |
924 | /* | |
925 | * ..and if you can't take the strict | |
926 | * types, you can specify one yourself. | |
927 | * | |
bdf4bbaa HH |
928 | * Or not use min/max/clamp at all, of course. |
929 | */ | |
e8c97af0 RD |
930 | |
931 | /** | |
932 | * min_t - return minimum of two values, using the specified type | |
933 | * @type: data type to use | |
934 | * @x: first value | |
935 | * @y: second value | |
936 | */ | |
3c8ba0d6 | 937 | #define min_t(type, x, y) __careful_cmp((type)(x), (type)(y), <) |
589a9785 | 938 | |
e8c97af0 RD |
939 | /** |
940 | * max_t - return maximum of two values, using the specified type | |
941 | * @type: data type to use | |
942 | * @x: first value | |
943 | * @y: second value | |
944 | */ | |
3c8ba0d6 | 945 | #define max_t(type, x, y) __careful_cmp((type)(x), (type)(y), >) |
bdf4bbaa HH |
946 | |
947 | /** | |
948 | * clamp_t - return a value clamped to a given range using a given type | |
949 | * @type: the type of variable to use | |
950 | * @val: current value | |
c185b07f MN |
951 | * @lo: minimum allowable value |
952 | * @hi: maximum allowable value | |
bdf4bbaa HH |
953 | * |
954 | * This macro does no typechecking and uses temporary variables of type | |
e8c97af0 | 955 | * @type to make all the comparisons. |
1da177e4 | 956 | */ |
c185b07f | 957 | #define clamp_t(type, val, lo, hi) min_t(type, max_t(type, val, lo), hi) |
1da177e4 | 958 | |
bdf4bbaa HH |
959 | /** |
960 | * clamp_val - return a value clamped to a given range using val's type | |
961 | * @val: current value | |
c185b07f MN |
962 | * @lo: minimum allowable value |
963 | * @hi: maximum allowable value | |
bdf4bbaa HH |
964 | * |
965 | * This macro does no typechecking and uses temporary variables of whatever | |
e8c97af0 RD |
966 | * type the input argument @val is. This is useful when @val is an unsigned |
967 | * type and @lo and @hi are literals that will otherwise be assigned a signed | |
bdf4bbaa HH |
968 | * integer type. |
969 | */ | |
c185b07f | 970 | #define clamp_val(val, lo, hi) clamp_t(typeof(val), val, lo, hi) |
1da177e4 | 971 | |
91f68b73 | 972 | |
e8c97af0 RD |
973 | /** |
974 | * swap - swap values of @a and @b | |
975 | * @a: first value | |
976 | * @b: second value | |
91f68b73 | 977 | */ |
ac7b9004 PZ |
978 | #define swap(a, b) \ |
979 | do { typeof(a) __tmp = (a); (a) = (b); (b) = __tmp; } while (0) | |
91f68b73 | 980 | |
cf14f27f AS |
981 | /* This counts to 12. Any more, it will return 13th argument. */ |
982 | #define __COUNT_ARGS(_0, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _n, X...) _n | |
983 | #define COUNT_ARGS(X...) __COUNT_ARGS(, ##X, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0) | |
984 | ||
985 | #define __CONCAT(a, b) a ## b | |
986 | #define CONCATENATE(a, b) __CONCAT(a, b) | |
987 | ||
1da177e4 LT |
988 | /** |
989 | * container_of - cast a member of a structure out to the containing structure | |
1da177e4 LT |
990 | * @ptr: the pointer to the member. |
991 | * @type: the type of the container struct this is embedded in. | |
992 | * @member: the name of the member within the struct. | |
993 | * | |
994 | */ | |
c7acec71 IA |
995 | #define container_of(ptr, type, member) ({ \ |
996 | void *__mptr = (void *)(ptr); \ | |
997 | BUILD_BUG_ON_MSG(!__same_type(*(ptr), ((type *)0)->member) && \ | |
998 | !__same_type(*(ptr), void), \ | |
999 | "pointer type mismatch in container_of()"); \ | |
1000 | ((type *)(__mptr - offsetof(type, member))); }) | |
1da177e4 | 1001 | |
05e6557b N |
1002 | /** |
1003 | * container_of_safe - cast a member of a structure out to the containing structure | |
1004 | * @ptr: the pointer to the member. | |
1005 | * @type: the type of the container struct this is embedded in. | |
1006 | * @member: the name of the member within the struct. | |
1007 | * | |
1008 | * If IS_ERR_OR_NULL(ptr), ptr is returned unchanged. | |
1009 | */ | |
1010 | #define container_of_safe(ptr, type, member) ({ \ | |
1011 | void *__mptr = (void *)(ptr); \ | |
1012 | BUILD_BUG_ON_MSG(!__same_type(*(ptr), ((type *)0)->member) && \ | |
1013 | !__same_type(*(ptr), void), \ | |
1014 | "pointer type mismatch in container_of()"); \ | |
227abcc6 | 1015 | IS_ERR_OR_NULL(__mptr) ? ERR_CAST(__mptr) : \ |
05e6557b N |
1016 | ((type *)(__mptr - offsetof(type, member))); }) |
1017 | ||
b9d4f426 AL |
1018 | /* Rebuild everything on CONFIG_FTRACE_MCOUNT_RECORD */ |
1019 | #ifdef CONFIG_FTRACE_MCOUNT_RECORD | |
1020 | # define REBUILD_DUE_TO_FTRACE_MCOUNT_RECORD | |
1021 | #endif | |
9d00f92f | 1022 | |
58f86cc8 | 1023 | /* Permissions on a sysfs file: you didn't miss the 0 prefix did you? */ |
28b8d0c8 GCM |
1024 | #define VERIFY_OCTAL_PERMISSIONS(perms) \ |
1025 | (BUILD_BUG_ON_ZERO((perms) < 0) + \ | |
1026 | BUILD_BUG_ON_ZERO((perms) > 0777) + \ | |
1027 | /* USER_READABLE >= GROUP_READABLE >= OTHER_READABLE */ \ | |
1028 | BUILD_BUG_ON_ZERO((((perms) >> 6) & 4) < (((perms) >> 3) & 4)) + \ | |
1029 | BUILD_BUG_ON_ZERO((((perms) >> 3) & 4) < ((perms) & 4)) + \ | |
1030 | /* USER_WRITABLE >= GROUP_WRITABLE */ \ | |
1031 | BUILD_BUG_ON_ZERO((((perms) >> 6) & 2) < (((perms) >> 3) & 2)) + \ | |
1032 | /* OTHER_WRITABLE? Generally considered a bad idea. */ \ | |
1033 | BUILD_BUG_ON_ZERO((perms) & 2) + \ | |
58f86cc8 | 1034 | (perms)) |
1da177e4 | 1035 | #endif |