Zephyr Project API 4.0.0
A Scalable Open Source RTOS
Loading...
Searching...
No Matches
util.h
Go to the documentation of this file.
1/*
2 * Copyright (c) 2011-2014, Wind River Systems, Inc.
3 *
4 * SPDX-License-Identifier: Apache-2.0
5 */
6
14#ifndef ZEPHYR_INCLUDE_SYS_UTIL_H_
15#define ZEPHYR_INCLUDE_SYS_UTIL_H_
16
18#include <zephyr/toolchain.h>
19
20/* needs to be outside _ASMLANGUAGE so 'true' and 'false' can turn
21 * into '1' and '0' for asm or linker scripts
22 */
23#include <stdbool.h>
24
25#ifndef _ASMLANGUAGE
26
27#include <zephyr/sys/__assert.h>
28#include <zephyr/types.h>
29#include <stddef.h>
30#include <stdint.h>
31
33#define NUM_BITS(t) (sizeof(t) * 8)
34
35#ifdef __cplusplus
36extern "C" {
37#endif
38
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))
55
56#if !(defined(__CHAR_BIT__) && defined(__SIZEOF_LONG__) && defined(__SIZEOF_LONG_LONG__))
57# error Missing required predefined macros for BITS_PER_LONG calculation
58#endif
59
61#define BITS_PER_BYTE (__CHAR_BIT__)
62
64#define BITS_PER_NIBBLE (__CHAR_BIT__ / 2)
65
67#define NIBBLES_PER_BYTE (BITS_PER_BYTE / BITS_PER_NIBBLE)
68
70#define BITS_PER_LONG (__CHAR_BIT__ * __SIZEOF_LONG__)
71
73#define BITS_PER_LONG_LONG (__CHAR_BIT__ * __SIZEOF_LONG_LONG__)
74
79#define GENMASK(h, l) \
80 (((~0UL) - (1UL << (l)) + 1) & (~0UL >> (BITS_PER_LONG - 1 - (h))))
81
86#define GENMASK64(h, l) \
87 (((~0ULL) - (1ULL << (l)) + 1) & (~0ULL >> (BITS_PER_LONG_LONG - 1 - (h))))
88
90#define ZERO_OR_COMPILE_ERROR(cond) ((int) sizeof(char[1 - 2 * !(cond)]) - 1)
91
92#if defined(__cplusplus)
93
94/* The built-in function used below for type checking in C is not
95 * supported by GNU C++.
96 */
97#define ARRAY_SIZE(array) (sizeof(array) / sizeof((array)[0]))
98
99#else /* __cplusplus */
100
106#define IS_ARRAY(array) \
107 ZERO_OR_COMPILE_ERROR( \
108 !__builtin_types_compatible_p(__typeof__(array), \
109 __typeof__(&(array)[0])))
110
120#define ARRAY_SIZE(array) \
121 ((size_t) (IS_ARRAY(array) + (sizeof(array) / sizeof((array)[0]))))
122
123#endif /* __cplusplus */
124
142#define FLEXIBLE_ARRAY_DECLARE(type, name) \
143 struct { \
144 struct { } __unused_##name; \
145 type name[]; \
146 }
147
162#define IS_ARRAY_ELEMENT(array, ptr) \
163 ((ptr) && POINTER_TO_UINT(array) <= POINTER_TO_UINT(ptr) && \
164 POINTER_TO_UINT(ptr) < POINTER_TO_UINT(&(array)[ARRAY_SIZE(array)]) && \
165 (POINTER_TO_UINT(ptr) - POINTER_TO_UINT(array)) % sizeof((array)[0]) == 0)
166
181#define ARRAY_INDEX(array, ptr) \
182 ({ \
183 __ASSERT_NO_MSG(IS_ARRAY_ELEMENT(array, ptr)); \
184 (__typeof__((array)[0]) *)(ptr) - (array); \
185 })
186
197#define PART_OF_ARRAY(array, ptr) \
198 ((ptr) && POINTER_TO_UINT(array) <= POINTER_TO_UINT(ptr) && \
199 POINTER_TO_UINT(ptr) < POINTER_TO_UINT(&(array)[ARRAY_SIZE(array)]))
200
218#define ARRAY_INDEX_FLOOR(array, ptr) \
219 ({ \
220 __ASSERT_NO_MSG(PART_OF_ARRAY(array, ptr)); \
221 (POINTER_TO_UINT(ptr) - POINTER_TO_UINT(array)) / sizeof((array)[0]); \
222 })
223
230#define ARRAY_FOR_EACH(array, idx) for (size_t idx = 0; (idx) < ARRAY_SIZE(array); ++(idx))
231
238#define ARRAY_FOR_EACH_PTR(array, ptr) \
239 for (__typeof__(*(array)) *ptr = (array); (size_t)((ptr) - (array)) < ARRAY_SIZE(array); \
240 ++(ptr))
241
249#define SAME_TYPE(a, b) __builtin_types_compatible_p(__typeof__(a), __typeof__(b))
250
254#ifndef __cplusplus
255#define CONTAINER_OF_VALIDATE(ptr, type, field) \
256 BUILD_ASSERT(SAME_TYPE(*(ptr), ((type *)0)->field) || \
257 SAME_TYPE(*(ptr), void), \
258 "pointer type mismatch in CONTAINER_OF");
259#else
260#define CONTAINER_OF_VALIDATE(ptr, type, field)
261#endif
262
284#define CONTAINER_OF(ptr, type, field) \
285 ({ \
286 CONTAINER_OF_VALIDATE(ptr, type, field) \
287 ((type *)(((char *)(ptr)) - offsetof(type, field))); \
288 })
289
298#define SIZEOF_FIELD(type, member) sizeof((((type *)0)->member))
299
311#define CONCAT(...) \
312 UTIL_CAT(_CONCAT_, NUM_VA_ARGS_LESS_1(__VA_ARGS__))(__VA_ARGS__)
313
317#define IS_ALIGNED(ptr, align) (((uintptr_t)(ptr)) % (align) == 0)
318
322#define ROUND_UP(x, align) \
323 ((((unsigned long)(x) + ((unsigned long)(align) - 1)) / \
324 (unsigned long)(align)) * (unsigned long)(align))
325
329#define ROUND_DOWN(x, align) \
330 (((unsigned long)(x) / (unsigned long)(align)) * (unsigned long)(align))
331
333#define WB_UP(x) ROUND_UP(x, sizeof(void *))
334
336#define WB_DN(x) ROUND_DOWN(x, sizeof(void *))
337
352#define DIV_ROUND_UP(n, d) (((n) + (d) - 1) / (d))
353
369#define DIV_ROUND_CLOSEST(n, d) \
370 ((((n) < 0) ^ ((d) < 0)) ? ((n) - ((d) / 2)) / (d) : \
371 ((n) + ((d) / 2)) / (d))
372
373#ifndef MAX
385#define MAX(a, b) (((a) > (b)) ? (a) : (b))
386#endif
387
388#ifndef MIN
400#define MIN(a, b) (((a) < (b)) ? (a) : (b))
401#endif
402
403#ifndef CLAMP
416#define CLAMP(val, low, high) (((val) <= (low)) ? (low) : MIN(val, high))
417#endif
418
431#define IN_RANGE(val, min, max) ((val) >= (min) && (val) <= (max))
432
438static inline bool is_power_of_two(unsigned int x)
439{
440 return IS_POWER_OF_TWO(x);
441}
442
462static ALWAYS_INLINE bool is_null_no_warn(void *p)
463{
464 return p == NULL;
465}
466
475{
476 int64_t sign_ext;
477
478 if (shift == 0U) {
479 return value;
480 }
481
482 /* extract sign bit */
483 sign_ext = (value >> 63) & 1;
484
485 /* make all bits of sign_ext be the same as the value's sign bit */
486 sign_ext = -sign_ext;
487
488 /* shift value and fill opened bit positions with sign bit */
489 return (value >> shift) | (sign_ext << (64 - shift));
490}
491
501static inline void bytecpy(void *dst, const void *src, size_t size)
502{
503 size_t i;
504
505 for (i = 0; i < size; ++i) {
506 ((volatile uint8_t *)dst)[i] = ((volatile const uint8_t *)src)[i];
507 }
508}
509
520static inline void byteswp(void *a, void *b, size_t size)
521{
522 uint8_t t;
523 uint8_t *aa = (uint8_t *)a;
524 uint8_t *bb = (uint8_t *)b;
525
526 for (; size > 0; --size) {
527 t = *aa;
528 *aa++ = *bb;
529 *bb++ = t;
530 }
531}
532
541int char2hex(char c, uint8_t *x);
542
551int hex2char(uint8_t x, char *c);
552
563size_t bin2hex(const uint8_t *buf, size_t buflen, char *hex, size_t hexlen);
564
575size_t hex2bin(const char *hex, size_t hexlen, uint8_t *buf, size_t buflen);
576
584static inline uint8_t bcd2bin(uint8_t bcd)
585{
586 return ((10 * (bcd >> 4)) + (bcd & 0x0F));
587}
588
596static inline uint8_t bin2bcd(uint8_t bin)
597{
598 return (((bin / 10) << 4) | (bin % 10));
599}
600
614uint8_t u8_to_dec(char *buf, uint8_t buflen, uint8_t value);
615
622static inline int32_t sign_extend(uint32_t value, uint8_t index)
623{
624 __ASSERT_NO_MSG(index <= 31);
625
626 uint8_t shift = 31 - index;
627
628 return (int32_t)(value << shift) >> shift;
629}
630
637static inline int64_t sign_extend_64(uint64_t value, uint8_t index)
638{
639 __ASSERT_NO_MSG(index <= 63);
640
641 uint8_t shift = 63 - index;
642
643 return (int64_t)(value << shift) >> shift;
644}
645
670char *utf8_trunc(char *utf8_str);
671
686char *utf8_lcpy(char *dst, const char *src, size_t n);
687
688#define __z_log2d(x) (32 - __builtin_clz(x) - 1)
689#define __z_log2q(x) (64 - __builtin_clzll(x) - 1)
690#define __z_log2(x) (sizeof(__typeof__(x)) > 4 ? __z_log2q(x) : __z_log2d(x))
691
702#define LOG2(x) ((x) < 1 ? -1 : __z_log2(x))
703
714#define LOG2CEIL(x) ((x) < 1 ? 0 : __z_log2((x)-1) + 1)
715
728#define NHPOT(x) ((x) < 1 ? 1 : ((x) > (1ULL<<63) ? 0 : 1ULL << LOG2CEIL(x)))
729
742#define Z_DETECT_POINTER_OVERFLOW(addr, buflen) \
743 (((buflen) != 0) && \
744 ((UINTPTR_MAX - (uintptr_t)(addr)) <= ((uintptr_t)((buflen) - 1))))
745
754static inline void mem_xor_n(uint8_t *dst, const uint8_t *src1, const uint8_t *src2, size_t len)
755{
756 while (len--) {
757 *dst++ = *src1++ ^ *src2++;
758 }
759}
760
768static inline void mem_xor_32(uint8_t dst[4], const uint8_t src1[4], const uint8_t src2[4])
769{
770 mem_xor_n(dst, src1, src2, 4U);
771}
772
780static inline void mem_xor_128(uint8_t dst[16], const uint8_t src1[16], const uint8_t src2[16])
781{
782 mem_xor_n(dst, src1, src2, 16);
783}
784
785#ifdef __cplusplus
786}
787#endif
788
789/* This file must be included at the end of the !_ASMLANGUAGE guard.
790 * It depends on macros defined in this file above which cannot be forward declared.
791 */
793
794#endif /* !_ASMLANGUAGE */
795
797#ifdef _LINKER
798/* This is used in linker scripts so need to avoid type casting there */
799#define KB(x) ((x) << 10)
800#else
801#define KB(x) (((size_t)(x)) << 10)
802#endif
804#define MB(x) (KB(x) << 10)
806#define GB(x) (MB(x) << 10)
807
809#define KHZ(x) ((x) * 1000)
811#define MHZ(x) (KHZ(x) * 1000)
812
825#if defined(CONFIG_ARCH_POSIX)
826#define Z_SPIN_DELAY(t) k_busy_wait(t)
827#else
828#define Z_SPIN_DELAY(t)
829#endif
830
846#define WAIT_FOR(expr, timeout, delay_stmt) \
847 ({ \
848 uint32_t _wf_cycle_count = k_us_to_cyc_ceil32(timeout); \
849 uint32_t _wf_start = k_cycle_get_32(); \
850 while (!(expr) && (_wf_cycle_count > (k_cycle_get_32() - _wf_start))) { \
851 delay_stmt; \
852 Z_SPIN_DELAY(10); \
853 } \
854 (expr); \
855 })
856
861#endif /* ZEPHYR_INCLUDE_SYS_UTIL_H_ */
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:637
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:474
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:501
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:462
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:780
static uint8_t bin2bcd(uint8_t bin)
Convert a binary value to binary coded decimal (BCD 8421).
Definition util.h:596
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:768
static void byteswp(void *a, void *b, size_t size)
byte by byte swap.
Definition util.h:520
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:754
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:584
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:438
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:622
size_t bin2hex(const uint8_t *buf, size_t buflen, char *hex, size_t hexlen)
Convert a binary array into string representation.
#define ALWAYS_INLINE
Definition common.h:129
__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
Macros to abstract toolchain specific capabilities.
Macro utilities.