Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | #ifndef __LINUX_COMPILER_H |
| 2 | #define __LINUX_COMPILER_H |
| 3 | |
| 4 | #ifndef __ASSEMBLY__ |
| 5 | |
| 6 | #ifdef __CHECKER__ |
| 7 | # define __user __attribute__((noderef, address_space(1))) |
Rusty Russell | e0fdb0e | 2009-10-29 22:34:15 +0900 | [diff] [blame] | 8 | # define __kernel __attribute__((address_space(0))) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 9 | # define __safe __attribute__((safe)) |
| 10 | # define __force __attribute__((force)) |
| 11 | # define __nocast __attribute__((nocast)) |
| 12 | # define __iomem __attribute__((noderef, address_space(2))) |
Josh Triplett | 8529091 | 2012-12-17 16:03:24 -0800 | [diff] [blame] | 13 | # define __must_hold(x) __attribute__((context(x,1,1))) |
Josh Triplett | c902e0a | 2006-09-30 23:28:21 -0700 | [diff] [blame] | 14 | # define __acquires(x) __attribute__((context(x,0,1))) |
| 15 | # define __releases(x) __attribute__((context(x,1,0))) |
| 16 | # define __acquire(x) __context__(x,1) |
| 17 | # define __release(x) __context__(x,-1) |
Josh Triplett | dcc8e55 | 2006-09-29 02:01:03 -0700 | [diff] [blame] | 18 | # define __cond_lock(x,c) ((c) ? ({ __acquire(x); 1; }) : 0) |
Rusty Russell | e0fdb0e | 2009-10-29 22:34:15 +0900 | [diff] [blame] | 19 | # define __percpu __attribute__((noderef, address_space(3))) |
Paul E. McKenney | ca5ecdd | 2010-04-28 14:39:09 -0700 | [diff] [blame] | 20 | #ifdef CONFIG_SPARSE_RCU_POINTER |
| 21 | # define __rcu __attribute__((noderef, address_space(4))) |
Boqun Feng | ad31545 | 2015-12-29 12:18:46 +0800 | [diff] [blame] | 22 | #else /* CONFIG_SPARSE_RCU_POINTER */ |
Paul E. McKenney | 71d1d5c | 2010-05-11 16:13:14 -0700 | [diff] [blame] | 23 | # define __rcu |
Boqun Feng | ad31545 | 2015-12-29 12:18:46 +0800 | [diff] [blame] | 24 | #endif /* CONFIG_SPARSE_RCU_POINTER */ |
| 25 | # define __private __attribute__((noderef)) |
Al Viro | c47ffe3 | 2007-07-26 17:35:29 +0100 | [diff] [blame] | 26 | extern void __chk_user_ptr(const volatile void __user *); |
| 27 | extern void __chk_io_ptr(const volatile void __iomem *); |
Boqun Feng | ad31545 | 2015-12-29 12:18:46 +0800 | [diff] [blame] | 28 | # define ACCESS_PRIVATE(p, member) (*((typeof((p)->member) __force *) &(p)->member)) |
| 29 | #else /* __CHECKER__ */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 30 | # define __user |
| 31 | # define __kernel |
| 32 | # define __safe |
| 33 | # define __force |
| 34 | # define __nocast |
| 35 | # define __iomem |
| 36 | # define __chk_user_ptr(x) (void)0 |
| 37 | # define __chk_io_ptr(x) (void)0 |
| 38 | # define __builtin_warning(x, y...) (1) |
Josh Triplett | 8529091 | 2012-12-17 16:03:24 -0800 | [diff] [blame] | 39 | # define __must_hold(x) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 40 | # define __acquires(x) |
| 41 | # define __releases(x) |
| 42 | # define __acquire(x) (void)0 |
| 43 | # define __release(x) (void)0 |
Josh Triplett | dcc8e55 | 2006-09-29 02:01:03 -0700 | [diff] [blame] | 44 | # define __cond_lock(x,c) (c) |
Rusty Russell | e0fdb0e | 2009-10-29 22:34:15 +0900 | [diff] [blame] | 45 | # define __percpu |
Paul E. McKenney | 71d1d5c | 2010-05-11 16:13:14 -0700 | [diff] [blame] | 46 | # define __rcu |
Boqun Feng | ad31545 | 2015-12-29 12:18:46 +0800 | [diff] [blame] | 47 | # define __private |
| 48 | # define ACCESS_PRIVATE(p, member) ((p)->member) |
| 49 | #endif /* __CHECKER__ */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 50 | |
Rusty Russell | 6f33d58 | 2012-11-22 12:30:25 +1030 | [diff] [blame] | 51 | /* Indirect macros required for expanded argument pasting, eg. __LINE__. */ |
| 52 | #define ___PASTE(a,b) a##b |
| 53 | #define __PASTE(a,b) ___PASTE(a,b) |
| 54 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 55 | #ifdef __KERNEL__ |
| 56 | |
Miguel Ojeda | fe58443 | 2019-08-02 12:37:56 +0200 | [diff] [blame] | 57 | /* |
| 58 | * Minimal backport of compiler_attributes.h to add support for __copy |
| 59 | * to v4.9.y so that we can use it in init/exit_module to avoid |
| 60 | * -Werror=missing-attributes errors on GCC 9. |
| 61 | */ |
| 62 | #ifndef __has_attribute |
| 63 | # define __has_attribute(x) __GCC4_has_attribute_##x |
| 64 | # define __GCC4_has_attribute___copy__ 0 |
| 65 | #endif |
| 66 | |
| 67 | #if __has_attribute(__copy__) |
| 68 | # define __copy(symbol) __attribute__((__copy__(symbol))) |
| 69 | #else |
| 70 | # define __copy(symbol) |
| 71 | #endif |
| 72 | |
Linus Torvalds | f153b82 | 2009-01-02 09:23:03 -0800 | [diff] [blame] | 73 | #ifdef __GNUC__ |
| 74 | #include <linux/compiler-gcc.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 75 | #endif |
| 76 | |
Christian Borntraeger | 0c5a69f | 2015-10-07 10:54:36 +0200 | [diff] [blame] | 77 | #if defined(CC_USING_HOTPATCH) && !defined(__CHECKER__) |
Heiko Carstens | 61f5521 | 2015-01-18 16:45:42 +0100 | [diff] [blame] | 78 | #define notrace __attribute__((hotpatch(0,0))) |
| 79 | #else |
Steven Rostedt | 2861488 | 2008-08-14 22:47:18 -0400 | [diff] [blame] | 80 | #define notrace __attribute__((no_instrument_function)) |
Heiko Carstens | 61f5521 | 2015-01-18 16:45:42 +0100 | [diff] [blame] | 81 | #endif |
Steven Rostedt | 2861488 | 2008-08-14 22:47:18 -0400 | [diff] [blame] | 82 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 83 | /* Intel compiler defines __GNUC__. So we will overwrite implementations |
| 84 | * coming from above header files here |
| 85 | */ |
| 86 | #ifdef __INTEL_COMPILER |
| 87 | # include <linux/compiler-intel.h> |
| 88 | #endif |
| 89 | |
Mark Charlebois | 565cbdc | 2012-11-20 22:13:10 +0100 | [diff] [blame] | 90 | /* Clang compiler defines __GNUC__. So we will overwrite implementations |
| 91 | * coming from above header files here |
| 92 | */ |
| 93 | #ifdef __clang__ |
| 94 | #include <linux/compiler-clang.h> |
| 95 | #endif |
| 96 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 97 | /* |
| 98 | * Generic compiler-dependent macros required for kernel |
| 99 | * build go below this comment. Actual compiler/compiler version |
| 100 | * specific implementations come from the above header files |
| 101 | */ |
| 102 | |
Steven Rostedt | 2ed84ee | 2008-11-12 15:24:24 -0500 | [diff] [blame] | 103 | struct ftrace_branch_data { |
Steven Rostedt | 1f0d69a | 2008-11-12 00:14:39 -0500 | [diff] [blame] | 104 | const char *func; |
| 105 | const char *file; |
| 106 | unsigned line; |
Steven Rostedt | 2bcd521 | 2008-11-21 01:30:54 -0500 | [diff] [blame] | 107 | union { |
| 108 | struct { |
| 109 | unsigned long correct; |
| 110 | unsigned long incorrect; |
| 111 | }; |
| 112 | struct { |
| 113 | unsigned long miss; |
| 114 | unsigned long hit; |
| 115 | }; |
Witold Baryluk | 97e7e4f | 2009-03-17 21:15:44 +0100 | [diff] [blame] | 116 | unsigned long miss_hit[2]; |
Steven Rostedt | 2bcd521 | 2008-11-21 01:30:54 -0500 | [diff] [blame] | 117 | }; |
Steven Rostedt | 1f0d69a | 2008-11-12 00:14:39 -0500 | [diff] [blame] | 118 | }; |
Steven Rostedt | 2ed84ee | 2008-11-12 15:24:24 -0500 | [diff] [blame] | 119 | |
| 120 | /* |
| 121 | * Note: DISABLE_BRANCH_PROFILING can be used by special lowlevel code |
| 122 | * to disable branch tracing on a per file basis. |
| 123 | */ |
Bart Van Assche | d9ad8bc | 2009-04-05 16:20:02 +0200 | [diff] [blame] | 124 | #if defined(CONFIG_TRACE_BRANCH_PROFILING) \ |
| 125 | && !defined(DISABLE_BRANCH_PROFILING) && !defined(__CHECKER__) |
Steven Rostedt | 2ed84ee | 2008-11-12 15:24:24 -0500 | [diff] [blame] | 126 | void ftrace_likely_update(struct ftrace_branch_data *f, int val, int expect); |
Steven Rostedt | 1f0d69a | 2008-11-12 00:14:39 -0500 | [diff] [blame] | 127 | |
| 128 | #define likely_notrace(x) __builtin_expect(!!(x), 1) |
| 129 | #define unlikely_notrace(x) __builtin_expect(!!(x), 0) |
| 130 | |
Steven Rostedt | 45b7974 | 2008-11-21 00:40:40 -0500 | [diff] [blame] | 131 | #define __branch_check__(x, expect) ({ \ |
Mikulas Patocka | 3e4fab7 | 2018-05-30 08:19:22 -0400 | [diff] [blame] | 132 | long ______r; \ |
Steven Rostedt | 2ed84ee | 2008-11-12 15:24:24 -0500 | [diff] [blame] | 133 | static struct ftrace_branch_data \ |
Steven Rostedt | 1f0d69a | 2008-11-12 00:14:39 -0500 | [diff] [blame] | 134 | __attribute__((__aligned__(4))) \ |
Steven Rostedt | 45b7974 | 2008-11-21 00:40:40 -0500 | [diff] [blame] | 135 | __attribute__((section("_ftrace_annotated_branch"))) \ |
Steven Rostedt | 1f0d69a | 2008-11-12 00:14:39 -0500 | [diff] [blame] | 136 | ______f = { \ |
| 137 | .func = __func__, \ |
| 138 | .file = __FILE__, \ |
| 139 | .line = __LINE__, \ |
| 140 | }; \ |
Steven Rostedt | 1f0d69a | 2008-11-12 00:14:39 -0500 | [diff] [blame] | 141 | ______r = likely_notrace(x); \ |
Steven Rostedt | 45b7974 | 2008-11-21 00:40:40 -0500 | [diff] [blame] | 142 | ftrace_likely_update(&______f, ______r, expect); \ |
Steven Rostedt | 1f0d69a | 2008-11-12 00:14:39 -0500 | [diff] [blame] | 143 | ______r; \ |
| 144 | }) |
| 145 | |
| 146 | /* |
| 147 | * Using __builtin_constant_p(x) to ignore cases where the return |
| 148 | * value is always the same. This idea is taken from a similar patch |
| 149 | * written by Daniel Walker. |
| 150 | */ |
| 151 | # ifndef likely |
Steven Rostedt | 45b7974 | 2008-11-21 00:40:40 -0500 | [diff] [blame] | 152 | # define likely(x) (__builtin_constant_p(x) ? !!(x) : __branch_check__(x, 1)) |
Steven Rostedt | 1f0d69a | 2008-11-12 00:14:39 -0500 | [diff] [blame] | 153 | # endif |
| 154 | # ifndef unlikely |
Steven Rostedt | 45b7974 | 2008-11-21 00:40:40 -0500 | [diff] [blame] | 155 | # define unlikely(x) (__builtin_constant_p(x) ? !!(x) : __branch_check__(x, 0)) |
Steven Rostedt | 1f0d69a | 2008-11-12 00:14:39 -0500 | [diff] [blame] | 156 | # endif |
Steven Rostedt | 2bcd521 | 2008-11-21 01:30:54 -0500 | [diff] [blame] | 157 | |
| 158 | #ifdef CONFIG_PROFILE_ALL_BRANCHES |
| 159 | /* |
| 160 | * "Define 'is'", Bill Clinton |
| 161 | * "Define 'if'", Steven Rostedt |
| 162 | */ |
Linus Torvalds | ab3c9c6 | 2009-04-07 07:59:41 -0700 | [diff] [blame] | 163 | #define if(cond, ...) __trace_if( (cond , ## __VA_ARGS__) ) |
| 164 | #define __trace_if(cond) \ |
Arnd Bergmann | b33c8ff | 2016-02-12 22:26:42 +0100 | [diff] [blame] | 165 | if (__builtin_constant_p(!!(cond)) ? !!(cond) : \ |
Steven Rostedt | 2bcd521 | 2008-11-21 01:30:54 -0500 | [diff] [blame] | 166 | ({ \ |
| 167 | int ______r; \ |
| 168 | static struct ftrace_branch_data \ |
| 169 | __attribute__((__aligned__(4))) \ |
| 170 | __attribute__((section("_ftrace_branch"))) \ |
| 171 | ______f = { \ |
| 172 | .func = __func__, \ |
| 173 | .file = __FILE__, \ |
| 174 | .line = __LINE__, \ |
| 175 | }; \ |
| 176 | ______r = !!(cond); \ |
Witold Baryluk | 97e7e4f | 2009-03-17 21:15:44 +0100 | [diff] [blame] | 177 | ______f.miss_hit[______r]++; \ |
Steven Rostedt | 2bcd521 | 2008-11-21 01:30:54 -0500 | [diff] [blame] | 178 | ______r; \ |
| 179 | })) |
| 180 | #endif /* CONFIG_PROFILE_ALL_BRANCHES */ |
| 181 | |
Steven Rostedt | 1f0d69a | 2008-11-12 00:14:39 -0500 | [diff] [blame] | 182 | #else |
| 183 | # define likely(x) __builtin_expect(!!(x), 1) |
| 184 | # define unlikely(x) __builtin_expect(!!(x), 0) |
| 185 | #endif |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 186 | |
| 187 | /* Optimization barrier */ |
| 188 | #ifndef barrier |
| 189 | # define barrier() __memory_barrier() |
| 190 | #endif |
| 191 | |
Daniel Borkmann | 7829fb0 | 2015-04-30 04:13:52 +0200 | [diff] [blame] | 192 | #ifndef barrier_data |
| 193 | # define barrier_data(ptr) barrier() |
| 194 | #endif |
| 195 | |
Arnd Bergmann | 074d0aa | 2018-02-21 14:45:54 -0800 | [diff] [blame] | 196 | /* workaround for GCC PR82365 if needed */ |
| 197 | #ifndef barrier_before_unreachable |
| 198 | # define barrier_before_unreachable() do { } while (0) |
| 199 | #endif |
| 200 | |
David Daney | 38938c8 | 2009-12-04 17:44:50 -0800 | [diff] [blame] | 201 | /* Unreachable code */ |
| 202 | #ifndef unreachable |
| 203 | # define unreachable() do { } while (1) |
| 204 | #endif |
| 205 | |
Nicholas Piggin | b67067f | 2016-08-24 22:29:20 +1000 | [diff] [blame] | 206 | /* |
| 207 | * KENTRY - kernel entry point |
| 208 | * This can be used to annotate symbols (functions or data) that are used |
| 209 | * without their linker symbol being referenced explicitly. For example, |
| 210 | * interrupt vector handlers, or functions in the kernel image that are found |
| 211 | * programatically. |
| 212 | * |
| 213 | * Not required for symbols exported with EXPORT_SYMBOL, or initcalls. Those |
| 214 | * are handled in their own way (with KEEP() in linker scripts). |
| 215 | * |
| 216 | * KENTRY can be avoided if the symbols in question are marked as KEEP() in the |
| 217 | * linker script. For example an architecture could KEEP() its entire |
| 218 | * boot/exception vector code rather than annotate each function and data. |
| 219 | */ |
| 220 | #ifndef KENTRY |
| 221 | # define KENTRY(sym) \ |
| 222 | extern typeof(sym) sym; \ |
| 223 | static const unsigned long __kentry_##sym \ |
| 224 | __used \ |
| 225 | __attribute__((section("___kentry" "+" #sym ), used)) \ |
| 226 | = (unsigned long)&sym; |
| 227 | #endif |
| 228 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 229 | #ifndef RELOC_HIDE |
| 230 | # define RELOC_HIDE(ptr, off) \ |
| 231 | ({ unsigned long __ptr; \ |
| 232 | __ptr = (unsigned long) (ptr); \ |
| 233 | (typeof(ptr)) (__ptr + (off)); }) |
| 234 | #endif |
| 235 | |
Cesar Eduardo Barros | fe8c8a1 | 2013-11-25 22:00:41 -0200 | [diff] [blame] | 236 | #ifndef OPTIMIZER_HIDE_VAR |
| 237 | #define OPTIMIZER_HIDE_VAR(var) barrier() |
| 238 | #endif |
| 239 | |
Rusty Russell | 6f33d58 | 2012-11-22 12:30:25 +1030 | [diff] [blame] | 240 | /* Not-quite-unique ID. */ |
| 241 | #ifndef __UNIQUE_ID |
| 242 | # define __UNIQUE_ID(prefix) __PASTE(__PASTE(__UNIQUE_ID_, prefix), __LINE__) |
| 243 | #endif |
| 244 | |
Christian Borntraeger | 230fa25 | 2014-11-25 10:01:16 +0100 | [diff] [blame] | 245 | #include <uapi/linux/types.h> |
| 246 | |
Andrey Ryabinin | d976441 | 2015-10-19 11:37:17 +0300 | [diff] [blame] | 247 | #define __READ_ONCE_SIZE \ |
| 248 | ({ \ |
| 249 | switch (size) { \ |
| 250 | case 1: *(__u8 *)res = *(volatile __u8 *)p; break; \ |
| 251 | case 2: *(__u16 *)res = *(volatile __u16 *)p; break; \ |
| 252 | case 4: *(__u32 *)res = *(volatile __u32 *)p; break; \ |
| 253 | case 8: *(__u64 *)res = *(volatile __u64 *)p; break; \ |
| 254 | default: \ |
| 255 | barrier(); \ |
| 256 | __builtin_memcpy((void *)res, (const void *)p, size); \ |
| 257 | barrier(); \ |
| 258 | } \ |
| 259 | }) |
| 260 | |
| 261 | static __always_inline |
| 262 | void __read_once_size(const volatile void *p, void *res, int size) |
Christian Borntraeger | 230fa25 | 2014-11-25 10:01:16 +0100 | [diff] [blame] | 263 | { |
Andrey Ryabinin | d976441 | 2015-10-19 11:37:17 +0300 | [diff] [blame] | 264 | __READ_ONCE_SIZE; |
Christian Borntraeger | 230fa25 | 2014-11-25 10:01:16 +0100 | [diff] [blame] | 265 | } |
| 266 | |
Andrey Ryabinin | d976441 | 2015-10-19 11:37:17 +0300 | [diff] [blame] | 267 | #ifdef CONFIG_KASAN |
| 268 | /* |
Andrey Ryabinin | 229b670 | 2018-02-01 21:00:48 +0300 | [diff] [blame] | 269 | * We can't declare function 'inline' because __no_sanitize_address confilcts |
Andrey Ryabinin | d976441 | 2015-10-19 11:37:17 +0300 | [diff] [blame] | 270 | * with inlining. Attempt to inline it may cause a build failure. |
| 271 | * https://gcc.gnu.org/bugzilla/show_bug.cgi?id=67368 |
| 272 | * '__maybe_unused' allows us to avoid defined-but-not-used warnings. |
| 273 | */ |
Andrey Ryabinin | 229b670 | 2018-02-01 21:00:48 +0300 | [diff] [blame] | 274 | # define __no_kasan_or_inline __no_sanitize_address __maybe_unused |
Andrey Ryabinin | d976441 | 2015-10-19 11:37:17 +0300 | [diff] [blame] | 275 | #else |
Andrey Ryabinin | 229b670 | 2018-02-01 21:00:48 +0300 | [diff] [blame] | 276 | # define __no_kasan_or_inline __always_inline |
| 277 | #endif |
| 278 | |
| 279 | static __no_kasan_or_inline |
Andrey Ryabinin | d976441 | 2015-10-19 11:37:17 +0300 | [diff] [blame] | 280 | void __read_once_size_nocheck(const volatile void *p, void *res, int size) |
| 281 | { |
| 282 | __READ_ONCE_SIZE; |
| 283 | } |
Andrey Ryabinin | d976441 | 2015-10-19 11:37:17 +0300 | [diff] [blame] | 284 | |
Christian Borntraeger | 43239cb | 2015-01-13 10:46:42 +0100 | [diff] [blame] | 285 | static __always_inline void __write_once_size(volatile void *p, void *res, int size) |
Christian Borntraeger | 230fa25 | 2014-11-25 10:01:16 +0100 | [diff] [blame] | 286 | { |
| 287 | switch (size) { |
| 288 | case 1: *(volatile __u8 *)p = *(__u8 *)res; break; |
| 289 | case 2: *(volatile __u16 *)p = *(__u16 *)res; break; |
| 290 | case 4: *(volatile __u32 *)p = *(__u32 *)res; break; |
Christian Borntraeger | 230fa25 | 2014-11-25 10:01:16 +0100 | [diff] [blame] | 291 | case 8: *(volatile __u64 *)p = *(__u64 *)res; break; |
Christian Borntraeger | 230fa25 | 2014-11-25 10:01:16 +0100 | [diff] [blame] | 292 | default: |
| 293 | barrier(); |
| 294 | __builtin_memcpy((void *)p, (const void *)res, size); |
Christian Borntraeger | 230fa25 | 2014-11-25 10:01:16 +0100 | [diff] [blame] | 295 | barrier(); |
| 296 | } |
| 297 | } |
| 298 | |
| 299 | /* |
| 300 | * Prevent the compiler from merging or refetching reads or writes. The |
| 301 | * compiler is also forbidden from reordering successive instances of |
Christian Borntraeger | 43239cb | 2015-01-13 10:46:42 +0100 | [diff] [blame] | 302 | * READ_ONCE, WRITE_ONCE and ACCESS_ONCE (see below), but only when the |
Christian Borntraeger | 230fa25 | 2014-11-25 10:01:16 +0100 | [diff] [blame] | 303 | * compiler is aware of some particular ordering. One way to make the |
| 304 | * compiler aware of ordering is to put the two invocations of READ_ONCE, |
Christian Borntraeger | 43239cb | 2015-01-13 10:46:42 +0100 | [diff] [blame] | 305 | * WRITE_ONCE or ACCESS_ONCE() in different C statements. |
Christian Borntraeger | 230fa25 | 2014-11-25 10:01:16 +0100 | [diff] [blame] | 306 | * |
| 307 | * In contrast to ACCESS_ONCE these two macros will also work on aggregate |
| 308 | * data types like structs or unions. If the size of the accessed data |
| 309 | * type exceeds the word size of the machine (e.g., 32 bits or 64 bits) |
Konrad Rzeszutek Wilk | fed0764 | 2016-01-25 16:33:20 -0500 | [diff] [blame] | 310 | * READ_ONCE() and WRITE_ONCE() will fall back to memcpy(). There's at |
| 311 | * least two memcpy()s: one for the __builtin_memcpy() and then one for |
| 312 | * the macro doing the copy of variable - '__u' allocated on the stack. |
Christian Borntraeger | 230fa25 | 2014-11-25 10:01:16 +0100 | [diff] [blame] | 313 | * |
| 314 | * Their two major use cases are: (1) Mediating communication between |
| 315 | * process-level code and irq/NMI handlers, all running on the same CPU, |
| 316 | * and (2) Ensuring that the compiler does not fold, spindle, or otherwise |
| 317 | * mutilate accesses that either do not require ordering or that interact |
| 318 | * with an explicit memory barrier or atomic instruction that provides the |
| 319 | * required ordering. |
| 320 | */ |
Andrey Ryabinin | 4b5d4bd | 2018-02-01 21:00:49 +0300 | [diff] [blame] | 321 | #include <linux/kasan-checks.h> |
Christian Borntraeger | 230fa25 | 2014-11-25 10:01:16 +0100 | [diff] [blame] | 322 | |
Andrey Ryabinin | d976441 | 2015-10-19 11:37:17 +0300 | [diff] [blame] | 323 | #define __READ_ONCE(x, check) \ |
| 324 | ({ \ |
| 325 | union { typeof(x) __val; char __c[1]; } __u; \ |
| 326 | if (check) \ |
| 327 | __read_once_size(&(x), __u.__c, sizeof(x)); \ |
| 328 | else \ |
| 329 | __read_once_size_nocheck(&(x), __u.__c, sizeof(x)); \ |
| 330 | __u.__val; \ |
| 331 | }) |
| 332 | #define READ_ONCE(x) __READ_ONCE(x, 1) |
| 333 | |
| 334 | /* |
| 335 | * Use READ_ONCE_NOCHECK() instead of READ_ONCE() if you need |
| 336 | * to hide memory access from KASAN. |
| 337 | */ |
| 338 | #define READ_ONCE_NOCHECK(x) __READ_ONCE(x, 0) |
Christian Borntraeger | 230fa25 | 2014-11-25 10:01:16 +0100 | [diff] [blame] | 339 | |
Andrey Ryabinin | 4b5d4bd | 2018-02-01 21:00:49 +0300 | [diff] [blame] | 340 | static __no_kasan_or_inline |
| 341 | unsigned long read_word_at_a_time(const void *addr) |
| 342 | { |
| 343 | kasan_check_read(addr, 1); |
| 344 | return *(unsigned long *)addr; |
| 345 | } |
| 346 | |
Christian Borntraeger | 43239cb | 2015-01-13 10:46:42 +0100 | [diff] [blame] | 347 | #define WRITE_ONCE(x, val) \ |
Christian Borntraeger | ba33034 | 2015-08-04 09:55:48 +0200 | [diff] [blame] | 348 | ({ \ |
| 349 | union { typeof(x) __val; char __c[1]; } __u = \ |
| 350 | { .__val = (__force typeof(x)) (val) }; \ |
| 351 | __write_once_size(&(x), __u.__c, sizeof(x)); \ |
| 352 | __u.__val; \ |
| 353 | }) |
Christian Borntraeger | 230fa25 | 2014-11-25 10:01:16 +0100 | [diff] [blame] | 354 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 355 | #endif /* __KERNEL__ */ |
| 356 | |
| 357 | #endif /* __ASSEMBLY__ */ |
| 358 | |
David Woodhouse | 4f79c3f | 2006-05-02 10:41:25 +0100 | [diff] [blame] | 359 | #ifdef __KERNEL__ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 360 | /* |
| 361 | * Allow us to mark functions as 'deprecated' and have gcc emit a nice |
| 362 | * warning for each use, in hopes of speeding the functions removal. |
| 363 | * Usage is: |
| 364 | * int __deprecated foo(void) |
| 365 | */ |
| 366 | #ifndef __deprecated |
| 367 | # define __deprecated /* unimplemented */ |
| 368 | #endif |
| 369 | |
Paul E. McKenney | 512345b | 2005-05-01 08:59:03 -0700 | [diff] [blame] | 370 | #ifdef MODULE |
| 371 | #define __deprecated_for_modules __deprecated |
| 372 | #else |
| 373 | #define __deprecated_for_modules |
| 374 | #endif |
| 375 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 376 | #ifndef __must_check |
| 377 | #define __must_check |
| 378 | #endif |
| 379 | |
Andrew Morton | cebc04b | 2006-08-14 22:43:18 -0700 | [diff] [blame] | 380 | #ifndef CONFIG_ENABLE_MUST_CHECK |
| 381 | #undef __must_check |
| 382 | #define __must_check |
| 383 | #endif |
Jeff Garzik | de48844 | 2007-10-25 04:06:13 -0400 | [diff] [blame] | 384 | #ifndef CONFIG_ENABLE_WARN_DEPRECATED |
| 385 | #undef __deprecated |
| 386 | #undef __deprecated_for_modules |
| 387 | #define __deprecated |
| 388 | #define __deprecated_for_modules |
| 389 | #endif |
Andrew Morton | cebc04b | 2006-08-14 22:43:18 -0700 | [diff] [blame] | 390 | |
Rasmus Villemoes | d64e85d | 2016-05-19 17:10:52 -0700 | [diff] [blame] | 391 | #ifndef __malloc |
| 392 | #define __malloc |
| 393 | #endif |
| 394 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 395 | /* |
| 396 | * Allow us to avoid 'defined but not used' warnings on functions and data, |
| 397 | * as well as force them to be emitted to the assembly file. |
| 398 | * |
David Rientjes | 0d7ebbb | 2007-05-09 02:35:27 -0700 | [diff] [blame] | 399 | * As of gcc 3.4, static functions that are not marked with attribute((used)) |
| 400 | * may be elided from the assembly file. As of gcc 3.4, static data not so |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 401 | * marked will not be elided, but this may change in a future gcc version. |
| 402 | * |
David Rientjes | 0d7ebbb | 2007-05-09 02:35:27 -0700 | [diff] [blame] | 403 | * NOTE: Because distributions shipped with a backported unit-at-a-time |
| 404 | * compiler in gcc 3.3, we must define __used to be __attribute__((used)) |
| 405 | * for gcc >=3.3 instead of 3.4. |
| 406 | * |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 407 | * In prior versions of gcc, such functions and data would be emitted, but |
| 408 | * would be warned about except with attribute((unused)). |
David Rientjes | 0d7ebbb | 2007-05-09 02:35:27 -0700 | [diff] [blame] | 409 | * |
| 410 | * Mark functions that are referenced only in inline assembly as __used so |
| 411 | * the code is emitted even though it appears to be unreferenced. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 412 | */ |
David Rientjes | 0d7ebbb | 2007-05-09 02:35:27 -0700 | [diff] [blame] | 413 | #ifndef __used |
| 414 | # define __used /* unimplemented */ |
| 415 | #endif |
| 416 | |
| 417 | #ifndef __maybe_unused |
| 418 | # define __maybe_unused /* unimplemented */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 419 | #endif |
| 420 | |
Li Zefan | 7b2a351 | 2009-11-02 08:50:52 +0800 | [diff] [blame] | 421 | #ifndef __always_unused |
| 422 | # define __always_unused /* unimplemented */ |
| 423 | #endif |
| 424 | |
David Woodhouse | 423bc7b | 2006-05-04 00:41:02 +0100 | [diff] [blame] | 425 | #ifndef noinline |
| 426 | #define noinline |
| 427 | #endif |
| 428 | |
Andrew Morton | 735c4fb | 2008-03-04 14:28:40 -0800 | [diff] [blame] | 429 | /* |
| 430 | * Rather then using noinline to prevent stack consumption, use |
Alexander Stein | e6be0c9 | 2012-02-23 13:42:30 +0100 | [diff] [blame] | 431 | * noinline_for_stack instead. For documentation reasons. |
Andrew Morton | 735c4fb | 2008-03-04 14:28:40 -0800 | [diff] [blame] | 432 | */ |
| 433 | #define noinline_for_stack noinline |
| 434 | |
David Woodhouse | 423bc7b | 2006-05-04 00:41:02 +0100 | [diff] [blame] | 435 | #ifndef __always_inline |
| 436 | #define __always_inline inline |
| 437 | #endif |
| 438 | |
| 439 | #endif /* __KERNEL__ */ |
| 440 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 441 | /* |
| 442 | * From the GCC manual: |
| 443 | * |
| 444 | * Many functions do not examine any values except their arguments, |
| 445 | * and have no effects except the return value. Basically this is |
| 446 | * just slightly more strict class than the `pure' attribute above, |
| 447 | * since function is not allowed to read global memory. |
| 448 | * |
| 449 | * Note that a function that has pointer arguments and examines the |
| 450 | * data pointed to must _not_ be declared `const'. Likewise, a |
| 451 | * function that calls a non-`const' function usually must not be |
| 452 | * `const'. It does not make sense for a `const' function to return |
| 453 | * `void'. |
| 454 | */ |
| 455 | #ifndef __attribute_const__ |
| 456 | # define __attribute_const__ /* unimplemented */ |
| 457 | #endif |
| 458 | |
Emese Revfy | 0766f78 | 2016-06-20 20:42:34 +0200 | [diff] [blame] | 459 | #ifndef __latent_entropy |
| 460 | # define __latent_entropy |
| 461 | #endif |
| 462 | |
Andi Kleen | a586df0 | 2007-07-21 17:10:00 +0200 | [diff] [blame] | 463 | /* |
| 464 | * Tell gcc if a function is cold. The compiler will assume any path |
| 465 | * directly leading to the call is unlikely. |
| 466 | */ |
| 467 | |
| 468 | #ifndef __cold |
| 469 | #define __cold |
| 470 | #endif |
| 471 | |
Sam Ravnborg | f3fe866 | 2008-01-20 18:54:48 +0100 | [diff] [blame] | 472 | /* Simple shorthand for a section definition */ |
| 473 | #ifndef __section |
| 474 | # define __section(S) __attribute__ ((__section__(#S))) |
| 475 | #endif |
| 476 | |
Andi Kleen | 9a858dc | 2012-09-17 14:09:15 -0700 | [diff] [blame] | 477 | #ifndef __visible |
| 478 | #define __visible |
| 479 | #endif |
| 480 | |
Sami Tolvanen | 7bd125e | 2017-06-16 12:52:57 -0700 | [diff] [blame] | 481 | #ifndef __norecordmcount |
| 482 | #define __norecordmcount |
| 483 | #endif |
| 484 | |
Sami Tolvanen | 00a195e | 2017-05-11 15:03:36 -0700 | [diff] [blame] | 485 | #ifndef __nocfi |
| 486 | #define __nocfi |
| 487 | #endif |
| 488 | |
Rasmus Villemoes | a744fd1 | 2015-11-05 18:45:02 -0800 | [diff] [blame] | 489 | /* |
| 490 | * Assume alignment of return value. |
| 491 | */ |
| 492 | #ifndef __assume_aligned |
| 493 | #define __assume_aligned(a, ...) |
| 494 | #endif |
| 495 | |
| 496 | |
Rusty Russell | d2c123c | 2009-06-12 21:46:56 -0600 | [diff] [blame] | 497 | /* Are two types/vars the same type (ignoring qualifiers)? */ |
| 498 | #ifndef __same_type |
| 499 | # define __same_type(a, b) __builtin_types_compatible_p(typeof(a), typeof(b)) |
| 500 | #endif |
| 501 | |
Peter Zijlstra | 47933ad | 2013-11-06 14:57:36 +0100 | [diff] [blame] | 502 | /* Is this type a native word size -- useful for atomic operations */ |
| 503 | #ifndef __native_word |
Paul E. McKenney | 536fa40 | 2014-09-05 11:14:48 -0700 | [diff] [blame] | 504 | # define __native_word(t) (sizeof(t) == sizeof(char) || sizeof(t) == sizeof(short) || sizeof(t) == sizeof(int) || sizeof(t) == sizeof(long)) |
Peter Zijlstra | 47933ad | 2013-11-06 14:57:36 +0100 | [diff] [blame] | 505 | #endif |
| 506 | |
Geert Uytterhoeven | 3740b9f | 2018-02-01 11:21:58 +0100 | [diff] [blame] | 507 | #ifndef __optimize |
| 508 | # define __optimize(level) |
| 509 | #endif |
| 510 | |
Arjan van de Ven | 9f0cf4a | 2009-09-26 14:33:01 +0200 | [diff] [blame] | 511 | /* Compile time object size, -1 for unknown */ |
| 512 | #ifndef __compiletime_object_size |
| 513 | # define __compiletime_object_size(obj) -1 |
| 514 | #endif |
Arjan van de Ven | 4a31276 | 2009-09-30 13:05:23 +0200 | [diff] [blame] | 515 | #ifndef __compiletime_warning |
| 516 | # define __compiletime_warning(message) |
| 517 | #endif |
Arjan van de Ven | 63312b6 | 2009-10-02 07:50:50 -0700 | [diff] [blame] | 518 | #ifndef __compiletime_error |
| 519 | # define __compiletime_error(message) |
James Hogan | 2c0d259 | 2014-06-04 16:11:16 -0700 | [diff] [blame] | 520 | /* |
| 521 | * Sparse complains of variable sized arrays due to the temporary variable in |
| 522 | * __compiletime_assert. Unfortunately we can't just expand it out to make |
| 523 | * sparse see a constant array size without breaking compiletime_assert on old |
| 524 | * versions of GCC (e.g. 4.2.4), so hide the array from sparse altogether. |
| 525 | */ |
| 526 | # ifndef __CHECKER__ |
| 527 | # define __compiletime_error_fallback(condition) \ |
Daniel Santos | 9a8ab1c | 2013-02-21 16:41:55 -0800 | [diff] [blame] | 528 | do { ((void)sizeof(char[1 - 2 * condition])); } while (0) |
James Hogan | 2c0d259 | 2014-06-04 16:11:16 -0700 | [diff] [blame] | 529 | # endif |
| 530 | #endif |
| 531 | #ifndef __compiletime_error_fallback |
Daniel Santos | c361d3e | 2013-02-21 16:41:54 -0800 | [diff] [blame] | 532 | # define __compiletime_error_fallback(condition) do { } while (0) |
Arjan van de Ven | 63312b6 | 2009-10-02 07:50:50 -0700 | [diff] [blame] | 533 | #endif |
Daniel Santos | c361d3e | 2013-02-21 16:41:54 -0800 | [diff] [blame] | 534 | |
Daniel Santos | 9a8ab1c | 2013-02-21 16:41:55 -0800 | [diff] [blame] | 535 | #define __compiletime_assert(condition, msg, prefix, suffix) \ |
| 536 | do { \ |
| 537 | bool __cond = !(condition); \ |
| 538 | extern void prefix ## suffix(void) __compiletime_error(msg); \ |
| 539 | if (__cond) \ |
| 540 | prefix ## suffix(); \ |
| 541 | __compiletime_error_fallback(__cond); \ |
| 542 | } while (0) |
| 543 | |
| 544 | #define _compiletime_assert(condition, msg, prefix, suffix) \ |
| 545 | __compiletime_assert(condition, msg, prefix, suffix) |
| 546 | |
| 547 | /** |
| 548 | * compiletime_assert - break build and emit msg if condition is false |
| 549 | * @condition: a compile-time constant condition to check |
| 550 | * @msg: a message to emit if condition is false |
| 551 | * |
| 552 | * In tradition of POSIX assert, this macro will break the build if the |
| 553 | * supplied condition is *false*, emitting the supplied error message if the |
| 554 | * compiler has support to do so. |
| 555 | */ |
| 556 | #define compiletime_assert(condition, msg) \ |
Vegard Nossum | 8feaf69 | 2020-04-06 20:09:37 -0700 | [diff] [blame] | 557 | _compiletime_assert(condition, msg, __compiletime_assert_, __COUNTER__) |
Daniel Santos | 9a8ab1c | 2013-02-21 16:41:55 -0800 | [diff] [blame] | 558 | |
Peter Zijlstra | 47933ad | 2013-11-06 14:57:36 +0100 | [diff] [blame] | 559 | #define compiletime_assert_atomic_type(t) \ |
| 560 | compiletime_assert(__native_word(t), \ |
| 561 | "Need native word sized stores/loads for atomicity.") |
| 562 | |
Linus Torvalds | 9c3cdc1 | 2008-05-10 19:51:16 -0700 | [diff] [blame] | 563 | /* |
| 564 | * Prevent the compiler from merging or refetching accesses. The compiler |
| 565 | * is also forbidden from reordering successive instances of ACCESS_ONCE(), |
| 566 | * but only when the compiler is aware of some particular ordering. One way |
| 567 | * to make the compiler aware of ordering is to put the two invocations of |
| 568 | * ACCESS_ONCE() in different C statements. |
| 569 | * |
Christian Borntraeger | 927609d | 2014-11-25 10:16:39 +0100 | [diff] [blame] | 570 | * ACCESS_ONCE will only work on scalar types. For union types, ACCESS_ONCE |
| 571 | * on a union member will work as long as the size of the member matches the |
| 572 | * size of the union and the size is smaller than word size. |
| 573 | * |
| 574 | * The major use cases of ACCESS_ONCE used to be (1) Mediating communication |
| 575 | * between process-level code and irq/NMI handlers, all running on the same CPU, |
| 576 | * and (2) Ensuring that the compiler does not fold, spindle, or otherwise |
| 577 | * mutilate accesses that either do not require ordering or that interact |
| 578 | * with an explicit memory barrier or atomic instruction that provides the |
| 579 | * required ordering. |
| 580 | * |
Preeti U Murthy | 663fdcb | 2015-04-30 17:27:21 +0530 | [diff] [blame] | 581 | * If possible use READ_ONCE()/WRITE_ONCE() instead. |
Linus Torvalds | 9c3cdc1 | 2008-05-10 19:51:16 -0700 | [diff] [blame] | 582 | */ |
Christian Borntraeger | 927609d | 2014-11-25 10:16:39 +0100 | [diff] [blame] | 583 | #define __ACCESS_ONCE(x) ({ \ |
Christian Borntraeger | c5b1994 | 2015-01-12 12:13:39 +0100 | [diff] [blame] | 584 | __maybe_unused typeof(x) __var = (__force typeof(x)) 0; \ |
Christian Borntraeger | 927609d | 2014-11-25 10:16:39 +0100 | [diff] [blame] | 585 | (volatile typeof(x) *)&(x); }) |
| 586 | #define ACCESS_ONCE(x) (*__ACCESS_ONCE(x)) |
Linus Torvalds | 9c3cdc1 | 2008-05-10 19:51:16 -0700 | [diff] [blame] | 587 | |
Peter Zijlstra | 0a04b01 | 2015-05-27 11:09:36 +0930 | [diff] [blame] | 588 | /** |
| 589 | * lockless_dereference() - safely load a pointer for later dereference |
| 590 | * @p: The pointer to load |
| 591 | * |
| 592 | * Similar to rcu_dereference(), but for situations where the pointed-to |
| 593 | * object's lifetime is managed by something other than RCU. That |
| 594 | * "something other" might be reference counting or simple immortality. |
Peter Zijlstra | 331b6d8 | 2016-05-22 12:48:27 +0200 | [diff] [blame] | 595 | * |
Johannes Berg | d7127b5 | 2016-08-26 08:16:00 +0200 | [diff] [blame] | 596 | * The seemingly unused variable ___typecheck_p validates that @p is |
| 597 | * indeed a pointer type by using a pointer to typeof(*p) as the type. |
| 598 | * Taking a pointer to typeof(*p) again is needed in case p is void *. |
Peter Zijlstra | 0a04b01 | 2015-05-27 11:09:36 +0930 | [diff] [blame] | 599 | */ |
| 600 | #define lockless_dereference(p) \ |
| 601 | ({ \ |
Stephen Rothwell | 38183b9 | 2015-05-28 17:20:58 +1000 | [diff] [blame] | 602 | typeof(p) _________p1 = READ_ONCE(p); \ |
Johannes Berg | d7127b5 | 2016-08-26 08:16:00 +0200 | [diff] [blame] | 603 | typeof(*(p)) *___typecheck_p __maybe_unused; \ |
Peter Zijlstra | 0a04b01 | 2015-05-27 11:09:36 +0930 | [diff] [blame] | 604 | smp_read_barrier_depends(); /* Dependency order vs. p above. */ \ |
| 605 | (_________p1); \ |
| 606 | }) |
| 607 | |
Masami Hiramatsu | 324670b | 2013-04-04 19:40:50 +0900 | [diff] [blame] | 608 | /* Ignore/forbid kprobes attach on very low level functions marked by this attribute: */ |
| 609 | #ifdef CONFIG_KPROBES |
| 610 | # define __kprobes __attribute__((__section__(".kprobes.text"))) |
Masami Hiramatsu | 376e242 | 2014-04-17 17:17:05 +0900 | [diff] [blame] | 611 | # define nokprobe_inline __always_inline |
Masami Hiramatsu | 324670b | 2013-04-04 19:40:50 +0900 | [diff] [blame] | 612 | #else |
| 613 | # define __kprobes |
Masami Hiramatsu | 376e242 | 2014-04-17 17:17:05 +0900 | [diff] [blame] | 614 | # define nokprobe_inline inline |
Masami Hiramatsu | 324670b | 2013-04-04 19:40:50 +0900 | [diff] [blame] | 615 | #endif |
Borislav Petkov | b263060 | 2020-04-22 18:11:30 +0200 | [diff] [blame] | 616 | |
| 617 | /* |
| 618 | * This is needed in functions which generate the stack canary, see |
| 619 | * arch/x86/kernel/smpboot.c::start_secondary() for an example. |
| 620 | */ |
| 621 | #define prevent_tail_call_optimization() mb() |
| 622 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 623 | #endif /* __LINUX_COMPILER_H */ |