1 #ifndef _TOOLS_LINUX_COMPILER_H_
2 #define _TOOLS_LINUX_COMPILER_H_
4 /* Optimization barrier */
5 /* The "volatile" is due to gcc bugs */
6 #define barrier() __asm__ __volatile__("": : :"memory")
8 #ifndef __always_inline
9 # define __always_inline inline __attribute__((always_inline))
14 #ifndef __attribute_const__
15 # define __attribute_const__
18 #ifndef __maybe_unused
19 # define __maybe_unused __attribute__((unused))
23 # define __packed __attribute__((__packed__))
31 # define __weak __attribute__((weak))
35 # define likely(x) __builtin_expect(!!(x), 1)
39 # define unlikely(x) __builtin_expect(!!(x), 0)
42 #define ACCESS_ONCE(x) (*(volatile typeof(x) *)&(x))
44 #include <linux/types.h>
47 * Following functions are taken from kernel sources and
48 * break aliasing rules in their original form.
50 * While kernel is compiled with -fno-strict-aliasing,
51 * perf uses -Wstrict-aliasing=3 which makes build fail
54 * Using extra __may_alias__ type to allow aliasing
57 typedef __u8 __attribute__((__may_alias__)) __u8_alias_t;
58 typedef __u16 __attribute__((__may_alias__)) __u16_alias_t;
59 typedef __u32 __attribute__((__may_alias__)) __u32_alias_t;
60 typedef __u64 __attribute__((__may_alias__)) __u64_alias_t;
62 static __always_inline void __read_once_size(const volatile void *p, void *res, int size)
65 case 1: *(__u8_alias_t *) res = *(volatile __u8_alias_t *) p; break;
66 case 2: *(__u16_alias_t *) res = *(volatile __u16_alias_t *) p; break;
67 case 4: *(__u32_alias_t *) res = *(volatile __u32_alias_t *) p; break;
68 case 8: *(__u64_alias_t *) res = *(volatile __u64_alias_t *) p; break;
71 __builtin_memcpy((void *)res, (const void *)p, size);
76 static __always_inline void __write_once_size(volatile void *p, void *res, int size)
79 case 1: *(volatile __u8_alias_t *) p = *(__u8_alias_t *) res; break;
80 case 2: *(volatile __u16_alias_t *) p = *(__u16_alias_t *) res; break;
81 case 4: *(volatile __u32_alias_t *) p = *(__u32_alias_t *) res; break;
82 case 8: *(volatile __u64_alias_t *) p = *(__u64_alias_t *) res; break;
85 __builtin_memcpy((void *)p, (const void *)res, size);
91 * Prevent the compiler from merging or refetching reads or writes. The
92 * compiler is also forbidden from reordering successive instances of
93 * READ_ONCE, WRITE_ONCE and ACCESS_ONCE (see below), but only when the
94 * compiler is aware of some particular ordering. One way to make the
95 * compiler aware of ordering is to put the two invocations of READ_ONCE,
96 * WRITE_ONCE or ACCESS_ONCE() in different C statements.
98 * In contrast to ACCESS_ONCE these two macros will also work on aggregate
99 * data types like structs or unions. If the size of the accessed data
100 * type exceeds the word size of the machine (e.g., 32 bits or 64 bits)
101 * READ_ONCE() and WRITE_ONCE() will fall back to memcpy and print a
102 * compile-time warning.
104 * Their two major use cases are: (1) Mediating communication between
105 * process-level code and irq/NMI handlers, all running on the same CPU,
106 * and (2) Ensuring that the compiler does not fold, spindle, or otherwise
107 * mutilate accesses that either do not require ordering or that interact
108 * with an explicit memory barrier or atomic instruction that provides the
112 #define READ_ONCE(x) \
113 ({ union { typeof(x) __val; char __c[1]; } __u; __read_once_size(&(x), __u.__c, sizeof(x)); __u.__val; })
115 #define WRITE_ONCE(x, val) \
116 ({ union { typeof(x) __val; char __c[1]; } __u = { .__val = (val) }; __write_once_size(&(x), __u.__c, sizeof(x)); __u.__val; })
118 #endif /* _TOOLS_LINUX_COMPILER_H */