compiler.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464
  1. #ifndef __LINUX_COMPILER_H
  2. #define __LINUX_COMPILER_H
  3. #ifndef __ASSEMBLY__
  4. #ifdef __CHECKER__
  5. # define __user __attribute__((noderef, address_space(1)))
  6. # define __kernel __attribute__((address_space(0)))
  7. # define __safe __attribute__((safe))
  8. # define __force __attribute__((force))
  9. # define __nocast __attribute__((nocast))
  10. # define __iomem __attribute__((noderef, address_space(2)))
  11. # define __must_hold(x) __attribute__((context(x,1,1)))
  12. # define __acquires(x) __attribute__((context(x,0,1)))
  13. # define __releases(x) __attribute__((context(x,1,0)))
  14. # define __acquire(x) __context__(x,1)
  15. # define __release(x) __context__(x,-1)
  16. # define __cond_lock(x,c) ((c) ? ({ __acquire(x); 1; }) : 0)
  17. # define __percpu __attribute__((noderef, address_space(3)))
  18. #ifdef CONFIG_SPARSE_RCU_POINTER
  19. # define __rcu __attribute__((noderef, address_space(4)))
  20. #else
  21. # define __rcu
  22. #endif
  23. extern void __chk_user_ptr(const volatile void __user *);
  24. extern void __chk_io_ptr(const volatile void __iomem *);
  25. #else
  26. # define __user
  27. # define __kernel
  28. # define __safe
  29. # define __force
  30. # define __nocast
  31. # define __iomem
  32. # define __chk_user_ptr(x) (void)0
  33. # define __chk_io_ptr(x) (void)0
  34. # define __builtin_warning(x, y...) (1)
  35. # define __must_hold(x)
  36. # define __acquires(x)
  37. # define __releases(x)
  38. # define __acquire(x) (void)0
  39. # define __release(x) (void)0
  40. # define __cond_lock(x,c) (c)
  41. # define __percpu
  42. # define __rcu
  43. #endif
  44. /* Indirect macros required for expanded argument pasting, eg. __LINE__. */
  45. #define ___PASTE(a,b) a##b
  46. #define __PASTE(a,b) ___PASTE(a,b)
  47. #ifdef __KERNEL__
  48. #ifdef __GNUC__
  49. #include <linux/compiler-gcc.h>
  50. #endif
  51. #ifdef CC_USING_HOTPATCH
  52. #define notrace __attribute__((hotpatch(0,0)))
  53. #else
  54. #define notrace __attribute__((no_instrument_function))
  55. #endif
  56. /* Intel compiler defines __GNUC__. So we will overwrite implementations
  57. * coming from above header files here
  58. */
  59. #ifdef __INTEL_COMPILER
  60. # include <linux/compiler-intel.h>
  61. #endif
  62. /* Clang compiler defines __GNUC__. So we will overwrite implementations
  63. * coming from above header files here
  64. */
  65. #ifdef __clang__
  66. #include <linux/compiler-clang.h>
  67. #endif
  68. /*
  69. * Generic compiler-dependent macros required for kernel
  70. * build go below this comment. Actual compiler/compiler version
  71. * specific implementations come from the above header files
  72. */
  73. struct ftrace_branch_data {
  74. const char *func;
  75. const char *file;
  76. unsigned line;
  77. union {
  78. struct {
  79. unsigned long correct;
  80. unsigned long incorrect;
  81. };
  82. struct {
  83. unsigned long miss;
  84. unsigned long hit;
  85. };
  86. unsigned long miss_hit[2];
  87. };
  88. };
  89. /*
  90. * Note: DISABLE_BRANCH_PROFILING can be used by special lowlevel code
  91. * to disable branch tracing on a per file basis.
  92. */
  93. #if defined(CONFIG_TRACE_BRANCH_PROFILING) \
  94. && !defined(DISABLE_BRANCH_PROFILING) && !defined(__CHECKER__)
  95. void ftrace_likely_update(struct ftrace_branch_data *f, int val, int expect);
  96. #define likely_notrace(x) __builtin_expect(!!(x), 1)
  97. #define unlikely_notrace(x) __builtin_expect(!!(x), 0)
  98. #define __branch_check__(x, expect) ({ \
  99. int ______r; \
  100. static struct ftrace_branch_data \
  101. __attribute__((__aligned__(4))) \
  102. __attribute__((section("_ftrace_annotated_branch"))) \
  103. ______f = { \
  104. .func = __func__, \
  105. .file = __FILE__, \
  106. .line = __LINE__, \
  107. }; \
  108. ______r = likely_notrace(x); \
  109. ftrace_likely_update(&______f, ______r, expect); \
  110. ______r; \
  111. })
  112. /*
  113. * Using __builtin_constant_p(x) to ignore cases where the return
  114. * value is always the same. This idea is taken from a similar patch
  115. * written by Daniel Walker.
  116. */
  117. # ifndef likely
  118. # define likely(x) (__builtin_constant_p(x) ? !!(x) : __branch_check__(x, 1))
  119. # endif
  120. # ifndef unlikely
  121. # define unlikely(x) (__builtin_constant_p(x) ? !!(x) : __branch_check__(x, 0))
  122. # endif
  123. #ifdef CONFIG_PROFILE_ALL_BRANCHES
  124. /*
  125. * "Define 'is'", Bill Clinton
  126. * "Define 'if'", Steven Rostedt
  127. */
  128. #define if(cond, ...) __trace_if( (cond , ## __VA_ARGS__) )
  129. #define __trace_if(cond) \
  130. if (__builtin_constant_p((cond)) ? !!(cond) : \
  131. ({ \
  132. int ______r; \
  133. static struct ftrace_branch_data \
  134. __attribute__((__aligned__(4))) \
  135. __attribute__((section("_ftrace_branch"))) \
  136. ______f = { \
  137. .func = __func__, \
  138. .file = __FILE__, \
  139. .line = __LINE__, \
  140. }; \
  141. ______r = !!(cond); \
  142. ______f.miss_hit[______r]++; \
  143. ______r; \
  144. }))
  145. #endif /* CONFIG_PROFILE_ALL_BRANCHES */
  146. #else
  147. # define likely(x) __builtin_expect(!!(x), 1)
  148. # define unlikely(x) __builtin_expect(!!(x), 0)
  149. #endif
  150. /* Optimization barrier */
  151. #ifndef barrier
  152. # define barrier() __memory_barrier()
  153. #endif
  154. /* Unreachable code */
  155. #ifndef unreachable
  156. # define unreachable() do { } while (1)
  157. #endif
  158. #ifndef RELOC_HIDE
  159. # define RELOC_HIDE(ptr, off) \
  160. ({ unsigned long __ptr; \
  161. __ptr = (unsigned long) (ptr); \
  162. (typeof(ptr)) (__ptr + (off)); })
  163. #endif
  164. #ifndef OPTIMIZER_HIDE_VAR
  165. #define OPTIMIZER_HIDE_VAR(var) barrier()
  166. #endif
  167. /* Not-quite-unique ID. */
  168. #ifndef __UNIQUE_ID
  169. # define __UNIQUE_ID(prefix) __PASTE(__PASTE(__UNIQUE_ID_, prefix), __LINE__)
  170. #endif
  171. #include <uapi/linux/types.h>
  172. static __always_inline void __read_once_size(const volatile void *p, void *res, int size)
  173. {
  174. switch (size) {
  175. case 1: *(__u8 *)res = *(volatile __u8 *)p; break;
  176. case 2: *(__u16 *)res = *(volatile __u16 *)p; break;
  177. case 4: *(__u32 *)res = *(volatile __u32 *)p; break;
  178. case 8: *(__u64 *)res = *(volatile __u64 *)p; break;
  179. default:
  180. barrier();
  181. __builtin_memcpy((void *)res, (const void *)p, size);
  182. barrier();
  183. }
  184. }
  185. static __always_inline void __write_once_size(volatile void *p, void *res, int size)
  186. {
  187. switch (size) {
  188. case 1: *(volatile __u8 *)p = *(__u8 *)res; break;
  189. case 2: *(volatile __u16 *)p = *(__u16 *)res; break;
  190. case 4: *(volatile __u32 *)p = *(__u32 *)res; break;
  191. case 8: *(volatile __u64 *)p = *(__u64 *)res; break;
  192. default:
  193. barrier();
  194. __builtin_memcpy((void *)p, (const void *)res, size);
  195. barrier();
  196. }
  197. }
  198. /*
  199. * Prevent the compiler from merging or refetching reads or writes. The
  200. * compiler is also forbidden from reordering successive instances of
  201. * READ_ONCE, WRITE_ONCE and ACCESS_ONCE (see below), but only when the
  202. * compiler is aware of some particular ordering. One way to make the
  203. * compiler aware of ordering is to put the two invocations of READ_ONCE,
  204. * WRITE_ONCE or ACCESS_ONCE() in different C statements.
  205. *
  206. * In contrast to ACCESS_ONCE these two macros will also work on aggregate
  207. * data types like structs or unions. If the size of the accessed data
  208. * type exceeds the word size of the machine (e.g., 32 bits or 64 bits)
  209. * READ_ONCE() and WRITE_ONCE() will fall back to memcpy and print a
  210. * compile-time warning.
  211. *
  212. * Their two major use cases are: (1) Mediating communication between
  213. * process-level code and irq/NMI handlers, all running on the same CPU,
  214. * and (2) Ensuring that the compiler does not fold, spindle, or otherwise
  215. * mutilate accesses that either do not require ordering or that interact
  216. * with an explicit memory barrier or atomic instruction that provides the
  217. * required ordering.
  218. */
  219. #define READ_ONCE(x) \
  220. ({ union { typeof(x) __val; char __c[1]; } __u; __read_once_size(&(x), __u.__c, sizeof(x)); __u.__val; })
  221. #define WRITE_ONCE(x, val) \
  222. ({ typeof(x) __val = (val); __write_once_size(&(x), &__val, sizeof(__val)); __val; })
  223. #endif /* __KERNEL__ */
  224. #endif /* __ASSEMBLY__ */
  225. #ifdef __KERNEL__
  226. /*
  227. * Allow us to mark functions as 'deprecated' and have gcc emit a nice
  228. * warning for each use, in hopes of speeding the functions removal.
  229. * Usage is:
  230. * int __deprecated foo(void)
  231. */
  232. #ifndef __deprecated
  233. # define __deprecated /* unimplemented */
  234. #endif
  235. #ifdef MODULE
  236. #define __deprecated_for_modules __deprecated
  237. #else
  238. #define __deprecated_for_modules
  239. #endif
  240. #ifndef __must_check
  241. #define __must_check
  242. #endif
  243. #ifndef CONFIG_ENABLE_MUST_CHECK
  244. #undef __must_check
  245. #define __must_check
  246. #endif
  247. #ifndef CONFIG_ENABLE_WARN_DEPRECATED
  248. #undef __deprecated
  249. #undef __deprecated_for_modules
  250. #define __deprecated
  251. #define __deprecated_for_modules
  252. #endif
  253. /*
  254. * Allow us to avoid 'defined but not used' warnings on functions and data,
  255. * as well as force them to be emitted to the assembly file.
  256. *
  257. * As of gcc 3.4, static functions that are not marked with attribute((used))
  258. * may be elided from the assembly file. As of gcc 3.4, static data not so
  259. * marked will not be elided, but this may change in a future gcc version.
  260. *
  261. * NOTE: Because distributions shipped with a backported unit-at-a-time
  262. * compiler in gcc 3.3, we must define __used to be __attribute__((used))
  263. * for gcc >=3.3 instead of 3.4.
  264. *
  265. * In prior versions of gcc, such functions and data would be emitted, but
  266. * would be warned about except with attribute((unused)).
  267. *
  268. * Mark functions that are referenced only in inline assembly as __used so
  269. * the code is emitted even though it appears to be unreferenced.
  270. */
  271. #ifndef __used
  272. # define __used /* unimplemented */
  273. #endif
  274. #ifndef __maybe_unused
  275. # define __maybe_unused /* unimplemented */
  276. #endif
  277. #ifndef __always_unused
  278. # define __always_unused /* unimplemented */
  279. #endif
  280. #ifndef noinline
  281. #define noinline
  282. #endif
  283. /*
  284. * Rather then using noinline to prevent stack consumption, use
  285. * noinline_for_stack instead. For documentation reasons.
  286. */
  287. #define noinline_for_stack noinline
  288. #ifndef __always_inline
  289. #define __always_inline inline
  290. #endif
  291. #endif /* __KERNEL__ */
  292. /*
  293. * From the GCC manual:
  294. *
  295. * Many functions do not examine any values except their arguments,
  296. * and have no effects except the return value. Basically this is
  297. * just slightly more strict class than the `pure' attribute above,
  298. * since function is not allowed to read global memory.
  299. *
  300. * Note that a function that has pointer arguments and examines the
  301. * data pointed to must _not_ be declared `const'. Likewise, a
  302. * function that calls a non-`const' function usually must not be
  303. * `const'. It does not make sense for a `const' function to return
  304. * `void'.
  305. */
  306. #ifndef __attribute_const__
  307. # define __attribute_const__ /* unimplemented */
  308. #endif
  309. /*
  310. * Tell gcc if a function is cold. The compiler will assume any path
  311. * directly leading to the call is unlikely.
  312. */
  313. #ifndef __cold
  314. #define __cold
  315. #endif
  316. /* Simple shorthand for a section definition */
  317. #ifndef __section
  318. # define __section(S) __attribute__ ((__section__(#S)))
  319. #endif
  320. #ifndef __visible
  321. #define __visible
  322. #endif
  323. /* Are two types/vars the same type (ignoring qualifiers)? */
  324. #ifndef __same_type
  325. # define __same_type(a, b) __builtin_types_compatible_p(typeof(a), typeof(b))
  326. #endif
  327. /* Is this type a native word size -- useful for atomic operations */
  328. #ifndef __native_word
  329. # define __native_word(t) (sizeof(t) == sizeof(char) || sizeof(t) == sizeof(short) || sizeof(t) == sizeof(int) || sizeof(t) == sizeof(long))
  330. #endif
  331. /* Compile time object size, -1 for unknown */
  332. #ifndef __compiletime_object_size
  333. # define __compiletime_object_size(obj) -1
  334. #endif
  335. #ifndef __compiletime_warning
  336. # define __compiletime_warning(message)
  337. #endif
  338. #ifndef __compiletime_error
  339. # define __compiletime_error(message)
  340. /*
  341. * Sparse complains of variable sized arrays due to the temporary variable in
  342. * __compiletime_assert. Unfortunately we can't just expand it out to make
  343. * sparse see a constant array size without breaking compiletime_assert on old
  344. * versions of GCC (e.g. 4.2.4), so hide the array from sparse altogether.
  345. */
  346. # ifndef __CHECKER__
  347. # define __compiletime_error_fallback(condition) \
  348. do { ((void)sizeof(char[1 - 2 * condition])); } while (0)
  349. # endif
  350. #endif
  351. #ifndef __compiletime_error_fallback
  352. # define __compiletime_error_fallback(condition) do { } while (0)
  353. #endif
  354. #define __compiletime_assert(condition, msg, prefix, suffix) \
  355. do { \
  356. bool __cond = !(condition); \
  357. extern void prefix ## suffix(void) __compiletime_error(msg); \
  358. if (__cond) \
  359. prefix ## suffix(); \
  360. __compiletime_error_fallback(__cond); \
  361. } while (0)
  362. #define _compiletime_assert(condition, msg, prefix, suffix) \
  363. __compiletime_assert(condition, msg, prefix, suffix)
  364. /**
  365. * compiletime_assert - break build and emit msg if condition is false
  366. * @condition: a compile-time constant condition to check
  367. * @msg: a message to emit if condition is false
  368. *
  369. * In tradition of POSIX assert, this macro will break the build if the
  370. * supplied condition is *false*, emitting the supplied error message if the
  371. * compiler has support to do so.
  372. */
  373. #define compiletime_assert(condition, msg) \
  374. _compiletime_assert(condition, msg, __compiletime_assert_, __LINE__)
  375. #define compiletime_assert_atomic_type(t) \
  376. compiletime_assert(__native_word(t), \
  377. "Need native word sized stores/loads for atomicity.")
  378. /*
  379. * Prevent the compiler from merging or refetching accesses. The compiler
  380. * is also forbidden from reordering successive instances of ACCESS_ONCE(),
  381. * but only when the compiler is aware of some particular ordering. One way
  382. * to make the compiler aware of ordering is to put the two invocations of
  383. * ACCESS_ONCE() in different C statements.
  384. *
  385. * ACCESS_ONCE will only work on scalar types. For union types, ACCESS_ONCE
  386. * on a union member will work as long as the size of the member matches the
  387. * size of the union and the size is smaller than word size.
  388. *
  389. * The major use cases of ACCESS_ONCE used to be (1) Mediating communication
  390. * between process-level code and irq/NMI handlers, all running on the same CPU,
  391. * and (2) Ensuring that the compiler does not fold, spindle, or otherwise
  392. * mutilate accesses that either do not require ordering or that interact
  393. * with an explicit memory barrier or atomic instruction that provides the
  394. * required ordering.
  395. *
  396. * If possible use READ_ONCE/ASSIGN_ONCE instead.
  397. */
  398. #define __ACCESS_ONCE(x) ({ \
  399. __maybe_unused typeof(x) __var = (__force typeof(x)) 0; \
  400. (volatile typeof(x) *)&(x); })
  401. #define ACCESS_ONCE(x) (*__ACCESS_ONCE(x))
  402. /* Ignore/forbid kprobes attach on very low level functions marked by this attribute: */
  403. #ifdef CONFIG_KPROBES
  404. # define __kprobes __attribute__((__section__(".kprobes.text")))
  405. # define nokprobe_inline __always_inline
  406. #else
  407. # define __kprobes
  408. # define nokprobe_inline inline
  409. #endif
  410. #endif /* __LINUX_COMPILER_H */