New asort routine; unf. breaks under -Wmissing-prototypes etc :(

[ccan] / ccan / asort / asort.h

diff --git a/ccan/asort/asort.h b/ccan/asort/asort.h
new file mode 100644 (file)
index 0000000..1139238
--- /dev/null
+++ b/ccan/asort/asort.h
@@ -0,0 +1,37 @@
+#ifndef CCAN_ASORT_H
+#define CCAN_ASORT_H
+#include <ccan/typesafe_cb/typesafe_cb.h>
+#include <stdlib.h>
+
+/**
+ * asort - sort an array of elements
+ * @base: pointer to data to sort
+ * @num: number of elements
+ * @cmp: pointer to comparison function
+ * @ctx: a context pointer for the cmp function
+ *
+ * This function does a sort on the given array.  The resulting array
+ * will be in ascending sorted order by the provided comparison function.
+ *
+ * The @cmp function should exactly match the type of the @base and
+ * @ctx arguments.  Otherwise it can take three const void *.
+ */
+#if HAVE_TYPEOF
+#define asort(base, num, cmp, ctx)                                     \
+_asort((base), (num), sizeof(*(base)),                                 \
+       cast_if_type((cmp),                                             \
+                   int (*)(const __typeof__(*(base)) *,                \
+                           const __typeof__(*(base)) *,                \
+                           __typeof__(ctx)),                           \
+                   int (*)(const void *, const void *, const void *)), (ctx))
+#else
+#define asort(base, num, cmp, ctx)                             \
+       _asort((base), (num), sizeof(*(base)),                  \
+              (int (*)(const void *, const void *, const void *))(cmp), ctx)
+#endif
+
+void _asort(void *base, size_t nmemb, size_t size,
+           int(*compar)(const void *, const void *, const void *),
+           const void *ctx);
+
+#endif /* CCAN_ASORT_H */