blob: ce92238c88cd0666f82a80fe95cf8a46454654b5 [file] [log] [blame]
Gilles Peskinec4672fd2019-09-11 13:39:11 +02001/**
2 * \file common.h
3 *
4 * \brief Utility macros for internal use in the library
5 */
6/*
Bence Szépkúti1e148272020-08-07 13:07:28 +02007 * Copyright The Mbed TLS Contributors
Gilles Peskinec4672fd2019-09-11 13:39:11 +02008 * SPDX-License-Identifier: Apache-2.0
9 *
10 * Licensed under the Apache License, Version 2.0 (the "License"); you may
11 * not use this file except in compliance with the License.
12 * You may obtain a copy of the License at
13 *
14 * http://www.apache.org/licenses/LICENSE-2.0
15 *
16 * Unless required by applicable law or agreed to in writing, software
17 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
18 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
19 * See the License for the specific language governing permissions and
20 * limitations under the License.
Gilles Peskinec4672fd2019-09-11 13:39:11 +020021 */
22
23#ifndef MBEDTLS_LIBRARY_COMMON_H
24#define MBEDTLS_LIBRARY_COMMON_H
25
Bence Szépkútic662b362021-05-27 11:25:03 +020026#include "mbedtls/build_info.h"
Dave Rodgmanfbc23222022-11-24 18:07:37 +000027#include "alignment.h"
Gilles Peskinec4672fd2019-09-11 13:39:11 +020028
Tom Cosgrove6ef9bb32023-03-08 14:19:51 +000029#include <assert.h>
Gilles Peskine42649d92022-11-23 14:15:57 +010030#include <stddef.h>
Joe Subbiani2194dc42021-07-14 12:31:31 +010031#include <stdint.h>
Dave Rodgmanc3d80412022-11-22 15:01:39 +000032#include <stddef.h>
Joe Subbiani2194dc42021-07-14 12:31:31 +010033
Dave Rodgman3f47b3f2023-05-23 16:11:22 +010034#if defined(__ARM_NEON)
Dave Rodgman6f40f8b2023-05-22 18:21:20 +010035#include <arm_neon.h>
36#endif /* __ARM_NEON */
37
Gilles Peskinec4672fd2019-09-11 13:39:11 +020038/** Helper to define a function as static except when building invasive tests.
39 *
40 * If a function is only used inside its own source file and should be
41 * declared `static` to allow the compiler to optimize for code size,
42 * but that function has unit tests, define it with
43 * ```
44 * MBEDTLS_STATIC_TESTABLE int mbedtls_foo(...) { ... }
45 * ```
46 * and declare it in a header in the `library/` directory with
47 * ```
48 * #if defined(MBEDTLS_TEST_HOOKS)
49 * int mbedtls_foo(...);
50 * #endif
51 * ```
52 */
53#if defined(MBEDTLS_TEST_HOOKS)
54#define MBEDTLS_STATIC_TESTABLE
55#else
56#define MBEDTLS_STATIC_TESTABLE static
57#endif
58
TRodziewicz7871c2e2021-07-07 17:29:43 +020059#if defined(MBEDTLS_TEST_HOOKS)
Gilles Peskine449bd832023-01-11 14:50:10 +010060extern void (*mbedtls_test_hook_test_fail)(const char *test, int line, const char *file);
61#define MBEDTLS_TEST_HOOK_TEST_ASSERT(TEST) \
62 do { \
63 if ((!(TEST)) && ((*mbedtls_test_hook_test_fail) != NULL)) \
64 { \
65 (*mbedtls_test_hook_test_fail)( #TEST, __LINE__, __FILE__); \
66 } \
67 } while (0)
TRodziewicz7871c2e2021-07-07 17:29:43 +020068#else
Gilles Peskine449bd832023-01-11 14:50:10 +010069#define MBEDTLS_TEST_HOOK_TEST_ASSERT(TEST)
TRodziewicz7871c2e2021-07-07 17:29:43 +020070#endif /* defined(MBEDTLS_TEST_HOOKS) */
71
Andrzej Kurekb22b9772023-05-30 09:44:20 -040072/** \def ARRAY_LENGTH
73 * Return the number of elements of a static or stack array.
74 *
75 * \param array A value of array (not pointer) type.
76 *
77 * \return The number of elements of the array.
78 */
79/* A correct implementation of ARRAY_LENGTH, but which silently gives
80 * a nonsensical result if called with a pointer rather than an array. */
81#define ARRAY_LENGTH_UNSAFE(array) \
82 (sizeof(array) / sizeof(*(array)))
83
84#if defined(__GNUC__)
85/* Test if arg and &(arg)[0] have the same type. This is true if arg is
86 * an array but not if it's a pointer. */
87#define IS_ARRAY_NOT_POINTER(arg) \
88 (!__builtin_types_compatible_p(__typeof__(arg), \
89 __typeof__(&(arg)[0])))
90/* A compile-time constant with the value 0. If `const_expr` is not a
91 * compile-time constant with a nonzero value, cause a compile-time error. */
92#define STATIC_ASSERT_EXPR(const_expr) \
93 (0 && sizeof(struct { unsigned int STATIC_ASSERT : 1 - 2 * !(const_expr); }))
94
95/* Return the scalar value `value` (possibly promoted). This is a compile-time
96 * constant if `value` is. `condition` must be a compile-time constant.
97 * If `condition` is false, arrange to cause a compile-time error. */
98#define STATIC_ASSERT_THEN_RETURN(condition, value) \
99 (STATIC_ASSERT_EXPR(condition) ? 0 : (value))
100
101#define ARRAY_LENGTH(array) \
102 (STATIC_ASSERT_THEN_RETURN(IS_ARRAY_NOT_POINTER(array), \
103 ARRAY_LENGTH_UNSAFE(array)))
104
105#else
106/* If we aren't sure the compiler supports our non-standard tricks,
107 * fall back to the unsafe implementation. */
108#define ARRAY_LENGTH(array) ARRAY_LENGTH_UNSAFE(array)
109#endif
Mateusz Starzyk57d1d192021-05-27 14:39:53 +0200110/** Allow library to access its structs' private members.
Mateusz Starzyk2c09c9b2021-05-14 22:20:10 +0200111 *
112 * Although structs defined in header files are publicly available,
113 * their members are private and should not be accessed by the user.
114 */
115#define MBEDTLS_ALLOW_PRIVATE_ACCESS
116
Tom Cosgroveca8c61b2023-07-17 15:17:40 +0100117/**
118 * \brief Securely zeroize a buffer then free it.
119 *
120 * Exactly the same as consecutive calls to
121 * \c mbedtls_platform_zeroize() and \c mbedtls_free(), but has a
122 * code size savings, and potential for optimisation in the future.
123 *
124 * \param buf Buffer to be zeroized then freed. May be \c NULL.
125 * \param len Length of the buffer in bytes
126 */
127void mbedtls_zeroize_and_free(void *buf, size_t len);
128
Gilles Peskine42649d92022-11-23 14:15:57 +0100129/** Return an offset into a buffer.
130 *
131 * This is just the addition of an offset to a pointer, except that this
132 * function also accepts an offset of 0 into a buffer whose pointer is null.
Gilles Peskine7d237782022-11-25 13:34:59 +0100133 * (`p + n` has undefined behavior when `p` is null, even when `n == 0`.
134 * A null pointer is a valid buffer pointer when the size is 0, for example
135 * as the result of `malloc(0)` on some platforms.)
Gilles Peskine42649d92022-11-23 14:15:57 +0100136 *
137 * \param p Pointer to a buffer of at least n bytes.
138 * This may be \p NULL if \p n is zero.
139 * \param n An offset in bytes.
140 * \return Pointer to offset \p n in the buffer \p p.
141 * Note that this is only a valid pointer if the size of the
142 * buffer is at least \p n + 1.
143 */
144static inline unsigned char *mbedtls_buffer_offset(
Gilles Peskine449bd832023-01-11 14:50:10 +0100145 unsigned char *p, size_t n)
Gilles Peskine42649d92022-11-23 14:15:57 +0100146{
Gilles Peskine449bd832023-01-11 14:50:10 +0100147 return p == NULL ? NULL : p + n;
Gilles Peskine42649d92022-11-23 14:15:57 +0100148}
149
150/** Return an offset into a read-only buffer.
151 *
Gilles Peskine7d237782022-11-25 13:34:59 +0100152 * Similar to mbedtls_buffer_offset(), but for const pointers.
Gilles Peskine42649d92022-11-23 14:15:57 +0100153 *
154 * \param p Pointer to a buffer of at least n bytes.
155 * This may be \p NULL if \p n is zero.
156 * \param n An offset in bytes.
157 * \return Pointer to offset \p n in the buffer \p p.
158 * Note that this is only a valid pointer if the size of the
159 * buffer is at least \p n + 1.
160 */
161static inline const unsigned char *mbedtls_buffer_offset_const(
Gilles Peskine449bd832023-01-11 14:50:10 +0100162 const unsigned char *p, size_t n)
Gilles Peskine42649d92022-11-23 14:15:57 +0100163{
Gilles Peskine449bd832023-01-11 14:50:10 +0100164 return p == NULL ? NULL : p + n;
Gilles Peskine42649d92022-11-23 14:15:57 +0100165}
166
Dave Rodgmanc3d80412022-11-22 15:01:39 +0000167/**
168 * Perform a fast block XOR operation, such that
169 * r[i] = a[i] ^ b[i] where 0 <= i < n
170 *
171 * \param r Pointer to result (buffer of at least \p n bytes). \p r
172 * may be equal to either \p a or \p b, but behaviour when
173 * it overlaps in other ways is undefined.
174 * \param a Pointer to input (buffer of at least \p n bytes)
175 * \param b Pointer to input (buffer of at least \p n bytes)
176 * \param n Number of bytes to process.
177 */
Gilles Peskine449bd832023-01-11 14:50:10 +0100178inline void mbedtls_xor(unsigned char *r, const unsigned char *a, const unsigned char *b, size_t n)
Dave Rodgmanc3d80412022-11-22 15:01:39 +0000179{
Dave Rodgmanb9cd19b2022-12-30 21:32:03 +0000180 size_t i = 0;
181#if defined(MBEDTLS_EFFICIENT_UNALIGNED_ACCESS)
Dave Rodgman3f47b3f2023-05-23 16:11:22 +0100182#if defined(__ARM_NEON)
Dave Rodgman6f40f8b2023-05-22 18:21:20 +0100183 for (; (i + 16) <= n; i += 16) {
Dave Rodgmanf32176c2023-06-09 16:25:49 +0100184 uint8x16_t v1 = vld1q_u8(a + i);
185 uint8x16_t v2 = vld1q_u8(b + i);
Dave Rodgman2070c202023-06-07 16:25:58 +0100186 uint8x16_t x = veorq_u8(v1, v2);
Dave Rodgmanf32176c2023-06-09 16:25:49 +0100187 vst1q_u8(r + i, x);
Dave Rodgman6f40f8b2023-05-22 18:21:20 +0100188 }
189#elif defined(__amd64__) || defined(__x86_64__) || defined(__aarch64__)
Dave Rodgman0805ad12023-05-19 11:48:10 +0100190 /* This codepath probably only makes sense on architectures with 64-bit registers */
191 for (; (i + 8) <= n; i += 8) {
192 uint64_t x = mbedtls_get_unaligned_uint64(a + i) ^ mbedtls_get_unaligned_uint64(b + i);
193 mbedtls_put_unaligned_uint64(r + i, x);
194 }
Dave Rodgman5c394ff2023-06-09 20:10:36 +0100195#else
Dave Rodgmanb9cd19b2022-12-30 21:32:03 +0000196 for (; (i + 4) <= n; i += 4) {
Gilles Peskine449bd832023-01-11 14:50:10 +0100197 uint32_t x = mbedtls_get_unaligned_uint32(a + i) ^ mbedtls_get_unaligned_uint32(b + i);
198 mbedtls_put_unaligned_uint32(r + i, x);
Dave Rodgmanc3d80412022-11-22 15:01:39 +0000199 }
Dave Rodgmanb9cd19b2022-12-30 21:32:03 +0000200#endif
Dave Rodgman5c394ff2023-06-09 20:10:36 +0100201#endif
Gilles Peskine449bd832023-01-11 14:50:10 +0100202 for (; i < n; i++) {
Dave Rodgmanc3d80412022-11-22 15:01:39 +0000203 r[i] = a[i] ^ b[i];
204 }
205}
206
Dave Rodgman03bb5262023-06-15 18:43:24 +0100207/**
208 * Perform a fast block XOR operation, such that
209 * r[i] = a[i] ^ b[i] where 0 <= i < n
210 *
211 * In some situations, this can perform better than mbedtls_xor (e.g., it's about 5%
212 * better in AES-CBC).
213 *
214 * \param r Pointer to result (buffer of at least \p n bytes). \p r
215 * may be equal to either \p a or \p b, but behaviour when
216 * it overlaps in other ways is undefined.
217 * \param a Pointer to input (buffer of at least \p n bytes)
218 * \param b Pointer to input (buffer of at least \p n bytes)
219 * \param n Number of bytes to process.
220 */
Dave Rodgman2dd15b32023-06-15 20:27:53 +0100221static inline void mbedtls_xor_no_simd(unsigned char *r,
222 const unsigned char *a,
223 const unsigned char *b,
224 size_t n)
Dave Rodgman03bb5262023-06-15 18:43:24 +0100225{
226 size_t i = 0;
227#if defined(MBEDTLS_EFFICIENT_UNALIGNED_ACCESS)
228#if defined(__amd64__) || defined(__x86_64__) || defined(__aarch64__)
229 /* This codepath probably only makes sense on architectures with 64-bit registers */
230 for (; (i + 8) <= n; i += 8) {
231 uint64_t x = mbedtls_get_unaligned_uint64(a + i) ^ mbedtls_get_unaligned_uint64(b + i);
232 mbedtls_put_unaligned_uint64(r + i, x);
233 }
234#else
235 for (; (i + 4) <= n; i += 4) {
236 uint32_t x = mbedtls_get_unaligned_uint32(a + i) ^ mbedtls_get_unaligned_uint32(b + i);
237 mbedtls_put_unaligned_uint32(r + i, x);
238 }
239#endif
240#endif
241 for (; i < n; i++) {
242 r[i] = a[i] ^ b[i];
243 }
244}
245
Jerry Yu6c983522021-09-24 12:45:36 +0800246/* Fix MSVC C99 compatible issue
247 * MSVC support __func__ from visual studio 2015( 1900 )
248 * Use MSVC predefine macro to avoid name check fail.
249 */
Gilles Peskine449bd832023-01-11 14:50:10 +0100250#if (defined(_MSC_VER) && (_MSC_VER <= 1900))
Jerry Yud52398d2021-09-28 16:13:44 +0800251#define /*no-check-names*/ __func__ __FUNCTION__
Jerry Yu6c983522021-09-24 12:45:36 +0800252#endif
253
Dave Rodgmanfa960262023-01-10 11:14:02 +0000254/* Define `asm` for compilers which don't define it. */
255/* *INDENT-OFF* */
256#ifndef asm
257#define asm __asm__
258#endif
259/* *INDENT-ON* */
260
Dave Rodgman0400ae22023-06-21 16:14:46 +0100261/*
Dave Rodgman28e2ca52023-06-27 15:25:38 +0100262 * Define the constraint used for read-only pointer operands to aarch64 asm.
Dave Rodgman0400ae22023-06-21 16:14:46 +0100263 *
264 * This is normally the usual "r", but for aarch64_32 (aka ILP32,
265 * as found in watchos), "p" is required to avoid warnings from clang.
Dave Rodgmane6c99962023-06-21 21:16:23 +0100266 *
267 * Note that clang does not recognise '+p' or '=p', and armclang
Dave Rodgman28e2ca52023-06-27 15:25:38 +0100268 * does not recognise 'p' at all. Therefore, to update a pointer from
269 * aarch64 assembly, it is necessary to use something like:
270 *
271 * uintptr_t uptr = (uintptr_t) ptr;
272 * asm( "ldr x4, [%x0], #8" ... : "+r" (uptr) : : )
273 * ptr = (void*) uptr;
274 *
275 * Note that the "x" in "%x0" is neccessary; writing "%0" will cause warnings.
Dave Rodgman0400ae22023-06-21 16:14:46 +0100276 */
277#if defined(__aarch64__) && defined(MBEDTLS_HAVE_ASM)
278#if UINTPTR_MAX == 0xfffffffful
279/* ILP32: Specify the pointer operand slightly differently, as per #7787. */
280#define MBEDTLS_ASM_AARCH64_PTR_CONSTRAINT "p"
281#elif UINTPTR_MAX == 0xfffffffffffffffful
282/* Normal case (64-bit pointers): use "r" as the constraint for pointer operands to asm */
283#define MBEDTLS_ASM_AARCH64_PTR_CONSTRAINT "r"
284#else
285#error Unrecognised pointer size for aarch64
286#endif
287#endif
288
Tom Cosgrove6ef9bb32023-03-08 14:19:51 +0000289/* Always provide a static assert macro, so it can be used unconditionally.
Tom Cosgrove57f04b82023-03-14 12:03:47 +0000290 * It will expand to nothing on some systems.
Tom Cosgrove6ef9bb32023-03-08 14:19:51 +0000291 * Can be used outside functions (but don't add a trailing ';' in that case:
292 * the semicolon is included here to avoid triggering -Wextra-semi when
293 * MBEDTLS_STATIC_ASSERT() expands to nothing).
294 * Can't use the C11-style `defined(static_assert)` on FreeBSD, since it
295 * defines static_assert even with -std=c99, but then complains about it.
296 */
297#if defined(static_assert) && !defined(__FreeBSD__)
298#define MBEDTLS_STATIC_ASSERT(expr, msg) static_assert(expr, msg);
Tom Cosgrove6ef9bb32023-03-08 14:19:51 +0000299#else
300#define MBEDTLS_STATIC_ASSERT(expr, msg)
301#endif
302
Dave Rodgman360e04f2023-06-09 17:18:32 +0100303/* Define compiler branch hints */
304#if defined(__has_builtin)
305#if __has_builtin(__builtin_expect)
Dave Rodgman159dc092023-06-09 19:46:07 +0100306#define MBEDTLS_LIKELY(x) __builtin_expect((x), 1)
307#define MBEDTLS_UNLIKELY(x) __builtin_expect((x), 0)
Dave Rodgman360e04f2023-06-09 17:18:32 +0100308#endif
309#endif
310#if !defined(MBEDTLS_LIKELY)
311#define MBEDTLS_LIKELY(x) x
312#define MBEDTLS_UNLIKELY(x) x
313#endif
314
Dave Rodgman7fdfd702023-06-15 18:42:25 +0100315#if defined(__GNUC__) && !defined(__ARMCC_VERSION) && !defined(__clang__) \
316 && !defined(__llvm__) && !defined(__INTEL_COMPILER)
317/* Defined if the compiler really is gcc and not clang, etc */
318#define MBEDTLS_COMPILER_IS_GCC
319#endif
320
Dave Rodgman9bb7e6f2023-06-16 09:41:21 +0100321/* For gcc -Os, override with -O2 for a given function.
322 *
323 * This will not affect behaviour for other optimisation settings, e.g. -O0.
324 */
Dave Rodgmanb055f752023-06-15 18:42:59 +0100325#if defined(MBEDTLS_COMPILER_IS_GCC) && defined(__OPTIMIZE_SIZE__)
Dave Rodgman9bb7e6f2023-06-16 09:41:21 +0100326#define MBEDTLS_OPTIMIZE_FOR_PERFORMANCE __attribute__((optimize("-O2")))
Dave Rodgmanb055f752023-06-15 18:42:59 +0100327#else
Dave Rodgman9bb7e6f2023-06-16 09:41:21 +0100328#define MBEDTLS_OPTIMIZE_FOR_PERFORMANCE
Dave Rodgmanb055f752023-06-15 18:42:59 +0100329#endif
330
Gilles Peskinec4672fd2019-09-11 13:39:11 +0200331#endif /* MBEDTLS_LIBRARY_COMMON_H */