Blame view
include/linux/compiler.h
17.3 KB
1da177e4c
|
1 2 3 4 5 6 7 |
#ifndef __LINUX_COMPILER_H #define __LINUX_COMPILER_H #ifndef __ASSEMBLY__ #ifdef __CHECKER__ # define __user __attribute__((noderef, address_space(1))) |
e0fdb0e05
|
8 |
# define __kernel __attribute__((address_space(0))) |
1da177e4c
|
9 10 11 12 |
# define __safe __attribute__((safe)) # define __force __attribute__((force)) # define __nocast __attribute__((nocast)) # define __iomem __attribute__((noderef, address_space(2))) |
8529091e8
|
13 |
# define __must_hold(x) __attribute__((context(x,1,1))) |
c902e0a01
|
14 15 16 17 |
# define __acquires(x) __attribute__((context(x,0,1))) # define __releases(x) __attribute__((context(x,1,0))) # define __acquire(x) __context__(x,1) # define __release(x) __context__(x,-1) |
dcc8e559e
|
18 |
# define __cond_lock(x,c) ((c) ? ({ __acquire(x); 1; }) : 0) |
e0fdb0e05
|
19 |
# define __percpu __attribute__((noderef, address_space(3))) |
ca5ecddfa
|
20 21 |
#ifdef CONFIG_SPARSE_RCU_POINTER # define __rcu __attribute__((noderef, address_space(4))) |
ad315455d
|
22 |
#else /* CONFIG_SPARSE_RCU_POINTER */ |
71d1d5c72
|
23 |
# define __rcu |
ad315455d
|
24 25 |
#endif /* CONFIG_SPARSE_RCU_POINTER */ # define __private __attribute__((noderef)) |
c47ffe3d3
|
26 27 |
extern void __chk_user_ptr(const volatile void __user *); extern void __chk_io_ptr(const volatile void __iomem *); |
ad315455d
|
28 29 |
# define ACCESS_PRIVATE(p, member) (*((typeof((p)->member) __force *) &(p)->member)) #else /* __CHECKER__ */ |
1da177e4c
|
30 31 32 33 34 35 36 37 38 |
# define __user # define __kernel # define __safe # define __force # define __nocast # define __iomem # define __chk_user_ptr(x) (void)0 # define __chk_io_ptr(x) (void)0 # define __builtin_warning(x, y...) (1) |
8529091e8
|
39 |
# define __must_hold(x) |
1da177e4c
|
40 41 42 43 |
# define __acquires(x) # define __releases(x) # define __acquire(x) (void)0 # define __release(x) (void)0 |
dcc8e559e
|
44 |
# define __cond_lock(x,c) (c) |
e0fdb0e05
|
45 |
# define __percpu |
71d1d5c72
|
46 |
# define __rcu |
ad315455d
|
47 48 49 |
# define __private # define ACCESS_PRIVATE(p, member) ((p)->member) #endif /* __CHECKER__ */ |
1da177e4c
|
50 |
|
6f33d5879
|
51 52 53 |
/* Indirect macros required for expanded argument pasting, eg. __LINE__. */ #define ___PASTE(a,b) a##b #define __PASTE(a,b) ___PASTE(a,b) |
1da177e4c
|
54 |
#ifdef __KERNEL__ |
f153b8212
|
55 56 |
#ifdef __GNUC__ #include <linux/compiler-gcc.h> |
1da177e4c
|
57 |
#endif |
0c5a69f43
|
58 |
#if defined(CC_USING_HOTPATCH) && !defined(__CHECKER__) |
61f552141
|
59 60 |
#define notrace __attribute__((hotpatch(0,0))) #else |
28614889b
|
61 |
#define notrace __attribute__((no_instrument_function)) |
61f552141
|
62 |
#endif |
28614889b
|
63 |
|
1da177e4c
|
64 65 66 67 68 69 |
/* Intel compiler defines __GNUC__. So we will overwrite implementations * coming from above header files here */ #ifdef __INTEL_COMPILER # include <linux/compiler-intel.h> #endif |
565cbdc2f
|
70 71 72 73 74 75 |
/* Clang compiler defines __GNUC__. So we will overwrite implementations * coming from above header files here */ #ifdef __clang__ #include <linux/compiler-clang.h> #endif |
1da177e4c
|
76 77 78 79 80 |
/* * Generic compiler-dependent macros required for kernel * build go below this comment. Actual compiler/compiler version * specific implementations come from the above header files */ |
2ed84eeb8
|
81 |
struct ftrace_branch_data { |
1f0d69a9f
|
82 83 84 |
const char *func; const char *file; unsigned line; |
2bcd521a6
|
85 86 87 88 89 90 91 92 93 |
union { struct { unsigned long correct; unsigned long incorrect; }; struct { unsigned long miss; unsigned long hit; }; |
97e7e4f39
|
94 |
unsigned long miss_hit[2]; |
2bcd521a6
|
95 |
}; |
1f0d69a9f
|
96 |
}; |
2ed84eeb8
|
97 98 99 100 101 |
/* * Note: DISABLE_BRANCH_PROFILING can be used by special lowlevel code * to disable branch tracing on a per file basis. */ |
d9ad8bc0c
|
102 103 |
#if defined(CONFIG_TRACE_BRANCH_PROFILING) \ && !defined(DISABLE_BRANCH_PROFILING) && !defined(__CHECKER__) |
2ed84eeb8
|
104 |
void ftrace_likely_update(struct ftrace_branch_data *f, int val, int expect); |
1f0d69a9f
|
105 106 107 |
#define likely_notrace(x) __builtin_expect(!!(x), 1) #define unlikely_notrace(x) __builtin_expect(!!(x), 0) |
45b797492
|
108 |
#define __branch_check__(x, expect) ({ \ |
1f0d69a9f
|
109 |
int ______r; \ |
2ed84eeb8
|
110 |
static struct ftrace_branch_data \ |
1f0d69a9f
|
111 |
__attribute__((__aligned__(4))) \ |
45b797492
|
112 |
__attribute__((section("_ftrace_annotated_branch"))) \ |
1f0d69a9f
|
113 114 115 116 117 |
______f = { \ .func = __func__, \ .file = __FILE__, \ .line = __LINE__, \ }; \ |
1f0d69a9f
|
118 |
______r = likely_notrace(x); \ |
45b797492
|
119 |
ftrace_likely_update(&______f, ______r, expect); \ |
1f0d69a9f
|
120 121 122 123 124 125 126 127 128 |
______r; \ }) /* * Using __builtin_constant_p(x) to ignore cases where the return * value is always the same. This idea is taken from a similar patch * written by Daniel Walker. */ # ifndef likely |
45b797492
|
129 |
# define likely(x) (__builtin_constant_p(x) ? !!(x) : __branch_check__(x, 1)) |
1f0d69a9f
|
130 131 |
# endif # ifndef unlikely |
45b797492
|
132 |
# define unlikely(x) (__builtin_constant_p(x) ? !!(x) : __branch_check__(x, 0)) |
1f0d69a9f
|
133 |
# endif |
2bcd521a6
|
134 135 136 137 138 139 |
#ifdef CONFIG_PROFILE_ALL_BRANCHES /* * "Define 'is'", Bill Clinton * "Define 'if'", Steven Rostedt */ |
ab3c9c686
|
140 141 |
#define if(cond, ...) __trace_if( (cond , ## __VA_ARGS__) ) #define __trace_if(cond) \ |
b33c8ff44
|
142 |
if (__builtin_constant_p(!!(cond)) ? !!(cond) : \ |
2bcd521a6
|
143 144 145 146 147 148 149 150 151 152 153 |
({ \ int ______r; \ static struct ftrace_branch_data \ __attribute__((__aligned__(4))) \ __attribute__((section("_ftrace_branch"))) \ ______f = { \ .func = __func__, \ .file = __FILE__, \ .line = __LINE__, \ }; \ ______r = !!(cond); \ |
97e7e4f39
|
154 |
______f.miss_hit[______r]++; \ |
2bcd521a6
|
155 156 157 |
______r; \ })) #endif /* CONFIG_PROFILE_ALL_BRANCHES */ |
1f0d69a9f
|
158 159 160 161 |
#else # define likely(x) __builtin_expect(!!(x), 1) # define unlikely(x) __builtin_expect(!!(x), 0) #endif |
1da177e4c
|
162 163 164 165 166 |
/* Optimization barrier */ #ifndef barrier # define barrier() __memory_barrier() #endif |
7829fb09a
|
167 168 169 |
#ifndef barrier_data # define barrier_data(ptr) barrier() #endif |
38938c879
|
170 171 172 173 |
/* Unreachable code */ #ifndef unreachable # define unreachable() do { } while (1) #endif |
b67067f11
|
174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 |
/* * KENTRY - kernel entry point * This can be used to annotate symbols (functions or data) that are used * without their linker symbol being referenced explicitly. For example, * interrupt vector handlers, or functions in the kernel image that are found * programatically. * * Not required for symbols exported with EXPORT_SYMBOL, or initcalls. Those * are handled in their own way (with KEEP() in linker scripts). * * KENTRY can be avoided if the symbols in question are marked as KEEP() in the * linker script. For example an architecture could KEEP() its entire * boot/exception vector code rather than annotate each function and data. */ #ifndef KENTRY # define KENTRY(sym) \ extern typeof(sym) sym; \ static const unsigned long __kentry_##sym \ __used \ __attribute__((section("___kentry" "+" #sym ), used)) \ = (unsigned long)&sym; #endif |
1da177e4c
|
196 197 198 199 200 201 |
#ifndef RELOC_HIDE # define RELOC_HIDE(ptr, off) \ ({ unsigned long __ptr; \ __ptr = (unsigned long) (ptr); \ (typeof(ptr)) (__ptr + (off)); }) #endif |
fe8c8a126
|
202 203 204 |
#ifndef OPTIMIZER_HIDE_VAR #define OPTIMIZER_HIDE_VAR(var) barrier() #endif |
6f33d5879
|
205 206 207 208 |
/* Not-quite-unique ID. */ #ifndef __UNIQUE_ID # define __UNIQUE_ID(prefix) __PASTE(__PASTE(__UNIQUE_ID_, prefix), __LINE__) #endif |
230fa253d
|
209 |
#include <uapi/linux/types.h> |
d976441f4
|
210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 |
#define __READ_ONCE_SIZE \ ({ \ switch (size) { \ case 1: *(__u8 *)res = *(volatile __u8 *)p; break; \ case 2: *(__u16 *)res = *(volatile __u16 *)p; break; \ case 4: *(__u32 *)res = *(volatile __u32 *)p; break; \ case 8: *(__u64 *)res = *(volatile __u64 *)p; break; \ default: \ barrier(); \ __builtin_memcpy((void *)res, (const void *)p, size); \ barrier(); \ } \ }) static __always_inline void __read_once_size(const volatile void *p, void *res, int size) |
230fa253d
|
226 |
{ |
d976441f4
|
227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 |
__READ_ONCE_SIZE; } #ifdef CONFIG_KASAN /* * This function is not 'inline' because __no_sanitize_address confilcts * with inlining. Attempt to inline it may cause a build failure. * https://gcc.gnu.org/bugzilla/show_bug.cgi?id=67368 * '__maybe_unused' allows us to avoid defined-but-not-used warnings. */ static __no_sanitize_address __maybe_unused void __read_once_size_nocheck(const volatile void *p, void *res, int size) { __READ_ONCE_SIZE; } #else static __always_inline void __read_once_size_nocheck(const volatile void *p, void *res, int size) { __READ_ONCE_SIZE; |
230fa253d
|
247 |
} |
d976441f4
|
248 |
#endif |
230fa253d
|
249 |
|
43239cbe7
|
250 |
static __always_inline void __write_once_size(volatile void *p, void *res, int size) |
230fa253d
|
251 252 253 254 255 |
{ switch (size) { case 1: *(volatile __u8 *)p = *(__u8 *)res; break; case 2: *(volatile __u16 *)p = *(__u16 *)res; break; case 4: *(volatile __u32 *)p = *(__u32 *)res; break; |
230fa253d
|
256 |
case 8: *(volatile __u64 *)p = *(__u64 *)res; break; |
230fa253d
|
257 258 259 |
default: barrier(); __builtin_memcpy((void *)p, (const void *)res, size); |
230fa253d
|
260 261 262 263 264 265 266 |
barrier(); } } /* * Prevent the compiler from merging or refetching reads or writes. The * compiler is also forbidden from reordering successive instances of |
43239cbe7
|
267 |
* READ_ONCE, WRITE_ONCE and ACCESS_ONCE (see below), but only when the |
230fa253d
|
268 269 |
* compiler is aware of some particular ordering. One way to make the * compiler aware of ordering is to put the two invocations of READ_ONCE, |
43239cbe7
|
270 |
* WRITE_ONCE or ACCESS_ONCE() in different C statements. |
230fa253d
|
271 272 273 274 |
* * In contrast to ACCESS_ONCE these two macros will also work on aggregate * data types like structs or unions. If the size of the accessed data * type exceeds the word size of the machine (e.g., 32 bits or 64 bits) |
fed0764fa
|
275 276 277 |
* READ_ONCE() and WRITE_ONCE() will fall back to memcpy(). There's at * least two memcpy()s: one for the __builtin_memcpy() and then one for * the macro doing the copy of variable - '__u' allocated on the stack. |
230fa253d
|
278 279 280 281 282 283 284 285 |
* * Their two major use cases are: (1) Mediating communication between * process-level code and irq/NMI handlers, all running on the same CPU, * and (2) Ensuring that the compiler does not fold, spindle, or otherwise * mutilate accesses that either do not require ordering or that interact * with an explicit memory barrier or atomic instruction that provides the * required ordering. */ |
d976441f4
|
286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 |
#define __READ_ONCE(x, check) \ ({ \ union { typeof(x) __val; char __c[1]; } __u; \ if (check) \ __read_once_size(&(x), __u.__c, sizeof(x)); \ else \ __read_once_size_nocheck(&(x), __u.__c, sizeof(x)); \ __u.__val; \ }) #define READ_ONCE(x) __READ_ONCE(x, 1) /* * Use READ_ONCE_NOCHECK() instead of READ_ONCE() if you need * to hide memory access from KASAN. */ #define READ_ONCE_NOCHECK(x) __READ_ONCE(x, 0) |
230fa253d
|
302 |
|
43239cbe7
|
303 |
#define WRITE_ONCE(x, val) \ |
ba33034ff
|
304 305 306 307 308 309 |
({ \ union { typeof(x) __val; char __c[1]; } __u = \ { .__val = (__force typeof(x)) (val) }; \ __write_once_size(&(x), __u.__c, sizeof(x)); \ __u.__val; \ }) |
230fa253d
|
310 |
|
1da177e4c
|
311 312 313 |
#endif /* __KERNEL__ */ #endif /* __ASSEMBLY__ */ |
4f79c3ffc
|
314 |
#ifdef __KERNEL__ |
1da177e4c
|
315 316 317 318 319 320 321 322 323 |
/* * Allow us to mark functions as 'deprecated' and have gcc emit a nice * warning for each use, in hopes of speeding the functions removal. * Usage is: * int __deprecated foo(void) */ #ifndef __deprecated # define __deprecated /* unimplemented */ #endif |
512345be2
|
324 325 326 327 328 |
#ifdef MODULE #define __deprecated_for_modules __deprecated #else #define __deprecated_for_modules #endif |
1da177e4c
|
329 330 331 |
#ifndef __must_check #define __must_check #endif |
cebc04ba9
|
332 333 334 335 |
#ifndef CONFIG_ENABLE_MUST_CHECK #undef __must_check #define __must_check #endif |
de4884439
|
336 337 338 339 340 341 |
#ifndef CONFIG_ENABLE_WARN_DEPRECATED #undef __deprecated #undef __deprecated_for_modules #define __deprecated #define __deprecated_for_modules #endif |
cebc04ba9
|
342 |
|
d64e85d3e
|
343 344 345 |
#ifndef __malloc #define __malloc #endif |
1da177e4c
|
346 347 348 349 |
/* * Allow us to avoid 'defined but not used' warnings on functions and data, * as well as force them to be emitted to the assembly file. * |
0d7ebbbc6
|
350 351 |
* As of gcc 3.4, static functions that are not marked with attribute((used)) * may be elided from the assembly file. As of gcc 3.4, static data not so |
1da177e4c
|
352 353 |
* marked will not be elided, but this may change in a future gcc version. * |
0d7ebbbc6
|
354 355 356 357 |
* NOTE: Because distributions shipped with a backported unit-at-a-time * compiler in gcc 3.3, we must define __used to be __attribute__((used)) * for gcc >=3.3 instead of 3.4. * |
1da177e4c
|
358 359 |
* In prior versions of gcc, such functions and data would be emitted, but * would be warned about except with attribute((unused)). |
0d7ebbbc6
|
360 361 362 |
* * Mark functions that are referenced only in inline assembly as __used so * the code is emitted even though it appears to be unreferenced. |
1da177e4c
|
363 |
*/ |
0d7ebbbc6
|
364 365 366 367 368 369 |
#ifndef __used # define __used /* unimplemented */ #endif #ifndef __maybe_unused # define __maybe_unused /* unimplemented */ |
1da177e4c
|
370 |
#endif |
7b2a35132
|
371 372 373 |
#ifndef __always_unused # define __always_unused /* unimplemented */ #endif |
423bc7b22
|
374 375 376 |
#ifndef noinline #define noinline #endif |
735c4fb91
|
377 378 |
/* * Rather then using noinline to prevent stack consumption, use |
e6be0c9e7
|
379 |
* noinline_for_stack instead. For documentation reasons. |
735c4fb91
|
380 381 |
*/ #define noinline_for_stack noinline |
423bc7b22
|
382 383 384 385 386 |
#ifndef __always_inline #define __always_inline inline #endif #endif /* __KERNEL__ */ |
1da177e4c
|
387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 |
/* * From the GCC manual: * * Many functions do not examine any values except their arguments, * and have no effects except the return value. Basically this is * just slightly more strict class than the `pure' attribute above, * since function is not allowed to read global memory. * * Note that a function that has pointer arguments and examines the * data pointed to must _not_ be declared `const'. Likewise, a * function that calls a non-`const' function usually must not be * `const'. It does not make sense for a `const' function to return * `void'. */ #ifndef __attribute_const__ # define __attribute_const__ /* unimplemented */ #endif |
0766f788e
|
404 405 406 |
#ifndef __latent_entropy # define __latent_entropy #endif |
a586df067
|
407 408 409 410 411 412 413 414 |
/* * Tell gcc if a function is cold. The compiler will assume any path * directly leading to the call is unlikely. */ #ifndef __cold #define __cold #endif |
f3fe866d5
|
415 416 417 418 |
/* Simple shorthand for a section definition */ #ifndef __section # define __section(S) __attribute__ ((__section__(#S))) #endif |
9a858dc7c
|
419 420 421 |
#ifndef __visible #define __visible #endif |
a744fd17b
|
422 423 424 425 426 427 |
/* * Assume alignment of return value. */ #ifndef __assume_aligned #define __assume_aligned(a, ...) #endif |
d2c123c27
|
428 429 430 431 |
/* Are two types/vars the same type (ignoring qualifiers)? */ #ifndef __same_type # define __same_type(a, b) __builtin_types_compatible_p(typeof(a), typeof(b)) #endif |
47933ad41
|
432 433 |
/* Is this type a native word size -- useful for atomic operations */ #ifndef __native_word |
536fa4022
|
434 |
# define __native_word(t) (sizeof(t) == sizeof(char) || sizeof(t) == sizeof(short) || sizeof(t) == sizeof(int) || sizeof(t) == sizeof(long)) |
47933ad41
|
435 |
#endif |
9f0cf4adb
|
436 437 438 439 |
/* Compile time object size, -1 for unknown */ #ifndef __compiletime_object_size # define __compiletime_object_size(obj) -1 #endif |
4a3127693
|
440 441 442 |
#ifndef __compiletime_warning # define __compiletime_warning(message) #endif |
63312b6a6
|
443 444 |
#ifndef __compiletime_error # define __compiletime_error(message) |
2c0d259e0
|
445 446 447 448 449 450 451 452 |
/* * Sparse complains of variable sized arrays due to the temporary variable in * __compiletime_assert. Unfortunately we can't just expand it out to make * sparse see a constant array size without breaking compiletime_assert on old * versions of GCC (e.g. 4.2.4), so hide the array from sparse altogether. */ # ifndef __CHECKER__ # define __compiletime_error_fallback(condition) \ |
9a8ab1c39
|
453 |
do { ((void)sizeof(char[1 - 2 * condition])); } while (0) |
2c0d259e0
|
454 455 456 |
# endif #endif #ifndef __compiletime_error_fallback |
c361d3e54
|
457 |
# define __compiletime_error_fallback(condition) do { } while (0) |
63312b6a6
|
458 |
#endif |
c361d3e54
|
459 |
|
9a8ab1c39
|
460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 |
#define __compiletime_assert(condition, msg, prefix, suffix) \ do { \ bool __cond = !(condition); \ extern void prefix ## suffix(void) __compiletime_error(msg); \ if (__cond) \ prefix ## suffix(); \ __compiletime_error_fallback(__cond); \ } while (0) #define _compiletime_assert(condition, msg, prefix, suffix) \ __compiletime_assert(condition, msg, prefix, suffix) /** * compiletime_assert - break build and emit msg if condition is false * @condition: a compile-time constant condition to check * @msg: a message to emit if condition is false * * In tradition of POSIX assert, this macro will break the build if the * supplied condition is *false*, emitting the supplied error message if the * compiler has support to do so. */ #define compiletime_assert(condition, msg) \ _compiletime_assert(condition, msg, __compiletime_assert_, __LINE__) |
47933ad41
|
483 484 485 |
#define compiletime_assert_atomic_type(t) \ compiletime_assert(__native_word(t), \ "Need native word sized stores/loads for atomicity.") |
9c3cdc1f8
|
486 487 488 489 490 491 492 |
/* * Prevent the compiler from merging or refetching accesses. The compiler * is also forbidden from reordering successive instances of ACCESS_ONCE(), * but only when the compiler is aware of some particular ordering. One way * to make the compiler aware of ordering is to put the two invocations of * ACCESS_ONCE() in different C statements. * |
927609d62
|
493 494 495 496 497 498 499 500 501 502 503 |
* ACCESS_ONCE will only work on scalar types. For union types, ACCESS_ONCE * on a union member will work as long as the size of the member matches the * size of the union and the size is smaller than word size. * * The major use cases of ACCESS_ONCE used to be (1) Mediating communication * between process-level code and irq/NMI handlers, all running on the same CPU, * and (2) Ensuring that the compiler does not fold, spindle, or otherwise * mutilate accesses that either do not require ordering or that interact * with an explicit memory barrier or atomic instruction that provides the * required ordering. * |
663fdcbee
|
504 |
* If possible use READ_ONCE()/WRITE_ONCE() instead. |
9c3cdc1f8
|
505 |
*/ |
927609d62
|
506 |
#define __ACCESS_ONCE(x) ({ \ |
c5b19946e
|
507 |
__maybe_unused typeof(x) __var = (__force typeof(x)) 0; \ |
927609d62
|
508 509 |
(volatile typeof(x) *)&(x); }) #define ACCESS_ONCE(x) (*__ACCESS_ONCE(x)) |
9c3cdc1f8
|
510 |
|
0a04b0166
|
511 512 513 514 515 516 517 |
/** * lockless_dereference() - safely load a pointer for later dereference * @p: The pointer to load * * Similar to rcu_dereference(), but for situations where the pointed-to * object's lifetime is managed by something other than RCU. That * "something other" might be reference counting or simple immortality. |
331b6d8c7
|
518 |
* |
d7127b5e5
|
519 520 521 |
* The seemingly unused variable ___typecheck_p validates that @p is * indeed a pointer type by using a pointer to typeof(*p) as the type. * Taking a pointer to typeof(*p) again is needed in case p is void *. |
0a04b0166
|
522 523 524 |
*/ #define lockless_dereference(p) \ ({ \ |
38183b9c3
|
525 |
typeof(p) _________p1 = READ_ONCE(p); \ |
d7127b5e5
|
526 |
typeof(*(p)) *___typecheck_p __maybe_unused; \ |
0a04b0166
|
527 528 529 |
smp_read_barrier_depends(); /* Dependency order vs. p above. */ \ (_________p1); \ }) |
324670b62
|
530 531 532 |
/* Ignore/forbid kprobes attach on very low level functions marked by this attribute: */ #ifdef CONFIG_KPROBES # define __kprobes __attribute__((__section__(".kprobes.text"))) |
376e24242
|
533 |
# define nokprobe_inline __always_inline |
324670b62
|
534 535 |
#else # define __kprobes |
376e24242
|
536 |
# define nokprobe_inline inline |
324670b62
|
537 |
#endif |
1da177e4c
|
538 |
#endif /* __LINUX_COMPILER_H */ |