/* SPDX-License-Identifier: BSD-2-Clause */ /* * Copyright (c) 2014, STMicroelectronics International N.V. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, * this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, * this list of conditions and the following disclaimer in the documentation * and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. */ #ifndef UTIL_H #define UTIL_H #include #include #define SIZE_4K UINTPTR_C(0x1000) #define SIZE_1M UINTPTR_C(0x100000) #define SIZE_2M UINTPTR_C(0x200000) #define SIZE_4M UINTPTR_C(0x400000) #define SIZE_8M UINTPTR_C(0x800000) #define SIZE_2G UINTPTR_C(0x80000000) #ifndef MAX #define MAX(a, b) \ (__extension__({ __typeof__(a) _a = (a); \ __typeof__(b) _b = (b); \ _a > _b ? _a : _b; })) #define MIN(a, b) \ (__extension__({ __typeof__(a) _a = (a); \ __typeof__(b) _b = (b); \ _a < _b ? _a : _b; })) #endif #define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0])) #ifndef ASM /* Round up the even multiple of size, size has to be a multiple of 2 */ #define ROUNDUP(v, size) (((v) + ((__typeof__(v))(size) - 1)) & \ ~((__typeof__(v))(size) - 1)) /* Round down the even multiple of size, size has to be a multiple of 2 */ #define ROUNDDOWN(v, size) ((v) & ~((__typeof__(v))(size) - 1)) #else #define ROUNDUP(x, y) ((((x) + (y) - 1) / (y)) * (y)) #define ROUNDDOWN(x, y) (((x) / (y)) * (y)) #endif /* x has to be of an unsigned type */ #define IS_POWER_OF_TWO(x) (((x) != 0) && (((x) & (~(x) + 1)) == (x))) #define ALIGNMENT_IS_OK(p, type) \ (((uintptr_t)(p) & (__alignof__(type) - 1)) == 0) #define TO_STR(x) _TO_STR(x) #define _TO_STR(x) #x #define container_of(ptr, type, member) \ (__extension__({ \ const typeof(((type *)0)->member) *__ptr = (ptr); \ (type *)((unsigned long)(__ptr) - offsetof(type, member)); \ })) #define MEMBER_SIZE(type, member) sizeof(((type *)0)->member) #ifdef ASM #define BIT32(nr) (1 << (nr)) #define BIT64(nr) (1 << (nr)) #define SHIFT_U32(v, shift) ((v) << (shift)) #define SHIFT_U64(v, shift) ((v) << (shift)) #else #define BIT32(nr) (UINT32_C(1) << (nr)) #define BIT64(nr) (UINT64_C(1) << (nr)) #define SHIFT_U32(v, shift) ((uint32_t)(v) << (shift)) #define SHIFT_U64(v, shift) ((uint64_t)(v) << (shift)) #endif #define BIT(nr) BIT32(nr) /* * Create a contiguous bitmask starting at bit position @l and ending at * position @h. For example * GENMASK_64(39, 21) gives us the 64bit vector 0x000000ffffe00000. */ #define GENMASK_32(h, l) \ (((~UINT32_C(0)) << (l)) & (~UINT32_C(0) >> (32 - 1 - (h)))) #define GENMASK_64(h, l) \ (((~UINT64_C(0)) << (l)) & (~UINT64_C(0) >> (64 - 1 - (h)))) /* * Checking overflow for addition, subtraction and multiplication. Result * of operation is stored in res which is a pointer to some kind of * integer. * * The macros return true if an overflow occurred and *res is undefined. */ #define ADD_OVERFLOW(a, b, res) __compiler_add_overflow((a), (b), (res)) #define SUB_OVERFLOW(a, b, res) __compiler_sub_overflow((a), (b), (res)) #define MUL_OVERFLOW(a, b, res) __compiler_mul_overflow((a), (b), (res)) /* Return a signed +1, 0 or -1 value based on data comparison */ #define CMP_TRILEAN(a, b) \ (__extension__({ \ __typeof__(a) _a = (a); \ __typeof__(b) _b = (b); \ \ _a > _b ? 1 : _a < _b ? -1 : 0; \ })) #endif /*UTIL_H*/