14#ifndef ZEPHYR_INCLUDE_SYS_UTIL_H_
15#define ZEPHYR_INCLUDE_SYS_UTIL_H_
33#define NUM_BITS(t) (sizeof(t) * 8)
48#define POINTER_TO_UINT(x) ((uintptr_t) (x))
50#define UINT_TO_POINTER(x) ((void *) (uintptr_t) (x))
52#define POINTER_TO_INT(x) ((intptr_t) (x))
54#define INT_TO_POINTER(x) ((void *) (intptr_t) (x))
56#if !(defined(__CHAR_BIT__) && defined(__SIZEOF_LONG__) && defined(__SIZEOF_LONG_LONG__))
57# error Missing required predefined macros for BITS_PER_LONG calculation
61#define BITS_PER_LONG (__CHAR_BIT__ * __SIZEOF_LONG__)
64#define BITS_PER_LONG_LONG (__CHAR_BIT__ * __SIZEOF_LONG_LONG__)
70#define GENMASK(h, l) \
71 (((~0UL) - (1UL << (l)) + 1) & (~0UL >> (BITS_PER_LONG - 1 - (h))))
77#define GENMASK64(h, l) \
78 (((~0ULL) - (1ULL << (l)) + 1) & (~0ULL >> (BITS_PER_LONG_LONG - 1 - (h))))
81#define ZERO_OR_COMPILE_ERROR(cond) ((int) sizeof(char[1 - 2 * !(cond)]) - 1)
83#if defined(__cplusplus)
88#define ARRAY_SIZE(array) (sizeof(array) / sizeof((array)[0]))
97#define IS_ARRAY(array) \
98 ZERO_OR_COMPILE_ERROR( \
99 !__builtin_types_compatible_p(__typeof__(array), \
100 __typeof__(&(array)[0])))
111#define ARRAY_SIZE(array) \
112 ((size_t) (IS_ARRAY(array) + (sizeof(array) / sizeof((array)[0]))))
133#define FLEXIBLE_ARRAY_DECLARE(type, name) \
135 struct { } __unused_##name; \
153#define IS_ARRAY_ELEMENT(array, ptr) \
154 ((ptr) && POINTER_TO_UINT(array) <= POINTER_TO_UINT(ptr) && \
155 POINTER_TO_UINT(ptr) < POINTER_TO_UINT(&(array)[ARRAY_SIZE(array)]) && \
156 (POINTER_TO_UINT(ptr) - POINTER_TO_UINT(array)) % sizeof((array)[0]) == 0)
172#define ARRAY_INDEX(array, ptr) \
174 __ASSERT_NO_MSG(IS_ARRAY_ELEMENT(array, ptr)); \
175 (__typeof__((array)[0]) *)(ptr) - (array); \
188#define PART_OF_ARRAY(array, ptr) \
189 ((ptr) && POINTER_TO_UINT(array) <= POINTER_TO_UINT(ptr) && \
190 POINTER_TO_UINT(ptr) < POINTER_TO_UINT(&(array)[ARRAY_SIZE(array)]))
209#define ARRAY_INDEX_FLOOR(array, ptr) \
211 __ASSERT_NO_MSG(PART_OF_ARRAY(array, ptr)); \
212 (POINTER_TO_UINT(ptr) - POINTER_TO_UINT(array)) / sizeof((array)[0]); \
221#define ARRAY_FOR_EACH(array, idx) for (size_t idx = 0; (idx) < ARRAY_SIZE(array); ++(idx))
229#define ARRAY_FOR_EACH_PTR(array, ptr) \
230 for (__typeof__(*(array)) *ptr = (array); (size_t)((ptr) - (array)) < ARRAY_SIZE(array); \
240#define SAME_TYPE(a, b) __builtin_types_compatible_p(__typeof__(a), __typeof__(b))
246#define CONTAINER_OF_VALIDATE(ptr, type, field) \
247 BUILD_ASSERT(SAME_TYPE(*(ptr), ((type *)0)->field) || \
248 SAME_TYPE(*(ptr), void), \
249 "pointer type mismatch in CONTAINER_OF");
251#define CONTAINER_OF_VALIDATE(ptr, type, field)
275#define CONTAINER_OF(ptr, type, field) \
277 CONTAINER_OF_VALIDATE(ptr, type, field) \
278 ((type *)(((char *)(ptr)) - offsetof(type, field))); \
289#define SIZEOF_FIELD(type, member) sizeof((((type *)0)->member))
303 UTIL_CAT(_CONCAT_, NUM_VA_ARGS_LESS_1(__VA_ARGS__))(__VA_ARGS__)
308#define IS_ALIGNED(ptr, align) (((uintptr_t)(ptr)) % (align) == 0)
313#define ROUND_UP(x, align) \
314 ((((unsigned long)(x) + ((unsigned long)(align) - 1)) / \
315 (unsigned long)(align)) * (unsigned long)(align))
320#define ROUND_DOWN(x, align) \
321 (((unsigned long)(x) / (unsigned long)(align)) * (unsigned long)(align))
324#define WB_UP(x) ROUND_UP(x, sizeof(void *))
327#define WB_DN(x) ROUND_DOWN(x, sizeof(void *))
343#define DIV_ROUND_UP(n, d) (((n) + (d) - 1) / (d))
360#define DIV_ROUND_CLOSEST(n, d) \
361 ((((n) < 0) ^ ((d) < 0)) ? ((n) - ((d) / 2)) / (d) : \
362 ((n) + ((d) / 2)) / (d))
376#define MAX(a, b) (((a) > (b)) ? (a) : (b))
391#define MIN(a, b) (((a) < (b)) ? (a) : (b))
407#define CLAMP(val, low, high) (((val) <= (low)) ? (low) : MIN(val, high))
422#define IN_RANGE(val, min, max) ((val) >= (min) && (val) <= (max))
474 sign_ext = (value >> 63) & 1;
477 sign_ext = -sign_ext;
480 return (value >> shift) | (sign_ext << (64 - shift));
492static inline void bytecpy(
void *dst,
const void *src,
size_t size)
496 for (i = 0; i < size; ++i) {
497 ((
volatile uint8_t *)dst)[i] = ((
volatile const uint8_t *)src)[i];
511static inline void byteswp(
void *a,
void *b,
size_t size)
517 for (; size > 0; --size) {
577 return ((10 * (bcd >> 4)) + (bcd & 0x0F));
589 return (((bin / 10) << 4) | (bin % 10));
615 __ASSERT_NO_MSG(index <= 31);
619 return (
int32_t)(value << shift) >> shift;
630 __ASSERT_NO_MSG(index <= 63);
634 return (
int64_t)(value << shift) >> shift;
679#define __z_log2d(x) (32 - __builtin_clz(x) - 1)
680#define __z_log2q(x) (64 - __builtin_clzll(x) - 1)
681#define __z_log2(x) (sizeof(__typeof__(x)) > 4 ? __z_log2q(x) : __z_log2d(x))
693#define LOG2(x) ((x) < 1 ? -1 : __z_log2(x))
705#define LOG2CEIL(x) ((x) < 1 ? 0 : __z_log2((x)-1) + 1)
719#define NHPOT(x) ((x) < 1 ? 1 : ((x) > (1ULL<<63) ? 0 : 1ULL << LOG2CEIL(x)))
733#define Z_DETECT_POINTER_OVERFLOW(addr, buflen) \
734 (((buflen) != 0) && \
735 ((UINTPTR_MAX - (uintptr_t)(addr)) <= ((uintptr_t)((buflen) - 1))))
748 *dst++ = *src1++ ^ *src2++;
790#define KB(x) ((x) << 10)
792#define KB(x) (((size_t)(x)) << 10)
795#define MB(x) (KB(x) << 10)
797#define GB(x) (MB(x) << 10)
800#define KHZ(x) ((x) * 1000)
802#define MHZ(x) (KHZ(x) * 1000)
816#if defined(CONFIG_ARCH_POSIX)
817#define Z_SPIN_DELAY(t) k_busy_wait(t)
819#define Z_SPIN_DELAY(t)
837#define WAIT_FOR(expr, timeout, delay_stmt) \
839 uint32_t _wf_cycle_count = k_us_to_cyc_ceil32(timeout); \
840 uint32_t _wf_start = k_cycle_get_32(); \
841 while (!(expr) && (_wf_cycle_count > (k_cycle_get_32() - _wf_start))) { \
irp nz macro MOVR cc s mov cc s endm endr irp aa
Definition asm-macro-32-bit-gnu.h:16
static int64_t sign_extend_64(uint64_t value, uint8_t index)
Sign extend a 64 bit value using the index bit as sign bit.
Definition util.h:628
char * utf8_trunc(char *utf8_str)
Properly truncate a NULL-terminated UTF-8 string.
static int64_t arithmetic_shift_right(int64_t value, uint8_t shift)
Arithmetic shift right.
Definition util.h:465
size_t hex2bin(const char *hex, size_t hexlen, uint8_t *buf, size_t buflen)
Convert a hexadecimal string into a binary array.
static void bytecpy(void *dst, const void *src, size_t size)
byte by byte memcpy.
Definition util.h:492
char * utf8_lcpy(char *dst, const char *src, size_t n)
Copies a UTF-8 encoded string from src to dst.
#define IS_POWER_OF_TWO(x)
Check if a x is a power of two.
Definition util_macro.h:77
static ALWAYS_INLINE bool is_null_no_warn(void *p)
Is p equal to NULL?
Definition util.h:453
static void mem_xor_128(uint8_t dst[16], const uint8_t src1[16], const uint8_t src2[16])
XOR 128 bits.
Definition util.h:771
static uint8_t bin2bcd(uint8_t bin)
Convert a binary value to binary coded decimal (BCD 8421).
Definition util.h:587
static void mem_xor_32(uint8_t dst[4], const uint8_t src1[4], const uint8_t src2[4])
XOR 32 bits.
Definition util.h:759
static void byteswp(void *a, void *b, size_t size)
byte by byte swap.
Definition util.h:511
static void mem_xor_n(uint8_t *dst, const uint8_t *src1, const uint8_t *src2, size_t len)
XOR n bytes.
Definition util.h:745
int hex2char(uint8_t x, char *c)
Convert a single hexadecimal nibble into a character.
static uint8_t bcd2bin(uint8_t bcd)
Convert a binary coded decimal (BCD 8421) value to binary.
Definition util.h:575
int char2hex(char c, uint8_t *x)
Convert a single character into a hexadecimal nibble.
uint8_t u8_to_dec(char *buf, uint8_t buflen, uint8_t value)
Convert a uint8_t into a decimal string representation.
static bool is_power_of_two(unsigned int x)
Is x a power of two?
Definition util.h:429
static int32_t sign_extend(uint32_t value, uint8_t index)
Sign extend an 8, 16 or 32 bit value using the index bit as sign bit.
Definition util.h:613
size_t bin2hex(const uint8_t *buf, size_t buflen, char *hex, size_t hexlen)
Convert a binary array into string representation.
__UINT32_TYPE__ uint32_t
Definition stdint.h:90
__INT32_TYPE__ int32_t
Definition stdint.h:74
__UINT64_TYPE__ uint64_t
Definition stdint.h:91
__UINT8_TYPE__ uint8_t
Definition stdint.h:88
__INT64_TYPE__ int64_t
Definition stdint.h:75