Zephyr API Documentation  3.5.0
A Scalable Open Source RTOS
3.5.0
All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Macros Modules Pages
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/types.h>
28#include <stddef.h>
29#include <stdint.h>
30
32#define NUM_BITS(t) (sizeof(t) * 8)
33
34#ifdef __cplusplus
35extern "C" {
36#endif
37
45#define POINTER_TO_UINT(x) ((uintptr_t) (x))
47#define UINT_TO_POINTER(x) ((void *) (uintptr_t) (x))
49#define POINTER_TO_INT(x) ((intptr_t) (x))
51#define INT_TO_POINTER(x) ((void *) (intptr_t) (x))
52
53#if !(defined(__CHAR_BIT__) && defined(__SIZEOF_LONG__) && defined(__SIZEOF_LONG_LONG__))
54# error Missing required predefined macros for BITS_PER_LONG calculation
55#endif
56
58#define BITS_PER_LONG (__CHAR_BIT__ * __SIZEOF_LONG__)
59
61#define BITS_PER_LONG_LONG (__CHAR_BIT__ * __SIZEOF_LONG_LONG__)
62
67#define GENMASK(h, l) \
68 (((~0UL) - (1UL << (l)) + 1) & (~0UL >> (BITS_PER_LONG - 1 - (h))))
69
74#define GENMASK64(h, l) \
75 (((~0ULL) - (1ULL << (l)) + 1) & (~0ULL >> (BITS_PER_LONG_LONG - 1 - (h))))
76
78#define LSB_GET(value) ((value) & -(value))
79
84#define FIELD_GET(mask, value) (((value) & (mask)) / LSB_GET(mask))
85
91#define FIELD_PREP(mask, value) (((value) * LSB_GET(mask)) & (mask))
92
94#define ZERO_OR_COMPILE_ERROR(cond) ((int) sizeof(char[1 - 2 * !(cond)]) - 1)
95
96#if defined(__cplusplus)
97
98/* The built-in function used below for type checking in C is not
99 * supported by GNU C++.
100 */
101#define ARRAY_SIZE(array) (sizeof(array) / sizeof((array)[0]))
102
103#else /* __cplusplus */
104
110#define IS_ARRAY(array) \
111 ZERO_OR_COMPILE_ERROR( \
112 !__builtin_types_compatible_p(__typeof__(array), \
113 __typeof__(&(array)[0])))
114
124#define ARRAY_SIZE(array) \
125 ((size_t) (IS_ARRAY(array) + (sizeof(array) / sizeof((array)[0]))))
126
127#endif /* __cplusplus */
128
143#define IS_ARRAY_ELEMENT(array, ptr) \
144 ((ptr) && POINTER_TO_UINT(array) <= POINTER_TO_UINT(ptr) && \
145 POINTER_TO_UINT(ptr) < POINTER_TO_UINT(&(array)[ARRAY_SIZE(array)]) && \
146 (POINTER_TO_UINT(ptr) - POINTER_TO_UINT(array)) % sizeof((array)[0]) == 0)
147
162#define ARRAY_INDEX(array, ptr) \
163 ({ \
164 __ASSERT_NO_MSG(IS_ARRAY_ELEMENT(array, ptr)); \
165 (__typeof__((array)[0]) *)(ptr) - (array); \
166 })
167
178#define PART_OF_ARRAY(array, ptr) \
179 ((ptr) && POINTER_TO_UINT(array) <= POINTER_TO_UINT(ptr) && \
180 POINTER_TO_UINT(ptr) < POINTER_TO_UINT(&(array)[ARRAY_SIZE(array)]))
181
199#define ARRAY_INDEX_FLOOR(array, ptr) \
200 ({ \
201 __ASSERT_NO_MSG(PART_OF_ARRAY(array, ptr)); \
202 (POINTER_TO_UINT(ptr) - POINTER_TO_UINT(array)) / sizeof((array)[0]); \
203 })
204
212#define SAME_TYPE(a, b) __builtin_types_compatible_p(__typeof__(a), __typeof__(b))
213
217#ifndef __cplusplus
218#define CONTAINER_OF_VALIDATE(ptr, type, field) \
219 BUILD_ASSERT(SAME_TYPE(*(ptr), ((type *)0)->field) || \
220 SAME_TYPE(*(ptr), void), \
221 "pointer type mismatch in CONTAINER_OF");
222#else
223#define CONTAINER_OF_VALIDATE(ptr, type, field)
224#endif
225
247#define CONTAINER_OF(ptr, type, field) \
248 ({ \
249 CONTAINER_OF_VALIDATE(ptr, type, field) \
250 ((type *)(((char *)(ptr)) - offsetof(type, field))); \
251 })
252
256#define ROUND_UP(x, align) \
257 ((((unsigned long)(x) + ((unsigned long)(align) - 1)) / \
258 (unsigned long)(align)) * (unsigned long)(align))
259
263#define ROUND_DOWN(x, align) \
264 (((unsigned long)(x) / (unsigned long)(align)) * (unsigned long)(align))
265
267#define WB_UP(x) ROUND_UP(x, sizeof(void *))
268
270#define WB_DN(x) ROUND_DOWN(x, sizeof(void *))
271
286#define DIV_ROUND_UP(n, d) (((n) + (d) - 1) / (d))
287
303#define DIV_ROUND_CLOSEST(n, d) \
304 ((((n) < 0) ^ ((d) < 0)) ? ((n) - ((d) / 2)) / (d) : \
305 ((n) + ((d) / 2)) / (d))
306
311#define ceiling_fraction(numerator, divider) __DEPRECATED_MACRO \
312 DIV_ROUND_UP(numerator, divider)
313
314#ifndef MAX
326#define MAX(a, b) (((a) > (b)) ? (a) : (b))
327#endif
328
329#ifndef MIN
341#define MIN(a, b) (((a) < (b)) ? (a) : (b))
342#endif
343
344#ifndef CLAMP
357#define CLAMP(val, low, high) (((val) <= (low)) ? (low) : MIN(val, high))
358#endif
359
372#define IN_RANGE(val, min, max) ((val) >= (min) && (val) <= (max))
373
379static inline bool is_power_of_two(unsigned int x)
380{
381 return IS_POWER_OF_TWO(x);
382}
383
392{
393 int64_t sign_ext;
394
395 if (shift == 0U) {
396 return value;
397 }
398
399 /* extract sign bit */
400 sign_ext = (value >> 63) & 1;
401
402 /* make all bits of sign_ext be the same as the value's sign bit */
403 sign_ext = -sign_ext;
404
405 /* shift value and fill opened bit positions with sign bit */
406 return (value >> shift) | (sign_ext << (64 - shift));
407}
408
418static inline void bytecpy(void *dst, const void *src, size_t size)
419{
420 size_t i;
421
422 for (i = 0; i < size; ++i) {
423 ((volatile uint8_t *)dst)[i] = ((volatile const uint8_t *)src)[i];
424 }
425}
426
437static inline void byteswp(void *a, void *b, size_t size)
438{
439 uint8_t t;
440 uint8_t *aa = (uint8_t *)a;
441 uint8_t *bb = (uint8_t *)b;
442
443 for (; size > 0; --size) {
444 t = *aa;
445 *aa++ = *bb;
446 *bb++ = t;
447 }
448}
449
458int char2hex(char c, uint8_t *x);
459
468int hex2char(uint8_t x, char *c);
469
480size_t bin2hex(const uint8_t *buf, size_t buflen, char *hex, size_t hexlen);
481
492size_t hex2bin(const char *hex, size_t hexlen, uint8_t *buf, size_t buflen);
493
501static inline uint8_t bcd2bin(uint8_t bcd)
502{
503 return ((10 * (bcd >> 4)) + (bcd & 0x0F));
504}
505
513static inline uint8_t bin2bcd(uint8_t bin)
514{
515 return (((bin / 10) << 4) | (bin % 10));
516}
517
531uint8_t u8_to_dec(char *buf, uint8_t buflen, uint8_t value);
532
557char *utf8_trunc(char *utf8_str);
558
573char *utf8_lcpy(char *dst, const char *src, size_t n);
574
575#define __z_log2d(x) (32 - __builtin_clz(x) - 1)
576#define __z_log2q(x) (64 - __builtin_clzll(x) - 1)
577#define __z_log2(x) (sizeof(__typeof__(x)) > 4 ? __z_log2q(x) : __z_log2d(x))
578
589#define LOG2(x) ((x) < 1 ? -1 : __z_log2(x))
590
601#define LOG2CEIL(x) ((x) < 1 ? 0 : __z_log2((x)-1) + 1)
602
615#define NHPOT(x) ((x) < 1 ? 1 : ((x) > (1ULL<<63) ? 0 : 1ULL << LOG2CEIL(x)))
616
629#define Z_DETECT_POINTER_OVERFLOW(addr, buflen) \
630 (((buflen) != 0) && \
631 ((UINTPTR_MAX - (uintptr_t)(addr)) <= ((uintptr_t)((buflen) - 1))))
632
633#ifdef __cplusplus
634}
635#endif
636
637/* This file must be included at the end of the !_ASMLANGUAGE guard.
638 * It depends on macros defined in this file above which cannot be forward declared.
639 */
641
642#endif /* !_ASMLANGUAGE */
643
645#ifdef _LINKER
646/* This is used in linker scripts so need to avoid type casting there */
647#define KB(x) ((x) << 10)
648#else
649#define KB(x) (((size_t)x) << 10)
650#endif
652#define MB(x) (KB(x) << 10)
654#define GB(x) (MB(x) << 10)
655
657#define KHZ(x) ((x) * 1000)
659#define MHZ(x) (KHZ(x) * 1000)
660
673#if defined(CONFIG_ARCH_POSIX)
674#define Z_SPIN_DELAY(t) k_busy_wait(t)
675#else
676#define Z_SPIN_DELAY(t)
677#endif
678
694#define WAIT_FOR(expr, timeout, delay_stmt) \
695 ({ \
696 uint32_t _wf_cycle_count = k_us_to_cyc_ceil32(timeout); \
697 uint32_t _wf_start = k_cycle_get_32(); \
698 while (!(expr) && (_wf_cycle_count > (k_cycle_get_32() - _wf_start))) { \
699 delay_stmt; \
700 Z_SPIN_DELAY(10); \
701 } \
702 (expr); \
703 })
704
709#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
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:391
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:418
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 uint8_t bin2bcd(uint8_t bin)
Convert a binary value to binary coded decimal (BCD 8421).
Definition: util.h:513
static void byteswp(void *a, void *b, size_t size)
byte by byte swap.
Definition: util.h:437
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:501
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:379
size_t bin2hex(const uint8_t *buf, size_t buflen, char *hex, size_t hexlen)
Convert a binary array into string representation.
__UINT8_TYPE__ uint8_t
Definition: stdint.h:88
__INT64_TYPE__ int64_t
Definition: stdint.h:75
Macros to abstract toolchain specific capabilities.
Macro utilities.