Gilles Peskine | c4672fd | 2019-09-11 13:39:11 +0200 | [diff] [blame] | 1 | /** |
| 2 | * \file common.h |
| 3 | * |
| 4 | * \brief Utility macros for internal use in the library |
| 5 | */ |
| 6 | /* |
Bence Szépkúti | 1e14827 | 2020-08-07 13:07:28 +0200 | [diff] [blame] | 7 | * Copyright The Mbed TLS Contributors |
Dave Rodgman | 16799db | 2023-11-02 19:47:20 +0000 | [diff] [blame] | 8 | * SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later |
Gilles Peskine | c4672fd | 2019-09-11 13:39:11 +0200 | [diff] [blame] | 9 | */ |
| 10 | |
| 11 | #ifndef MBEDTLS_LIBRARY_COMMON_H |
| 12 | #define MBEDTLS_LIBRARY_COMMON_H |
| 13 | |
Bence Szépkúti | c662b36 | 2021-05-27 11:25:03 +0200 | [diff] [blame] | 14 | #include "mbedtls/build_info.h" |
Dave Rodgman | fbc2322 | 2022-11-24 18:07:37 +0000 | [diff] [blame] | 15 | #include "alignment.h" |
Gilles Peskine | c4672fd | 2019-09-11 13:39:11 +0200 | [diff] [blame] | 16 | |
Tom Cosgrove | 6ef9bb3 | 2023-03-08 14:19:51 +0000 | [diff] [blame] | 17 | #include <assert.h> |
Gilles Peskine | 42649d9 | 2022-11-23 14:15:57 +0100 | [diff] [blame] | 18 | #include <stddef.h> |
Joe Subbiani | 2194dc4 | 2021-07-14 12:31:31 +0100 | [diff] [blame] | 19 | #include <stdint.h> |
Dave Rodgman | c3d8041 | 2022-11-22 15:01:39 +0000 | [diff] [blame] | 20 | #include <stddef.h> |
Joe Subbiani | 2194dc4 | 2021-07-14 12:31:31 +0100 | [diff] [blame] | 21 | |
Dave Rodgman | 3f47b3f | 2023-05-23 16:11:22 +0100 | [diff] [blame] | 22 | #if defined(__ARM_NEON) |
Dave Rodgman | 6f40f8b | 2023-05-22 18:21:20 +0100 | [diff] [blame] | 23 | #include <arm_neon.h> |
| 24 | #endif /* __ARM_NEON */ |
| 25 | |
Jerry Yu | 92787e4 | 2023-11-29 16:30:38 +0800 | [diff] [blame^] | 26 | |
| 27 | #if defined(__GNUC__) && !defined(__ARMCC_VERSION) && !defined(__clang__) \ |
| 28 | && !defined(__llvm__) && !defined(__INTEL_COMPILER) |
| 29 | /* Defined if the compiler really is gcc and not clang, etc */ |
| 30 | #define MBEDTLS_COMPILER_IS_GCC |
| 31 | #define MBEDTLS_GCC_VERSION \ |
| 32 | (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__) |
| 33 | #endif |
| 34 | |
Gilles Peskine | c4672fd | 2019-09-11 13:39:11 +0200 | [diff] [blame] | 35 | /** Helper to define a function as static except when building invasive tests. |
| 36 | * |
| 37 | * If a function is only used inside its own source file and should be |
| 38 | * declared `static` to allow the compiler to optimize for code size, |
| 39 | * but that function has unit tests, define it with |
| 40 | * ``` |
| 41 | * MBEDTLS_STATIC_TESTABLE int mbedtls_foo(...) { ... } |
| 42 | * ``` |
| 43 | * and declare it in a header in the `library/` directory with |
| 44 | * ``` |
| 45 | * #if defined(MBEDTLS_TEST_HOOKS) |
| 46 | * int mbedtls_foo(...); |
| 47 | * #endif |
| 48 | * ``` |
| 49 | */ |
| 50 | #if defined(MBEDTLS_TEST_HOOKS) |
| 51 | #define MBEDTLS_STATIC_TESTABLE |
| 52 | #else |
| 53 | #define MBEDTLS_STATIC_TESTABLE static |
| 54 | #endif |
| 55 | |
TRodziewicz | 7871c2e | 2021-07-07 17:29:43 +0200 | [diff] [blame] | 56 | #if defined(MBEDTLS_TEST_HOOKS) |
Gilles Peskine | 449bd83 | 2023-01-11 14:50:10 +0100 | [diff] [blame] | 57 | extern void (*mbedtls_test_hook_test_fail)(const char *test, int line, const char *file); |
| 58 | #define MBEDTLS_TEST_HOOK_TEST_ASSERT(TEST) \ |
| 59 | do { \ |
| 60 | if ((!(TEST)) && ((*mbedtls_test_hook_test_fail) != NULL)) \ |
| 61 | { \ |
| 62 | (*mbedtls_test_hook_test_fail)( #TEST, __LINE__, __FILE__); \ |
| 63 | } \ |
| 64 | } while (0) |
TRodziewicz | 7871c2e | 2021-07-07 17:29:43 +0200 | [diff] [blame] | 65 | #else |
Gilles Peskine | 449bd83 | 2023-01-11 14:50:10 +0100 | [diff] [blame] | 66 | #define MBEDTLS_TEST_HOOK_TEST_ASSERT(TEST) |
TRodziewicz | 7871c2e | 2021-07-07 17:29:43 +0200 | [diff] [blame] | 67 | #endif /* defined(MBEDTLS_TEST_HOOKS) */ |
| 68 | |
Andrzej Kurek | b22b977 | 2023-05-30 09:44:20 -0400 | [diff] [blame] | 69 | /** \def ARRAY_LENGTH |
| 70 | * Return the number of elements of a static or stack array. |
| 71 | * |
| 72 | * \param array A value of array (not pointer) type. |
| 73 | * |
| 74 | * \return The number of elements of the array. |
| 75 | */ |
| 76 | /* A correct implementation of ARRAY_LENGTH, but which silently gives |
| 77 | * a nonsensical result if called with a pointer rather than an array. */ |
| 78 | #define ARRAY_LENGTH_UNSAFE(array) \ |
| 79 | (sizeof(array) / sizeof(*(array))) |
| 80 | |
| 81 | #if defined(__GNUC__) |
| 82 | /* Test if arg and &(arg)[0] have the same type. This is true if arg is |
| 83 | * an array but not if it's a pointer. */ |
| 84 | #define IS_ARRAY_NOT_POINTER(arg) \ |
| 85 | (!__builtin_types_compatible_p(__typeof__(arg), \ |
| 86 | __typeof__(&(arg)[0]))) |
| 87 | /* A compile-time constant with the value 0. If `const_expr` is not a |
| 88 | * compile-time constant with a nonzero value, cause a compile-time error. */ |
| 89 | #define STATIC_ASSERT_EXPR(const_expr) \ |
| 90 | (0 && sizeof(struct { unsigned int STATIC_ASSERT : 1 - 2 * !(const_expr); })) |
| 91 | |
| 92 | /* Return the scalar value `value` (possibly promoted). This is a compile-time |
| 93 | * constant if `value` is. `condition` must be a compile-time constant. |
| 94 | * If `condition` is false, arrange to cause a compile-time error. */ |
| 95 | #define STATIC_ASSERT_THEN_RETURN(condition, value) \ |
| 96 | (STATIC_ASSERT_EXPR(condition) ? 0 : (value)) |
| 97 | |
| 98 | #define ARRAY_LENGTH(array) \ |
| 99 | (STATIC_ASSERT_THEN_RETURN(IS_ARRAY_NOT_POINTER(array), \ |
| 100 | ARRAY_LENGTH_UNSAFE(array))) |
| 101 | |
| 102 | #else |
| 103 | /* If we aren't sure the compiler supports our non-standard tricks, |
| 104 | * fall back to the unsafe implementation. */ |
| 105 | #define ARRAY_LENGTH(array) ARRAY_LENGTH_UNSAFE(array) |
| 106 | #endif |
Mateusz Starzyk | 57d1d19 | 2021-05-27 14:39:53 +0200 | [diff] [blame] | 107 | /** Allow library to access its structs' private members. |
Mateusz Starzyk | 2c09c9b | 2021-05-14 22:20:10 +0200 | [diff] [blame] | 108 | * |
| 109 | * Although structs defined in header files are publicly available, |
| 110 | * their members are private and should not be accessed by the user. |
| 111 | */ |
| 112 | #define MBEDTLS_ALLOW_PRIVATE_ACCESS |
| 113 | |
Tom Cosgrove | ca8c61b | 2023-07-17 15:17:40 +0100 | [diff] [blame] | 114 | /** |
| 115 | * \brief Securely zeroize a buffer then free it. |
| 116 | * |
Tom Cosgrove | 3a11bb8 | 2023-07-18 16:26:29 +0100 | [diff] [blame] | 117 | * Similar to making consecutive calls to |
| 118 | * \c mbedtls_platform_zeroize() and \c mbedtls_free(), but has |
Tom Cosgrove | ca8c61b | 2023-07-17 15:17:40 +0100 | [diff] [blame] | 119 | * code size savings, and potential for optimisation in the future. |
| 120 | * |
Tom Cosgrove | 3a11bb8 | 2023-07-18 16:26:29 +0100 | [diff] [blame] | 121 | * Guaranteed to be a no-op if \p buf is \c NULL and \p len is 0. |
| 122 | * |
| 123 | * \param buf Buffer to be zeroized then freed. |
Tom Cosgrove | ca8c61b | 2023-07-17 15:17:40 +0100 | [diff] [blame] | 124 | * \param len Length of the buffer in bytes |
| 125 | */ |
| 126 | void mbedtls_zeroize_and_free(void *buf, size_t len); |
| 127 | |
Gilles Peskine | 42649d9 | 2022-11-23 14:15:57 +0100 | [diff] [blame] | 128 | /** Return an offset into a buffer. |
| 129 | * |
| 130 | * This is just the addition of an offset to a pointer, except that this |
| 131 | * function also accepts an offset of 0 into a buffer whose pointer is null. |
Gilles Peskine | 7d23778 | 2022-11-25 13:34:59 +0100 | [diff] [blame] | 132 | * (`p + n` has undefined behavior when `p` is null, even when `n == 0`. |
| 133 | * A null pointer is a valid buffer pointer when the size is 0, for example |
| 134 | * as the result of `malloc(0)` on some platforms.) |
Gilles Peskine | 42649d9 | 2022-11-23 14:15:57 +0100 | [diff] [blame] | 135 | * |
| 136 | * \param p Pointer to a buffer of at least n bytes. |
| 137 | * This may be \p NULL if \p n is zero. |
| 138 | * \param n An offset in bytes. |
| 139 | * \return Pointer to offset \p n in the buffer \p p. |
| 140 | * Note that this is only a valid pointer if the size of the |
| 141 | * buffer is at least \p n + 1. |
| 142 | */ |
| 143 | static inline unsigned char *mbedtls_buffer_offset( |
Gilles Peskine | 449bd83 | 2023-01-11 14:50:10 +0100 | [diff] [blame] | 144 | unsigned char *p, size_t n) |
Gilles Peskine | 42649d9 | 2022-11-23 14:15:57 +0100 | [diff] [blame] | 145 | { |
Gilles Peskine | 449bd83 | 2023-01-11 14:50:10 +0100 | [diff] [blame] | 146 | return p == NULL ? NULL : p + n; |
Gilles Peskine | 42649d9 | 2022-11-23 14:15:57 +0100 | [diff] [blame] | 147 | } |
| 148 | |
| 149 | /** Return an offset into a read-only buffer. |
| 150 | * |
Gilles Peskine | 7d23778 | 2022-11-25 13:34:59 +0100 | [diff] [blame] | 151 | * Similar to mbedtls_buffer_offset(), but for const pointers. |
Gilles Peskine | 42649d9 | 2022-11-23 14:15:57 +0100 | [diff] [blame] | 152 | * |
| 153 | * \param p Pointer to a buffer of at least n bytes. |
| 154 | * This may be \p NULL if \p n is zero. |
| 155 | * \param n An offset in bytes. |
| 156 | * \return Pointer to offset \p n in the buffer \p p. |
| 157 | * Note that this is only a valid pointer if the size of the |
| 158 | * buffer is at least \p n + 1. |
| 159 | */ |
| 160 | static inline const unsigned char *mbedtls_buffer_offset_const( |
Gilles Peskine | 449bd83 | 2023-01-11 14:50:10 +0100 | [diff] [blame] | 161 | const unsigned char *p, size_t n) |
Gilles Peskine | 42649d9 | 2022-11-23 14:15:57 +0100 | [diff] [blame] | 162 | { |
Gilles Peskine | 449bd83 | 2023-01-11 14:50:10 +0100 | [diff] [blame] | 163 | return p == NULL ? NULL : p + n; |
Gilles Peskine | 42649d9 | 2022-11-23 14:15:57 +0100 | [diff] [blame] | 164 | } |
| 165 | |
Dave Rodgman | c3d8041 | 2022-11-22 15:01:39 +0000 | [diff] [blame] | 166 | /** |
| 167 | * Perform a fast block XOR operation, such that |
| 168 | * r[i] = a[i] ^ b[i] where 0 <= i < n |
| 169 | * |
| 170 | * \param r Pointer to result (buffer of at least \p n bytes). \p r |
| 171 | * may be equal to either \p a or \p b, but behaviour when |
| 172 | * it overlaps in other ways is undefined. |
| 173 | * \param a Pointer to input (buffer of at least \p n bytes) |
| 174 | * \param b Pointer to input (buffer of at least \p n bytes) |
| 175 | * \param n Number of bytes to process. |
| 176 | */ |
Jerry Yu | 5b96b81 | 2023-11-29 10:25:00 +0800 | [diff] [blame] | 177 | inline void mbedtls_xor(unsigned char *r, const unsigned char *a, const unsigned char *b, size_t n) |
Dave Rodgman | c3d8041 | 2022-11-22 15:01:39 +0000 | [diff] [blame] | 178 | { |
Dave Rodgman | b9cd19b | 2022-12-30 21:32:03 +0000 | [diff] [blame] | 179 | size_t i = 0; |
| 180 | #if defined(MBEDTLS_EFFICIENT_UNALIGNED_ACCESS) |
Jerry Yu | 71fada1 | 2023-11-29 10:38:07 +0800 | [diff] [blame] | 181 | #if defined(__ARM_NEON) && \ |
Jerry Yu | e743aa7 | 2023-11-29 15:54:32 +0800 | [diff] [blame] | 182 | (!defined(MBEDTLS_COMPILER_IS_GCC) || \ |
Jerry Yu | 92787e4 | 2023-11-29 16:30:38 +0800 | [diff] [blame^] | 183 | (defined(MBEDTLS_COMPILER_IS_GCC) && MBEDTLS_GCC_VERSION >= 70300)) |
Dave Rodgman | 6f40f8b | 2023-05-22 18:21:20 +0100 | [diff] [blame] | 184 | for (; (i + 16) <= n; i += 16) { |
Dave Rodgman | f32176c | 2023-06-09 16:25:49 +0100 | [diff] [blame] | 185 | uint8x16_t v1 = vld1q_u8(a + i); |
| 186 | uint8x16_t v2 = vld1q_u8(b + i); |
Dave Rodgman | 2070c20 | 2023-06-07 16:25:58 +0100 | [diff] [blame] | 187 | uint8x16_t x = veorq_u8(v1, v2); |
Dave Rodgman | f32176c | 2023-06-09 16:25:49 +0100 | [diff] [blame] | 188 | vst1q_u8(r + i, x); |
Dave Rodgman | 6f40f8b | 2023-05-22 18:21:20 +0100 | [diff] [blame] | 189 | } |
| 190 | #elif defined(__amd64__) || defined(__x86_64__) || defined(__aarch64__) |
Dave Rodgman | 0805ad1 | 2023-05-19 11:48:10 +0100 | [diff] [blame] | 191 | /* This codepath probably only makes sense on architectures with 64-bit registers */ |
| 192 | for (; (i + 8) <= n; i += 8) { |
| 193 | uint64_t x = mbedtls_get_unaligned_uint64(a + i) ^ mbedtls_get_unaligned_uint64(b + i); |
| 194 | mbedtls_put_unaligned_uint64(r + i, x); |
| 195 | } |
Dave Rodgman | 5c394ff | 2023-06-09 20:10:36 +0100 | [diff] [blame] | 196 | #else |
Dave Rodgman | b9cd19b | 2022-12-30 21:32:03 +0000 | [diff] [blame] | 197 | for (; (i + 4) <= n; i += 4) { |
Gilles Peskine | 449bd83 | 2023-01-11 14:50:10 +0100 | [diff] [blame] | 198 | uint32_t x = mbedtls_get_unaligned_uint32(a + i) ^ mbedtls_get_unaligned_uint32(b + i); |
| 199 | mbedtls_put_unaligned_uint32(r + i, x); |
Dave Rodgman | c3d8041 | 2022-11-22 15:01:39 +0000 | [diff] [blame] | 200 | } |
Dave Rodgman | b9cd19b | 2022-12-30 21:32:03 +0000 | [diff] [blame] | 201 | #endif |
Dave Rodgman | 5c394ff | 2023-06-09 20:10:36 +0100 | [diff] [blame] | 202 | #endif |
Gilles Peskine | 449bd83 | 2023-01-11 14:50:10 +0100 | [diff] [blame] | 203 | for (; i < n; i++) { |
Dave Rodgman | c3d8041 | 2022-11-22 15:01:39 +0000 | [diff] [blame] | 204 | r[i] = a[i] ^ b[i]; |
| 205 | } |
| 206 | } |
| 207 | |
Dave Rodgman | 03bb526 | 2023-06-15 18:43:24 +0100 | [diff] [blame] | 208 | /** |
| 209 | * Perform a fast block XOR operation, such that |
| 210 | * r[i] = a[i] ^ b[i] where 0 <= i < n |
| 211 | * |
| 212 | * In some situations, this can perform better than mbedtls_xor (e.g., it's about 5% |
| 213 | * better in AES-CBC). |
| 214 | * |
| 215 | * \param r Pointer to result (buffer of at least \p n bytes). \p r |
| 216 | * may be equal to either \p a or \p b, but behaviour when |
| 217 | * it overlaps in other ways is undefined. |
| 218 | * \param a Pointer to input (buffer of at least \p n bytes) |
| 219 | * \param b Pointer to input (buffer of at least \p n bytes) |
| 220 | * \param n Number of bytes to process. |
| 221 | */ |
Dave Rodgman | 2dd15b3 | 2023-06-15 20:27:53 +0100 | [diff] [blame] | 222 | static inline void mbedtls_xor_no_simd(unsigned char *r, |
| 223 | const unsigned char *a, |
| 224 | const unsigned char *b, |
| 225 | size_t n) |
Dave Rodgman | 03bb526 | 2023-06-15 18:43:24 +0100 | [diff] [blame] | 226 | { |
| 227 | size_t i = 0; |
| 228 | #if defined(MBEDTLS_EFFICIENT_UNALIGNED_ACCESS) |
| 229 | #if defined(__amd64__) || defined(__x86_64__) || defined(__aarch64__) |
| 230 | /* This codepath probably only makes sense on architectures with 64-bit registers */ |
| 231 | for (; (i + 8) <= n; i += 8) { |
| 232 | uint64_t x = mbedtls_get_unaligned_uint64(a + i) ^ mbedtls_get_unaligned_uint64(b + i); |
| 233 | mbedtls_put_unaligned_uint64(r + i, x); |
| 234 | } |
| 235 | #else |
| 236 | for (; (i + 4) <= n; i += 4) { |
| 237 | uint32_t x = mbedtls_get_unaligned_uint32(a + i) ^ mbedtls_get_unaligned_uint32(b + i); |
| 238 | mbedtls_put_unaligned_uint32(r + i, x); |
| 239 | } |
| 240 | #endif |
| 241 | #endif |
| 242 | for (; i < n; i++) { |
| 243 | r[i] = a[i] ^ b[i]; |
| 244 | } |
| 245 | } |
| 246 | |
Jerry Yu | 6c98352 | 2021-09-24 12:45:36 +0800 | [diff] [blame] | 247 | /* Fix MSVC C99 compatible issue |
| 248 | * MSVC support __func__ from visual studio 2015( 1900 ) |
| 249 | * Use MSVC predefine macro to avoid name check fail. |
| 250 | */ |
Gilles Peskine | 449bd83 | 2023-01-11 14:50:10 +0100 | [diff] [blame] | 251 | #if (defined(_MSC_VER) && (_MSC_VER <= 1900)) |
Jerry Yu | d52398d | 2021-09-28 16:13:44 +0800 | [diff] [blame] | 252 | #define /*no-check-names*/ __func__ __FUNCTION__ |
Jerry Yu | 6c98352 | 2021-09-24 12:45:36 +0800 | [diff] [blame] | 253 | #endif |
| 254 | |
Dave Rodgman | fa96026 | 2023-01-10 11:14:02 +0000 | [diff] [blame] | 255 | /* Define `asm` for compilers which don't define it. */ |
| 256 | /* *INDENT-OFF* */ |
| 257 | #ifndef asm |
Agathiyan Bragadeesh | 789e50e | 2023-07-14 16:59:36 +0100 | [diff] [blame] | 258 | #if defined(__IAR_SYSTEMS_ICC__) |
| 259 | #define asm __asm |
| 260 | #else |
Dave Rodgman | fa96026 | 2023-01-10 11:14:02 +0000 | [diff] [blame] | 261 | #define asm __asm__ |
| 262 | #endif |
Agathiyan Bragadeesh | 789e50e | 2023-07-14 16:59:36 +0100 | [diff] [blame] | 263 | #endif |
Dave Rodgman | fa96026 | 2023-01-10 11:14:02 +0000 | [diff] [blame] | 264 | /* *INDENT-ON* */ |
| 265 | |
Dave Rodgman | 0400ae2 | 2023-06-21 16:14:46 +0100 | [diff] [blame] | 266 | /* |
Dave Rodgman | 28e2ca5 | 2023-06-27 15:25:38 +0100 | [diff] [blame] | 267 | * Define the constraint used for read-only pointer operands to aarch64 asm. |
Dave Rodgman | 0400ae2 | 2023-06-21 16:14:46 +0100 | [diff] [blame] | 268 | * |
| 269 | * This is normally the usual "r", but for aarch64_32 (aka ILP32, |
| 270 | * as found in watchos), "p" is required to avoid warnings from clang. |
Dave Rodgman | e6c9996 | 2023-06-21 21:16:23 +0100 | [diff] [blame] | 271 | * |
| 272 | * Note that clang does not recognise '+p' or '=p', and armclang |
Dave Rodgman | 28e2ca5 | 2023-06-27 15:25:38 +0100 | [diff] [blame] | 273 | * does not recognise 'p' at all. Therefore, to update a pointer from |
| 274 | * aarch64 assembly, it is necessary to use something like: |
| 275 | * |
| 276 | * uintptr_t uptr = (uintptr_t) ptr; |
| 277 | * asm( "ldr x4, [%x0], #8" ... : "+r" (uptr) : : ) |
| 278 | * ptr = (void*) uptr; |
| 279 | * |
| 280 | * Note that the "x" in "%x0" is neccessary; writing "%0" will cause warnings. |
Dave Rodgman | 0400ae2 | 2023-06-21 16:14:46 +0100 | [diff] [blame] | 281 | */ |
| 282 | #if defined(__aarch64__) && defined(MBEDTLS_HAVE_ASM) |
| 283 | #if UINTPTR_MAX == 0xfffffffful |
| 284 | /* ILP32: Specify the pointer operand slightly differently, as per #7787. */ |
| 285 | #define MBEDTLS_ASM_AARCH64_PTR_CONSTRAINT "p" |
| 286 | #elif UINTPTR_MAX == 0xfffffffffffffffful |
| 287 | /* Normal case (64-bit pointers): use "r" as the constraint for pointer operands to asm */ |
| 288 | #define MBEDTLS_ASM_AARCH64_PTR_CONSTRAINT "r" |
| 289 | #else |
Antonio de Angelis | 1ee4d12 | 2023-08-16 12:26:37 +0100 | [diff] [blame] | 290 | #error "Unrecognised pointer size for aarch64" |
Dave Rodgman | 0400ae2 | 2023-06-21 16:14:46 +0100 | [diff] [blame] | 291 | #endif |
| 292 | #endif |
| 293 | |
Tom Cosgrove | 6ef9bb3 | 2023-03-08 14:19:51 +0000 | [diff] [blame] | 294 | /* Always provide a static assert macro, so it can be used unconditionally. |
Tom Cosgrove | 57f04b8 | 2023-03-14 12:03:47 +0000 | [diff] [blame] | 295 | * It will expand to nothing on some systems. |
Tom Cosgrove | 6ef9bb3 | 2023-03-08 14:19:51 +0000 | [diff] [blame] | 296 | * Can be used outside functions (but don't add a trailing ';' in that case: |
| 297 | * the semicolon is included here to avoid triggering -Wextra-semi when |
| 298 | * MBEDTLS_STATIC_ASSERT() expands to nothing). |
| 299 | * Can't use the C11-style `defined(static_assert)` on FreeBSD, since it |
| 300 | * defines static_assert even with -std=c99, but then complains about it. |
| 301 | */ |
| 302 | #if defined(static_assert) && !defined(__FreeBSD__) |
| 303 | #define MBEDTLS_STATIC_ASSERT(expr, msg) static_assert(expr, msg); |
Tom Cosgrove | 6ef9bb3 | 2023-03-08 14:19:51 +0000 | [diff] [blame] | 304 | #else |
| 305 | #define MBEDTLS_STATIC_ASSERT(expr, msg) |
| 306 | #endif |
| 307 | |
Dave Rodgman | 360e04f | 2023-06-09 17:18:32 +0100 | [diff] [blame] | 308 | #if defined(__has_builtin) |
Dave Rodgman | 9ba640d | 2023-10-31 23:30:09 +0000 | [diff] [blame] | 309 | #define MBEDTLS_HAS_BUILTIN(x) __has_builtin(x) |
| 310 | #else |
| 311 | #define MBEDTLS_HAS_BUILTIN(x) 0 |
| 312 | #endif |
| 313 | |
| 314 | /* Define compiler branch hints */ |
| 315 | #if MBEDTLS_HAS_BUILTIN(__builtin_expect) |
Dave Rodgman | e9fcffd | 2023-07-19 15:42:19 +0100 | [diff] [blame] | 316 | #define MBEDTLS_LIKELY(x) __builtin_expect(!!(x), 1) |
| 317 | #define MBEDTLS_UNLIKELY(x) __builtin_expect(!!(x), 0) |
Dave Rodgman | 9ba640d | 2023-10-31 23:30:09 +0000 | [diff] [blame] | 318 | #else |
Dave Rodgman | 360e04f | 2023-06-09 17:18:32 +0100 | [diff] [blame] | 319 | #define MBEDTLS_LIKELY(x) x |
| 320 | #define MBEDTLS_UNLIKELY(x) x |
| 321 | #endif |
| 322 | |
Dave Rodgman | fb24a84 | 2023-07-12 13:16:49 +0100 | [diff] [blame] | 323 | /* MBEDTLS_ASSUME may be used to provide additional information to the compiler |
| 324 | * which can result in smaller code-size. */ |
Dave Rodgman | 9ba640d | 2023-10-31 23:30:09 +0000 | [diff] [blame] | 325 | #if MBEDTLS_HAS_BUILTIN(__builtin_assume) |
Dave Rodgman | 52e7052 | 2023-10-31 23:26:44 +0000 | [diff] [blame] | 326 | /* clang provides __builtin_assume */ |
Dave Rodgman | fb24a84 | 2023-07-12 13:16:49 +0100 | [diff] [blame] | 327 | #define MBEDTLS_ASSUME(x) __builtin_assume(x) |
Dave Rodgman | 9ba640d | 2023-10-31 23:30:09 +0000 | [diff] [blame] | 328 | #elif MBEDTLS_HAS_BUILTIN(__builtin_unreachable) |
Dave Rodgman | e91d7c5 | 2023-11-02 10:36:38 +0000 | [diff] [blame] | 329 | /* gcc and IAR can use __builtin_unreachable */ |
Dave Rodgman | fb24a84 | 2023-07-12 13:16:49 +0100 | [diff] [blame] | 330 | #define MBEDTLS_ASSUME(x) do { if (!(x)) __builtin_unreachable(); } while (0) |
Dave Rodgman | 9ba640d | 2023-10-31 23:30:09 +0000 | [diff] [blame] | 331 | #elif defined(_MSC_VER) |
Dave Rodgman | 90c8ac2 | 2023-10-31 23:27:24 +0000 | [diff] [blame] | 332 | /* Supported by MSVC since VS 2005 */ |
| 333 | #define MBEDTLS_ASSUME(x) __assume(x) |
| 334 | #else |
Dave Rodgman | 64bdeb8 | 2023-10-31 23:27:04 +0000 | [diff] [blame] | 335 | #define MBEDTLS_ASSUME(x) do { } while (0) |
Dave Rodgman | fb24a84 | 2023-07-12 13:16:49 +0100 | [diff] [blame] | 336 | #endif |
| 337 | |
Dave Rodgman | 9bb7e6f | 2023-06-16 09:41:21 +0100 | [diff] [blame] | 338 | /* For gcc -Os, override with -O2 for a given function. |
| 339 | * |
| 340 | * This will not affect behaviour for other optimisation settings, e.g. -O0. |
| 341 | */ |
Dave Rodgman | b055f75 | 2023-06-15 18:42:59 +0100 | [diff] [blame] | 342 | #if defined(MBEDTLS_COMPILER_IS_GCC) && defined(__OPTIMIZE_SIZE__) |
Dave Rodgman | 9bb7e6f | 2023-06-16 09:41:21 +0100 | [diff] [blame] | 343 | #define MBEDTLS_OPTIMIZE_FOR_PERFORMANCE __attribute__((optimize("-O2"))) |
Dave Rodgman | b055f75 | 2023-06-15 18:42:59 +0100 | [diff] [blame] | 344 | #else |
Dave Rodgman | 9bb7e6f | 2023-06-16 09:41:21 +0100 | [diff] [blame] | 345 | #define MBEDTLS_OPTIMIZE_FOR_PERFORMANCE |
Dave Rodgman | b055f75 | 2023-06-15 18:42:59 +0100 | [diff] [blame] | 346 | #endif |
| 347 | |
Dave Rodgman | 1ec1a0f | 2023-10-04 13:50:54 +0100 | [diff] [blame] | 348 | /* Suppress compiler warnings for unused functions and variables. */ |
Dave Rodgman | 2457bcd | 2023-10-13 12:31:45 +0100 | [diff] [blame] | 349 | #if !defined(MBEDTLS_MAYBE_UNUSED) && defined(__has_attribute) |
| 350 | # if __has_attribute(unused) |
| 351 | # define MBEDTLS_MAYBE_UNUSED __attribute__((unused)) |
| 352 | # endif |
| 353 | #endif |
| 354 | #if !defined(MBEDTLS_MAYBE_UNUSED) && defined(__GNUC__) |
| 355 | # define MBEDTLS_MAYBE_UNUSED __attribute__((unused)) |
Dave Rodgman | feadcaf | 2023-10-04 15:27:33 +0100 | [diff] [blame] | 356 | #endif |
Dave Rodgman | 749f222 | 2023-10-04 15:38:58 +0100 | [diff] [blame] | 357 | #if !defined(MBEDTLS_MAYBE_UNUSED) && defined(__IAR_SYSTEMS_ICC__) && defined(__VER__) |
Dave Rodgman | f842868 | 2023-10-24 14:18:38 +0100 | [diff] [blame] | 358 | /* IAR does support __attribute__((unused)), but only if the -e flag (extended language support) |
| 359 | * is given; the pragma always works. |
Dave Rodgman | d1c4fb0 | 2023-10-25 15:07:35 +0100 | [diff] [blame] | 360 | * Unfortunately the pragma affects the rest of the file where it is used, but this is harmless. |
| 361 | * Check for version 5.2 or later - this pragma may be supported by earlier versions, but I wasn't |
| 362 | * able to find documentation). |
| 363 | */ |
| 364 | # if (__VER__ >= 5020000) |
Dave Rodgman | f842868 | 2023-10-24 14:18:38 +0100 | [diff] [blame] | 365 | # define MBEDTLS_MAYBE_UNUSED _Pragma("diag_suppress=Pe177") |
Dave Rodgman | 2457bcd | 2023-10-13 12:31:45 +0100 | [diff] [blame] | 366 | # endif |
Dave Rodgman | 749f222 | 2023-10-04 15:38:58 +0100 | [diff] [blame] | 367 | #endif |
| 368 | #if !defined(MBEDTLS_MAYBE_UNUSED) && defined(_MSC_VER) |
Dave Rodgman | 2457bcd | 2023-10-13 12:31:45 +0100 | [diff] [blame] | 369 | # define MBEDTLS_MAYBE_UNUSED __pragma(warning(suppress:4189)) |
Dave Rodgman | 749f222 | 2023-10-04 15:38:58 +0100 | [diff] [blame] | 370 | #endif |
| 371 | #if !defined(MBEDTLS_MAYBE_UNUSED) |
Dave Rodgman | 2457bcd | 2023-10-13 12:31:45 +0100 | [diff] [blame] | 372 | # define MBEDTLS_MAYBE_UNUSED |
Dave Rodgman | 1ec1a0f | 2023-10-04 13:50:54 +0100 | [diff] [blame] | 373 | #endif |
| 374 | |
Gilles Peskine | c4672fd | 2019-09-11 13:39:11 +0200 | [diff] [blame] | 375 | #endif /* MBEDTLS_LIBRARY_COMMON_H */ |