compiler.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336
  1. /* SPDX-License-Identifier: GPL-2.0 */
  2. #ifndef __LINUX_COMPILER_H
  3. #define __LINUX_COMPILER_H
  4. #include <linux/compiler_types.h>
  5. #ifndef __ASSEMBLY__
  6. #ifdef __KERNEL__
  7. /*
  8. * Note: DISABLE_BRANCH_PROFILING can be used by special lowlevel code
  9. * to disable branch tracing on a per file basis.
  10. */
  11. #if defined(CONFIG_TRACE_BRANCH_PROFILING) \
  12. && !defined(DISABLE_BRANCH_PROFILING) && !defined(__CHECKER__)
  13. void ftrace_likely_update(struct ftrace_likely_data *f, int val,
  14. int expect, int is_constant);
  15. #define likely_notrace(x) __builtin_expect(!!(x), 1)
  16. #define unlikely_notrace(x) __builtin_expect(!!(x), 0)
  17. #define __branch_check__(x, expect, is_constant) ({ \
  18. int ______r; \
  19. static struct ftrace_likely_data \
  20. __attribute__((__aligned__(4))) \
  21. __attribute__((section("_ftrace_annotated_branch"))) \
  22. ______f = { \
  23. .data.func = __func__, \
  24. .data.file = __FILE__, \
  25. .data.line = __LINE__, \
  26. }; \
  27. ______r = __builtin_expect(!!(x), expect); \
  28. ftrace_likely_update(&______f, ______r, \
  29. expect, is_constant); \
  30. ______r; \
  31. })
  32. /*
  33. * Using __builtin_constant_p(x) to ignore cases where the return
  34. * value is always the same. This idea is taken from a similar patch
  35. * written by Daniel Walker.
  36. */
  37. # ifndef likely
  38. # define likely(x) (__branch_check__(x, 1, __builtin_constant_p(x)))
  39. # endif
  40. # ifndef unlikely
  41. # define unlikely(x) (__branch_check__(x, 0, __builtin_constant_p(x)))
  42. # endif
  43. #ifdef CONFIG_PROFILE_ALL_BRANCHES
  44. /*
  45. * "Define 'is'", Bill Clinton
  46. * "Define 'if'", Steven Rostedt
  47. */
  48. #define if(cond, ...) __trace_if( (cond , ## __VA_ARGS__) )
  49. #define __trace_if(cond) \
  50. if (__builtin_constant_p(!!(cond)) ? !!(cond) : \
  51. ({ \
  52. int ______r; \
  53. static struct ftrace_branch_data \
  54. __attribute__((__aligned__(4))) \
  55. __attribute__((section("_ftrace_branch"))) \
  56. ______f = { \
  57. .func = __func__, \
  58. .file = __FILE__, \
  59. .line = __LINE__, \
  60. }; \
  61. ______r = !!(cond); \
  62. ______f.miss_hit[______r]++; \
  63. ______r; \
  64. }))
  65. #endif /* CONFIG_PROFILE_ALL_BRANCHES */
  66. #else
  67. # define likely(x) __builtin_expect(!!(x), 1)
  68. # define unlikely(x) __builtin_expect(!!(x), 0)
  69. #endif
  70. /* Optimization barrier */
  71. #ifndef barrier
  72. # define barrier() __memory_barrier()
  73. #endif
  74. #ifndef barrier_data
  75. # define barrier_data(ptr) barrier()
  76. #endif
  77. /* Unreachable code */
  78. #ifdef CONFIG_STACK_VALIDATION
  79. /*
  80. * These macros help objtool understand GCC code flow for unreachable code.
  81. * The __COUNTER__ based labels are a hack to make each instance of the macros
  82. * unique, to convince GCC not to merge duplicate inline asm statements.
  83. */
  84. #define annotate_reachable() ({ \
  85. asm volatile("%c0:\n\t" \
  86. ".pushsection .discard.reachable\n\t" \
  87. ".long %c0b - .\n\t" \
  88. ".popsection\n\t" : : "i" (__COUNTER__)); \
  89. })
  90. #define annotate_unreachable() ({ \
  91. asm volatile("%c0:\n\t" \
  92. ".pushsection .discard.unreachable\n\t" \
  93. ".long %c0b - .\n\t" \
  94. ".popsection\n\t" : : "i" (__COUNTER__)); \
  95. })
  96. #define ASM_UNREACHABLE \
  97. "999:\n\t" \
  98. ".pushsection .discard.unreachable\n\t" \
  99. ".long 999b - .\n\t" \
  100. ".popsection\n\t"
  101. #else
  102. #define annotate_reachable()
  103. #define annotate_unreachable()
  104. #endif
  105. #ifndef ASM_UNREACHABLE
  106. # define ASM_UNREACHABLE
  107. #endif
  108. #ifndef unreachable
  109. # define unreachable() do { annotate_reachable(); do { } while (1); } while (0)
  110. #endif
  111. /*
  112. * KENTRY - kernel entry point
  113. * This can be used to annotate symbols (functions or data) that are used
  114. * without their linker symbol being referenced explicitly. For example,
  115. * interrupt vector handlers, or functions in the kernel image that are found
  116. * programatically.
  117. *
  118. * Not required for symbols exported with EXPORT_SYMBOL, or initcalls. Those
  119. * are handled in their own way (with KEEP() in linker scripts).
  120. *
  121. * KENTRY can be avoided if the symbols in question are marked as KEEP() in the
  122. * linker script. For example an architecture could KEEP() its entire
  123. * boot/exception vector code rather than annotate each function and data.
  124. */
  125. #ifndef KENTRY
  126. # define KENTRY(sym) \
  127. extern typeof(sym) sym; \
  128. static const unsigned long __kentry_##sym \
  129. __used \
  130. __attribute__((section("___kentry" "+" #sym ), used)) \
  131. = (unsigned long)&sym;
  132. #endif
  133. #ifndef RELOC_HIDE
  134. # define RELOC_HIDE(ptr, off) \
  135. ({ unsigned long __ptr; \
  136. __ptr = (unsigned long) (ptr); \
  137. (typeof(ptr)) (__ptr + (off)); })
  138. #endif
  139. #ifndef OPTIMIZER_HIDE_VAR
  140. #define OPTIMIZER_HIDE_VAR(var) barrier()
  141. #endif
  142. /* Not-quite-unique ID. */
  143. #ifndef __UNIQUE_ID
  144. # define __UNIQUE_ID(prefix) __PASTE(__PASTE(__UNIQUE_ID_, prefix), __LINE__)
  145. #endif
  146. #include <uapi/linux/types.h>
  147. #define __READ_ONCE_SIZE \
  148. ({ \
  149. switch (size) { \
  150. case 1: *(__u8 *)res = *(volatile __u8 *)p; break; \
  151. case 2: *(__u16 *)res = *(volatile __u16 *)p; break; \
  152. case 4: *(__u32 *)res = *(volatile __u32 *)p; break; \
  153. case 8: *(__u64 *)res = *(volatile __u64 *)p; break; \
  154. default: \
  155. barrier(); \
  156. __builtin_memcpy((void *)res, (const void *)p, size); \
  157. barrier(); \
  158. } \
  159. })
  160. static __always_inline
  161. void __read_once_size(const volatile void *p, void *res, int size)
  162. {
  163. __READ_ONCE_SIZE;
  164. }
  165. #ifdef CONFIG_KASAN
  166. /*
  167. * We can't declare function 'inline' because __no_sanitize_address confilcts
  168. * with inlining. Attempt to inline it may cause a build failure.
  169. * https://gcc.gnu.org/bugzilla/show_bug.cgi?id=67368
  170. * '__maybe_unused' allows us to avoid defined-but-not-used warnings.
  171. */
  172. # define __no_kasan_or_inline __no_sanitize_address __maybe_unused
  173. #else
  174. # define __no_kasan_or_inline __always_inline
  175. #endif
  176. static __no_kasan_or_inline
  177. void __read_once_size_nocheck(const volatile void *p, void *res, int size)
  178. {
  179. __READ_ONCE_SIZE;
  180. }
  181. static __always_inline void __write_once_size(volatile void *p, void *res, int size)
  182. {
  183. switch (size) {
  184. case 1: *(volatile __u8 *)p = *(__u8 *)res; break;
  185. case 2: *(volatile __u16 *)p = *(__u16 *)res; break;
  186. case 4: *(volatile __u32 *)p = *(__u32 *)res; break;
  187. case 8: *(volatile __u64 *)p = *(__u64 *)res; break;
  188. default:
  189. barrier();
  190. __builtin_memcpy((void *)p, (const void *)res, size);
  191. barrier();
  192. }
  193. }
  194. /*
  195. * Prevent the compiler from merging or refetching reads or writes. The
  196. * compiler is also forbidden from reordering successive instances of
  197. * READ_ONCE and WRITE_ONCE, but only when the compiler is aware of some
  198. * particular ordering. One way to make the compiler aware of ordering is to
  199. * put the two invocations of READ_ONCE or WRITE_ONCE in different C
  200. * statements.
  201. *
  202. * These two macros will also work on aggregate data types like structs or
  203. * unions. If the size of the accessed data type exceeds the word size of
  204. * the machine (e.g., 32 bits or 64 bits) READ_ONCE() and WRITE_ONCE() will
  205. * fall back to memcpy(). There's at least two memcpy()s: one for the
  206. * __builtin_memcpy() and then one for the macro doing the copy of variable
  207. * - '__u' allocated on the stack.
  208. *
  209. * Their two major use cases are: (1) Mediating communication between
  210. * process-level code and irq/NMI handlers, all running on the same CPU,
  211. * and (2) Ensuring that the compiler does not fold, spindle, or otherwise
  212. * mutilate accesses that either do not require ordering or that interact
  213. * with an explicit memory barrier or atomic instruction that provides the
  214. * required ordering.
  215. */
  216. #include <asm/barrier.h>
  217. #include <linux/kasan-checks.h>
  218. #define __READ_ONCE(x, check) \
  219. ({ \
  220. union { typeof(x) __val; char __c[1]; } __u; \
  221. if (check) \
  222. __read_once_size(&(x), __u.__c, sizeof(x)); \
  223. else \
  224. __read_once_size_nocheck(&(x), __u.__c, sizeof(x)); \
  225. smp_read_barrier_depends(); /* Enforce dependency ordering from x */ \
  226. __u.__val; \
  227. })
  228. #define READ_ONCE(x) __READ_ONCE(x, 1)
  229. /*
  230. * Use READ_ONCE_NOCHECK() instead of READ_ONCE() if you need
  231. * to hide memory access from KASAN.
  232. */
  233. #define READ_ONCE_NOCHECK(x) __READ_ONCE(x, 0)
  234. static __no_kasan_or_inline
  235. unsigned long read_word_at_a_time(const void *addr)
  236. {
  237. kasan_check_read(addr, 1);
  238. return *(unsigned long *)addr;
  239. }
  240. #define WRITE_ONCE(x, val) \
  241. ({ \
  242. union { typeof(x) __val; char __c[1]; } __u = \
  243. { .__val = (__force typeof(x)) (val) }; \
  244. __write_once_size(&(x), __u.__c, sizeof(x)); \
  245. __u.__val; \
  246. })
  247. #endif /* __KERNEL__ */
  248. #endif /* __ASSEMBLY__ */
  249. /* Compile time object size, -1 for unknown */
  250. #ifndef __compiletime_object_size
  251. # define __compiletime_object_size(obj) -1
  252. #endif
  253. #ifndef __compiletime_warning
  254. # define __compiletime_warning(message)
  255. #endif
  256. #ifndef __compiletime_error
  257. # define __compiletime_error(message)
  258. /*
  259. * Sparse complains of variable sized arrays due to the temporary variable in
  260. * __compiletime_assert. Unfortunately we can't just expand it out to make
  261. * sparse see a constant array size without breaking compiletime_assert on old
  262. * versions of GCC (e.g. 4.2.4), so hide the array from sparse altogether.
  263. */
  264. # ifndef __CHECKER__
  265. # define __compiletime_error_fallback(condition) \
  266. do { ((void)sizeof(char[1 - 2 * condition])); } while (0)
  267. # endif
  268. #endif
  269. #ifndef __compiletime_error_fallback
  270. # define __compiletime_error_fallback(condition) do { } while (0)
  271. #endif
  272. #ifdef __OPTIMIZE__
  273. # define __compiletime_assert(condition, msg, prefix, suffix) \
  274. do { \
  275. bool __cond = !(condition); \
  276. extern void prefix ## suffix(void) __compiletime_error(msg); \
  277. if (__cond) \
  278. prefix ## suffix(); \
  279. __compiletime_error_fallback(__cond); \
  280. } while (0)
  281. #else
  282. # define __compiletime_assert(condition, msg, prefix, suffix) do { } while (0)
  283. #endif
  284. #define _compiletime_assert(condition, msg, prefix, suffix) \
  285. __compiletime_assert(condition, msg, prefix, suffix)
  286. /**
  287. * compiletime_assert - break build and emit msg if condition is false
  288. * @condition: a compile-time constant condition to check
  289. * @msg: a message to emit if condition is false
  290. *
  291. * In tradition of POSIX assert, this macro will break the build if the
  292. * supplied condition is *false*, emitting the supplied error message if the
  293. * compiler has support to do so.
  294. */
  295. #define compiletime_assert(condition, msg) \
  296. _compiletime_assert(condition, msg, __compiletime_assert_, __LINE__)
  297. #define compiletime_assert_atomic_type(t) \
  298. compiletime_assert(__native_word(t), \
  299. "Need native word sized stores/loads for atomicity.")
  300. #endif /* __LINUX_COMPILER_H */