1 /* SPDX-License-Identifier: BSD-2-Clause */ 2 /* 3 * Copyright (c) 2014, STMicroelectronics International N.V. 4 * All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions are met: 8 * 9 * 1. Redistributions of source code must retain the above copyright notice, 10 * this list of conditions and the following disclaimer. 11 * 12 * 2. Redistributions in binary form must reproduce the above copyright notice, 13 * this list of conditions and the following disclaimer in the documentation 14 * and/or other materials provided with the distribution. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE 20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 26 * POSSIBILITY OF SUCH DAMAGE. 27 */ 28 29 #ifndef COMPILER_H 30 #define COMPILER_H 31 32 /* 33 * Macros that should be used instead of using __attribute__ directly to 34 * ease portability and make the code easier to read. 35 * 36 * Some of the defines below is known to sometimes cause conflicts when 37 * this file is included from xtest in normal world. It is assumed that 38 * the conflicting defines has the same meaning in that environment. 39 * Surrounding the troublesome defines with #ifndef should be enough. 40 */ 41 #define __deprecated __attribute__((deprecated)) 42 #ifndef __packed 43 #define __packed __attribute__((packed)) 44 #endif 45 #define __weak __attribute__((weak)) 46 #ifndef __noreturn 47 #define __noreturn __attribute__((noreturn)) 48 #endif 49 #define __pure __attribute__((pure)) 50 #define __aligned(x) __attribute__((aligned(x))) 51 #define __printf(a, b) __attribute__((format(printf, a, b))) 52 #define __noinline __attribute__((noinline)) 53 #define __attr_const __attribute__((__const__)) 54 #ifndef __unused 55 #define __unused __attribute__((unused)) 56 #endif 57 #define __maybe_unused __attribute__((unused)) 58 #ifndef __used 59 #define __used __attribute__((__used__)) 60 #endif 61 #define __must_check __attribute__((warn_unused_result)) 62 #define __cold __attribute__((__cold__)) 63 #define __section(x) __attribute__((section(x))) 64 #define __data __section(".data") 65 #define __bss __section(".bss") 66 #define __rodata __section(".rodata") 67 #define __rodata_unpaged __section(".rodata.__unpaged") 68 #define __early_ta __section(".rodata.early_ta") 69 #define __noprof __attribute__((no_instrument_function)) 70 71 #define __compiler_bswap64(x) __builtin_bswap64((x)) 72 #define __compiler_bswap32(x) __builtin_bswap32((x)) 73 #define __compiler_bswap16(x) __builtin_bswap16((x)) 74 75 #define __GCC_VERSION (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + \ 76 __GNUC_PATCHLEVEL__) 77 78 #if __GCC_VERSION >= 50100 && !defined(__CHECKER__) 79 #define __HAVE_BUILTIN_OVERFLOW 1 80 #endif 81 82 #ifdef __HAVE_BUILTIN_OVERFLOW 83 #define __compiler_add_overflow(a, b, res) \ 84 __builtin_add_overflow((a), (b), (res)) 85 86 #define __compiler_sub_overflow(a, b, res) \ 87 __builtin_sub_overflow((a), (b), (res)) 88 89 #define __compiler_mul_overflow(a, b, res) \ 90 __builtin_mul_overflow((a), (b), (res)) 91 #else /*!__HAVE_BUILTIN_OVERFLOW*/ 92 93 /* 94 * Copied/inspired from https://www.fefe.de/intof.html 95 */ 96 #define __INTOF_HALF_MAX_SIGNED(type) ((type)1 << (sizeof(type)*8-2)) 97 #define __INTOF_MAX_SIGNED(type) (__INTOF_HALF_MAX_SIGNED(type) - 1 + \ 98 __INTOF_HALF_MAX_SIGNED(type)) 99 #define __INTOF_MIN_SIGNED(type) (-1 - __INTOF_MAX_SIGNED(type)) 100 101 #define __INTOF_MIN(type) ((type)-1 < 1?__INTOF_MIN_SIGNED(type):(type)0) 102 #define __INTOF_MAX(type) ((type)~__INTOF_MIN(type)) 103 104 #define __INTOF_ASSIGN(dest, src) (__extension__({ \ 105 typeof(src) __intof_x = (src); \ 106 typeof(dest) __intof_y = __intof_x; \ 107 (((uintmax_t)__intof_x == (uintmax_t)__intof_y) && \ 108 ((__intof_x < 1) == (__intof_y < 1)) ? \ 109 (void)((dest) = __intof_y) , 0 : 1); \ 110 })) 111 112 #define __INTOF_ADD(c, a, b) (__extension__({ \ 113 typeof(a) __intofa_a = (a); \ 114 typeof(b) __intofa_b = (b); \ 115 int __infoa_b_signed = !!__INTOF_MIN(typeof(b)); \ 116 int __infoa_c_signed = !!__INTOF_MIN(typeof(c)); \ 117 \ 118 __intofa_b < 1 ? \ 119 /* \ 120 * First deal with special case where c is signed and b is \ 121 * unsigned and has the value 0 to avoid a problem due to \ 122 * integer promotion. \ 123 */ \ 124 (((__infoa_c_signed && !__infoa_b_signed) || \ 125 (__INTOF_MIN(typeof(c)) - __intofa_b <= __intofa_a)) ? \ 126 __INTOF_ASSIGN((c), __intofa_a + __intofa_b) : 1) : \ 127 ((__INTOF_MAX(typeof(c)) - __intofa_b >= __intofa_a) ? \ 128 __INTOF_ASSIGN((c), __intofa_a + __intofa_b) : 1); \ 129 })) 130 131 #define __INTOF_SUB(c, a, b) (__extension__({ \ 132 typeof(a) __intofs_a = a; \ 133 typeof(b) __intofs_b = b; \ 134 \ 135 __intofs_b < 1 ? \ 136 ((__INTOF_MAX(typeof(c)) + __intofs_b >= __intofs_a) ? \ 137 __INTOF_ASSIGN((c), __intofs_a - __intofs_b) : 1) : \ 138 ((__INTOF_MIN(typeof(c)) + __intofs_b <= __intofs_a) ? \ 139 __INTOF_ASSIGN((c), __intofs_a - __intofs_b) : 1); \ 140 })) 141 142 /* 143 * Dealing with detecting overflow in multiplication of integers. 144 * 145 * First step is to remove two corner cases with the minum signed integer 146 * which can't be represented as a positive integer + sign. 147 * Multiply with 0 or 1 can't overflow, no checking needed of the operation, 148 * only if it can be assigned to the result. 149 * 150 * After the corner cases are eliminated we convert the two factors to 151 * positive unsigned values, keeping track of the original in another 152 * variable which is used at the end to determine the sign of the product. 153 * 154 * The two terms (a and b) are divided into upper and lower half (x1 upper 155 * and x0 lower), so the product is: 156 * ((a1 << hshift) + a0) * ((b1 << hshift) + b0) 157 * which also is: 158 * ((a1 * b1) << (hshift * 2)) + (T1) 159 * ((a1 * b0 + a0 * b1) << hshift) + (T2) 160 * (a0 * b0) (T3) 161 * 162 * From this we can tell and (a1 * b1) has to be 0 or we'll overflow, that 163 * is, at least one of a1 or b1 has to be 0. Once this has been checked the 164 * addition: ((a1 * b0) << hshift) + ((a0 * b1) << hshift) 165 * isn't an addition as one of the terms will be 0. 166 * 167 * Since each factor in: (a0 * b0) 168 * only uses half the capicity of the underlaying type it can't overflow 169 * 170 * The addition of T2 and T3 can overflow so we use __INTOF_ADD() to 171 * perform that addition. If the addition succeeds without overflow the 172 * result is assigned the required sign and checked for overflow again. 173 */ 174 175 #define __intof_mul_negate ((__intof_oa < 1) != (__intof_ob < 1)) 176 #define __intof_mul_hshift (sizeof(uintmax_t) * 8 / 2) 177 #define __intof_mul_hmask (UINTMAX_MAX >> __intof_mul_hshift) 178 #define __intof_mul_a0 ((uintmax_t)(__intof_a) >> __intof_mul_hshift) 179 #define __intof_mul_b0 ((uintmax_t)(__intof_b) >> __intof_mul_hshift) 180 #define __intof_mul_a1 ((uintmax_t)(__intof_a) & __intof_mul_hmask) 181 #define __intof_mul_b1 ((uintmax_t)(__intof_b) & __intof_mul_hmask) 182 #define __intof_mul_t (__intof_mul_a1 * __intof_mul_b0 + \ 183 __intof_mul_a0 * __intof_mul_b1) 184 185 #define __INTOF_MUL(c, a, b) (__extension__({ \ 186 typeof(a) __intof_oa = (a); \ 187 typeof(a) __intof_a = __intof_oa < 1 ? -__intof_oa : __intof_oa; \ 188 typeof(b) __intof_ob = (b); \ 189 typeof(b) __intof_b = __intof_ob < 1 ? -__intof_ob : __intof_ob; \ 190 typeof(c) __intof_c; \ 191 \ 192 __intof_oa == 0 || __intof_ob == 0 || \ 193 __intof_oa == 1 || __intof_ob == 1 ? \ 194 __INTOF_ASSIGN((c), __intof_oa * __intof_ob) : \ 195 (__intof_mul_a0 && __intof_mul_b0) || \ 196 __intof_mul_t > __intof_mul_hmask ? 1 : \ 197 __INTOF_ADD((__intof_c), __intof_mul_t << __intof_mul_hshift, \ 198 __intof_mul_a1 * __intof_mul_b1) ? 1 : \ 199 __intof_mul_negate ? __INTOF_ASSIGN((c), -__intof_c) : \ 200 __INTOF_ASSIGN((c), __intof_c); \ 201 })) 202 203 #define __compiler_add_overflow(a, b, res) __INTOF_ADD(*(res), (a), (b)) 204 #define __compiler_sub_overflow(a, b, res) __INTOF_SUB(*(res), (a), (b)) 205 #define __compiler_mul_overflow(a, b, res) __INTOF_MUL(*(res), (a), (b)) 206 207 #endif /*!__HAVE_BUILTIN_OVERFLOW*/ 208 209 #define __compiler_compare_and_swap(p, oval, nval) \ 210 __atomic_compare_exchange_n((p), (oval), (nval), true, \ 211 __ATOMIC_ACQUIRE, __ATOMIC_RELAXED) \ 212 213 #define __compiler_atomic_load(p) __atomic_load_n((p), __ATOMIC_RELAXED) 214 #define __compiler_atomic_store(p, val) \ 215 __atomic_store_n((p), (val), __ATOMIC_RELAXED) 216 217 #endif /*COMPILER_H*/ 218