mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-11-29 20:36:38 +07:00
05836c378c
Using the new find_closest() macro can result in the following sparse warnings. drivers/hwmon/lm85.c:194:16: warning: incorrect type in initializer (different modifiers) drivers/hwmon/lm85.c:194:16: expected int *__fc_a drivers/hwmon/lm85.c:194:16: got int static const [toplevel] *<noident> drivers/hwmon/lm85.c:210:16: warning: incorrect type in initializer (different modifiers) drivers/hwmon/lm85.c:210:16: expected int *__fc_a drivers/hwmon/lm85.c:210:16: got int const *map This is because the array passed to find_closest() will typically be declared as array of constants, but the macro declares a non-constant pointer to it. Signed-off-by: Guenter Roeck <linux@roeck-us.net> Cc: Bartosz Golaszewski <bgolaszewski@baylibre.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
41 lines
1.1 KiB
C
41 lines
1.1 KiB
C
#ifndef _LINUX_HELPER_MACROS_H_
|
|
#define _LINUX_HELPER_MACROS_H_
|
|
|
|
#define __find_closest(x, a, as, op) \
|
|
({ \
|
|
typeof(as) __fc_i, __fc_as = (as) - 1; \
|
|
typeof(x) __fc_x = (x); \
|
|
typeof(*a) const *__fc_a = (a); \
|
|
for (__fc_i = 0; __fc_i < __fc_as; __fc_i++) { \
|
|
if (__fc_x op DIV_ROUND_CLOSEST(__fc_a[__fc_i] + \
|
|
__fc_a[__fc_i + 1], 2)) \
|
|
break; \
|
|
} \
|
|
(__fc_i); \
|
|
})
|
|
|
|
/**
|
|
* 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'.
|
|
*/
|
|
#define find_closest(x, a, as) __find_closest(x, a, as, <=)
|
|
|
|
/**
|
|
* 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.
|
|
*/
|
|
#define find_closest_descending(x, a, as) __find_closest(x, a, as, >=)
|
|
|
|
#endif
|