]> git.baikalelectronics.ru Git - uboot.git/commitdiff
include: kernel.h: port find_closest() from Linux
authorChris Packham <judge.packham@gmail.com>
Sun, 19 Mar 2023 21:23:43 +0000 (10:23 +1300)
committerTom Rini <trini@konsulko.com>
Thu, 30 Mar 2023 19:09:59 +0000 (15:09 -0400)
The find_closest() macro can be used to find an element in a sorted
array that is closest to an input value. Bring in this macro from
Linux v6.3-rc1-2-g8ca09d5fa354.

Signed-off-by: Chris Packham <judge.packham@gmail.com>
Reviewed-by: Simon Glass <sjg@chromium.org>
include/linux/kernel.h

index 3e71d61074b6b54786f031100961b8bbb1075069..5cd6c9dc821951ff4f6170c21e30e66e445927ff 100644 (file)
        offsetof(struct structure, member) == (offset), \
        "`struct " #structure "` offset for `" #member "` is not " #offset)
 
+#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, <=)
+
 #endif