blob: 6d8a06a3221c142a67433add89ac829919c19226 [file] [log] [blame]
Scott Branden53d9c9c2017-04-10 11:45:52 -07001/*
Manish V Badarkheaf1dd6e2025-03-09 11:51:21 +00002 * Copyright (c) 2016-2025, Arm Limited and Contributors. All rights reserved.
Varun Wadekard4b29102020-02-13 13:07:12 -08003 * Copyright (c) 2020, NVIDIA Corporation. All rights reserved.
Scott Branden53d9c9c2017-04-10 11:45:52 -07004 *
dp-arm82cb2c12017-05-03 09:38:09 +01005 * SPDX-License-Identifier: BSD-3-Clause
Scott Branden53d9c9c2017-04-10 11:45:52 -07006 */
7
Antonio Nino Diazf00119d2018-07-18 13:23:07 +01008#ifndef UTILS_DEF_H
9#define UTILS_DEF_H
Scott Branden53d9c9c2017-04-10 11:45:52 -070010
Julius Werner57bf6052019-05-28 21:03:58 -070011#include <export/lib/utils_def_exp.h>
12
Scott Branden53d9c9c2017-04-10 11:45:52 -070013/* Compute the number of elements in the given array */
14#define ARRAY_SIZE(a) \
15 (sizeof(a) / sizeof((a)[0]))
16
17#define IS_POWER_OF_TWO(x) \
18 (((x) & ((x) - 1)) == 0)
19
John Powell3443a702020-03-20 14:21:05 -050020#define SIZE_FROM_LOG2_WORDS(n) (U(4) << (n))
Scott Branden53d9c9c2017-04-10 11:45:52 -070021
Ghennadi Procopciuc0605b7e2024-06-18 09:41:29 +030022#if defined(__LINKER__) || defined(__ASSEMBLER__)
Yann Gautier167c5f82018-06-14 13:28:31 +020023#define BIT_32(nr) (U(1) << (nr))
24#define BIT_64(nr) (ULL(1) << (nr))
Ghennadi Procopciuc0605b7e2024-06-18 09:41:29 +030025#else
26#define BIT_32(nr) (((uint32_t)(1U)) << (nr))
27#define BIT_64(nr) (((uint64_t)(1ULL)) << (nr))
28#endif
Yann Gautier167c5f82018-06-14 13:28:31 +020029
Julius Werner402b3cf2019-07-09 14:02:43 -070030#ifdef __aarch64__
Yann Gautier167c5f82018-06-14 13:28:31 +020031#define BIT BIT_64
Julius Werner402b3cf2019-07-09 14:02:43 -070032#else
33#define BIT BIT_32
Yann Gautier167c5f82018-06-14 13:28:31 +020034#endif
Scott Branden53d9c9c2017-04-10 11:45:52 -070035
Soby Mathewebf1ca12017-07-13 15:19:51 +010036/*
Ghennadi Procopciuc8f375e42024-06-26 19:37:18 +030037 * Create a contiguous bitmask starting at bit position @low and ending at
38 * position @high. For example
Yann Gautier39676352018-06-14 18:35:33 +020039 * GENMASK_64(39, 21) gives us the 64bit vector 0x000000ffffe00000.
40 */
Julius Wernerd5dfdeb2019-07-09 13:49:11 -070041#if defined(__LINKER__) || defined(__ASSEMBLER__)
Ghennadi Procopciuc8f375e42024-06-26 19:37:18 +030042#define GENMASK_32(high, low) \
43 (((0xFFFFFFFF) << (low)) & (0xFFFFFFFF >> (32 - 1 - (high))))
Yann Gautier46c613e2018-11-15 09:49:24 +010044
Ghennadi Procopciuc8f375e42024-06-26 19:37:18 +030045#define GENMASK_64(high, low) \
46 ((~0 << (low)) & (~0 >> (64 - 1 - (high))))
Yann Gautier46c613e2018-11-15 09:49:24 +010047#else
Ghennadi Procopciuc8f375e42024-06-26 19:37:18 +030048#define GENMASK_32(high, low) \
49 ((~UINT32_C(0) >> (32U - 1U - (high))) ^ ((BIT_32(low) - 1U)))
Yann Gautier39676352018-06-14 18:35:33 +020050
Ghennadi Procopciuc8f375e42024-06-26 19:37:18 +030051#define GENMASK_64(high, low) \
52 ((~UINT64_C(0) >> (64U - 1U - (high))) ^ ((BIT_64(low) - 1U)))
Yann Gautier46c613e2018-11-15 09:49:24 +010053#endif
Yann Gautier39676352018-06-14 18:35:33 +020054
Julius Werner402b3cf2019-07-09 14:02:43 -070055#ifdef __aarch64__
Yann Gautier39676352018-06-14 18:35:33 +020056#define GENMASK GENMASK_64
Julius Werner402b3cf2019-07-09 14:02:43 -070057#else
58#define GENMASK GENMASK_32
Yann Gautier39676352018-06-14 18:35:33 +020059#endif
60
Boyan Karatotev5ee4deb2023-12-04 16:09:14 +000061#define HI(addr) (addr >> 32)
62#define LO(addr) (addr & 0xffffffff)
63
Yann Gautier39676352018-06-14 18:35:33 +020064/*
Soby Mathewebf1ca12017-07-13 15:19:51 +010065 * This variant of div_round_up can be used in macro definition but should not
66 * be used in C code as the `div` parameter is evaluated twice.
67 */
68#define DIV_ROUND_UP_2EVAL(n, d) (((n) + (d) - 1) / (d))
69
Julius Werner7baa7bc2018-01-22 13:56:13 -080070#define div_round_up(val, div) __extension__ ({ \
71 __typeof__(div) _div = (div); \
Sathees Balyad47509d2018-09-19 14:23:03 +010072 ((val) + _div - (__typeof__(div)) 1) / _div; \
Julius Werner7baa7bc2018-01-22 13:56:13 -080073})
74
Scott Branden53d9c9c2017-04-10 11:45:52 -070075#define MIN(x, y) __extension__ ({ \
76 __typeof__(x) _x = (x); \
77 __typeof__(y) _y = (y); \
78 (void)(&_x == &_y); \
Yann Gautier8406db12022-11-18 15:00:43 +010079 (_x < _y) ? _x : _y; \
Scott Branden53d9c9c2017-04-10 11:45:52 -070080})
81
82#define MAX(x, y) __extension__ ({ \
83 __typeof__(x) _x = (x); \
84 __typeof__(y) _y = (y); \
85 (void)(&_x == &_y); \
Yann Gautier8406db12022-11-18 15:00:43 +010086 (_x > _y) ? _x : _y; \
Scott Branden53d9c9c2017-04-10 11:45:52 -070087})
88
Lionel Debievee76d9fc2020-01-02 11:14:16 +010089#define CLAMP(x, min, max) __extension__ ({ \
90 __typeof__(x) _x = (x); \
91 __typeof__(min) _min = (min); \
92 __typeof__(max) _max = (max); \
93 (void)(&_x == &_min); \
94 (void)(&_x == &_max); \
Yann Gautier8406db12022-11-18 15:00:43 +010095 ((_x > _max) ? _max : ((_x < _min) ? _min : _x)); \
Lionel Debievee76d9fc2020-01-02 11:14:16 +010096})
97
Scott Branden53d9c9c2017-04-10 11:45:52 -070098/*
99 * The round_up() macro rounds up a value to the given boundary in a
100 * type-agnostic yet type-safe manner. The boundary must be a power of two.
101 * In other words, it computes the smallest multiple of boundary which is
102 * greater than or equal to value.
103 *
104 * round_down() is similar but rounds the value down instead.
105 */
106#define round_boundary(value, boundary) \
107 ((__typeof__(value))((boundary) - 1))
108
109#define round_up(value, boundary) \
110 ((((value) - 1) | round_boundary(value, boundary)) + 1)
111
112#define round_down(value, boundary) \
113 ((value) & ~round_boundary(value, boundary))
114
Raymond Mao3ba2c152023-07-25 07:53:35 -0700115/* add operation together with checking whether the operation overflowed
116 * The result is '*res',
117 * return 0 on success and 1 on overflow
118 */
119#define add_overflow(a, b, res) __builtin_add_overflow((a), (b), (res))
120
121/*
122 * Round up a value to align with a given size and
123 * check whether overflow happens.
124 * The rounduped value is '*res',
125 * return 0 on success and 1 on overflow
126 */
127#define round_up_overflow(v, size, res) (__extension__({ \
128 typeof(res) __res = res; \
129 typeof(*(__res)) __roundup_tmp = 0; \
130 typeof(v) __roundup_mask = (typeof(v))(size) - 1; \
131 \
132 add_overflow((v), __roundup_mask, &__roundup_tmp) ? 1 : \
133 (void)(*(__res) = __roundup_tmp & ~__roundup_mask), 0; \
134}))
135
136/*
137 * Add a with b, then round up the result to align with a given size and
138 * check whether overflow happens.
139 * The rounduped value is '*res',
140 * return 0 on success and 1 on overflow
141 */
142#define add_with_round_up_overflow(a, b, size, res) (__extension__({ \
143 typeof(a) __a = (a); \
144 typeof(__a) __add_res = 0; \
145 \
146 add_overflow((__a), (b), &__add_res) ? 1 : \
147 round_up_overflow(__add_res, (size), (res)) ? 1 : 0; \
148}))
149
Marc Bonnici7e804f92022-04-19 17:42:53 +0100150/**
151 * Helper macro to ensure a value lies on a given boundary.
152 */
153#define is_aligned(value, boundary) \
154 (round_up((uintptr_t) value, boundary) == \
155 round_down((uintptr_t) value, boundary))
156
Scott Branden53d9c9c2017-04-10 11:45:52 -0700157/*
158 * Evaluates to 1 if (ptr + inc) overflows, 0 otherwise.
159 * Both arguments must be unsigned pointer values (i.e. uintptr_t).
160 */
Antonio Nino Diazf00119d2018-07-18 13:23:07 +0100161#define check_uptr_overflow(_ptr, _inc) \
162 ((_ptr) > (UINTPTR_MAX - (_inc)))
Scott Branden53d9c9c2017-04-10 11:45:52 -0700163
164/*
Jeenu Viswambharan30d81c32017-12-07 08:43:05 +0000165 * Evaluates to 1 if (u32 + inc) overflows, 0 otherwise.
166 * Both arguments must be 32-bit unsigned integers (i.e. effectively uint32_t).
167 */
Antonio Nino Diazf00119d2018-07-18 13:23:07 +0100168#define check_u32_overflow(_u32, _inc) \
169 ((_u32) > (UINT32_MAX - (_inc)))
Jeenu Viswambharan30d81c32017-12-07 08:43:05 +0000170
Julius Werner155a1002017-12-12 14:23:26 -0800171/* Register size of the current architecture. */
Julius Werner402b3cf2019-07-09 14:02:43 -0700172#ifdef __aarch64__
Julius Werner155a1002017-12-12 14:23:26 -0800173#define REGSZ U(8)
Julius Werner402b3cf2019-07-09 14:02:43 -0700174#else
175#define REGSZ U(4)
Julius Werner155a1002017-12-12 14:23:26 -0800176#endif
177
Jeenu Viswambharanf45e2322017-08-16 11:44:25 +0100178/*
179 * Test for the current architecture version to be at least the version
180 * expected.
181 */
182#define ARM_ARCH_AT_LEAST(_maj, _min) \
Jeenu Viswambharan0cc7aa82018-04-27 15:06:57 +0100183 ((ARM_ARCH_MAJOR > (_maj)) || \
184 ((ARM_ARCH_MAJOR == (_maj)) && (ARM_ARCH_MINOR >= (_min))))
Jeenu Viswambharanf45e2322017-08-16 11:44:25 +0100185
Joel Hutton9f85f9e2018-03-21 11:40:57 +0000186/*
187 * Import an assembly or linker symbol as a C expression with the specified
188 * type
189 */
190#define IMPORT_SYM(type, sym, name) \
191 extern char sym[];\
192 static const __attribute__((unused)) type name = (type) sym;
193
194/*
195 * When the symbol is used to hold a pointer, its alignment can be asserted
196 * with this macro. For example, if there is a linker symbol that is going to
197 * be used as a 64-bit pointer, the value of the linker symbol must also be
198 * aligned to 64 bit. This macro makes sure this is the case.
199 */
200#define ASSERT_SYM_PTR_ALIGN(sym) assert(((size_t)(sym) % __alignof__(*(sym))) == 0)
201
Antonio Nino Diaz932b3ae2018-11-22 15:53:17 +0000202#define COMPILER_BARRIER() __asm__ volatile ("" ::: "memory")
Joel Hutton9f85f9e2018-03-21 11:40:57 +0000203
Joel Hutton9edd8912018-10-09 14:08:42 +0100204/* Compiler builtin of GCC >= 9 and planned in llvm */
205#ifdef __HAVE_SPECULATION_SAFE_VALUE
206# define SPECULATION_SAFE_VALUE(var) __builtin_speculation_safe_value(var)
207#else
208# define SPECULATION_SAFE_VALUE(var) var
209#endif
210
Varun Wadekard4b29102020-02-13 13:07:12 -0800211/*
212 * Ticks elapsed in one second with a signal of 1 MHz
213 */
214#define MHZ_TICKS_PER_SEC U(1000000)
215
Pankaj Gupta447a42e2020-12-09 14:02:38 +0530216/*
217 * Ticks elapsed in one second with a signal of 1 KHz
218 */
219#define KHZ_TICKS_PER_SEC U(1000)
220
Manish V Badarkheaf1dd6e2025-03-09 11:51:21 +0000221/**
222 * EXTRACT_FIELD - Extracts a specific bit field from a value.
223 *
224 * @val: The input value containing the field.
225 * @mask: A bitmask representing the maximum value of the field
226 * @shift: The starting bit position of the field.
227 *
228 * This macro shifts the input value (@val) to the right by @shift bits,
229 * aligning the target field to the least significant bits (LSB).
230 * It then applies @mask to extract only the relevant bits.
231 */
232#define EXTRACT_FIELD(val, mask, shift) (((val) >> (shift)) & (mask))
233
Antonio Nino Diazf00119d2018-07-18 13:23:07 +0100234#endif /* UTILS_DEF_H */