forked from mirrors/linux
b2108fc82a
Other subsystem(s) may want to reuse the for_each_if() macro. Move it to util_macros.h to make it globally available. Suggested-by: Bartosz Golaszewski <brgl@bgdev.pl> Signed-off-by: Andy Shevchenko <andriy.shevchenko@linux.intel.com> Acked-by: Jani Nikula <jani.nikula@intel.com> Reviewed-by: Bartosz Golaszewski <bartosz.golaszewski@linaro.org> Reviewed-by: Linus Walleij <linus.walleij@linaro.org> Link: https://lore.kernel.org/r/20250213182527.3092371-2-andriy.shevchenko@linux.intel.com Signed-off-by: Bartosz Golaszewski <bartosz.golaszewski@linaro.org>
94 lines
2.9 KiB
C
94 lines
2.9 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef _LINUX_HELPER_MACROS_H_
|
|
#define _LINUX_HELPER_MACROS_H_
|
|
|
|
#include <linux/math.h>
|
|
|
|
/**
|
|
* for_each_if - helper for handling conditionals in various for_each macros
|
|
* @condition: The condition to check
|
|
*
|
|
* Typical use::
|
|
*
|
|
* #define for_each_foo_bar(x, y) \'
|
|
* list_for_each_entry(x, y->list, head) \'
|
|
* for_each_if(x->something == SOMETHING)
|
|
*
|
|
* The for_each_if() macro makes the use of for_each_foo_bar() less error
|
|
* prone.
|
|
*/
|
|
#define for_each_if(condition) if (!(condition)) {} else
|
|
|
|
/**
|
|
* find_closest - locate the closest element in a sorted array
|
|
* @x: The reference value.
|
|
* @a: The array in which to look for the closest element. Must be sorted
|
|
* in ascending order.
|
|
* @as: Size of 'a'.
|
|
*
|
|
* Returns the index of the element closest to 'x'.
|
|
* Note: If using an array of negative numbers (or mixed positive numbers),
|
|
* then be sure that 'x' is of a signed-type to get good results.
|
|
*/
|
|
#define find_closest(x, a, as) \
|
|
({ \
|
|
typeof(as) __fc_i, __fc_as = (as) - 1; \
|
|
long __fc_mid_x, __fc_x = (x); \
|
|
long __fc_left, __fc_right; \
|
|
typeof(*a) const *__fc_a = (a); \
|
|
for (__fc_i = 0; __fc_i < __fc_as; __fc_i++) { \
|
|
__fc_mid_x = (__fc_a[__fc_i] + __fc_a[__fc_i + 1]) / 2; \
|
|
if (__fc_x <= __fc_mid_x) { \
|
|
__fc_left = __fc_x - __fc_a[__fc_i]; \
|
|
__fc_right = __fc_a[__fc_i + 1] - __fc_x; \
|
|
if (__fc_right < __fc_left) \
|
|
__fc_i++; \
|
|
break; \
|
|
} \
|
|
} \
|
|
(__fc_i); \
|
|
})
|
|
|
|
/**
|
|
* find_closest_descending - locate the closest element in a sorted array
|
|
* @x: The reference value.
|
|
* @a: The array in which to look for the closest element. Must be sorted
|
|
* in descending order.
|
|
* @as: Size of 'a'.
|
|
*
|
|
* Similar to find_closest() but 'a' is expected to be sorted in descending
|
|
* order. The iteration is done in reverse order, so that the comparison
|
|
* of '__fc_right' & '__fc_left' also works for unsigned numbers.
|
|
*/
|
|
#define find_closest_descending(x, a, as) \
|
|
({ \
|
|
typeof(as) __fc_i, __fc_as = (as) - 1; \
|
|
long __fc_mid_x, __fc_x = (x); \
|
|
long __fc_left, __fc_right; \
|
|
typeof(*a) const *__fc_a = (a); \
|
|
for (__fc_i = __fc_as; __fc_i >= 1; __fc_i--) { \
|
|
__fc_mid_x = (__fc_a[__fc_i] + __fc_a[__fc_i - 1]) / 2; \
|
|
if (__fc_x <= __fc_mid_x) { \
|
|
__fc_left = __fc_x - __fc_a[__fc_i]; \
|
|
__fc_right = __fc_a[__fc_i - 1] - __fc_x; \
|
|
if (__fc_right < __fc_left) \
|
|
__fc_i--; \
|
|
break; \
|
|
} \
|
|
} \
|
|
(__fc_i); \
|
|
})
|
|
|
|
/**
|
|
* is_insidevar - check if the @ptr points inside the @var memory range.
|
|
* @ptr: the pointer to a memory address.
|
|
* @var: the variable which address and size identify the memory range.
|
|
*
|
|
* Evaluates to true if the address in @ptr lies within the memory
|
|
* range allocated to @var.
|
|
*/
|
|
#define is_insidevar(ptr, var) \
|
|
((uintptr_t)(ptr) >= (uintptr_t)(var) && \
|
|
(uintptr_t)(ptr) < (uintptr_t)(var) + sizeof(var))
|
|
|
|
#endif
|