2 * Code adapted from uClibc-0.9.30.3
4 * It is therefore covered by the GNU LESSER GENERAL PUBLIC LICENSE
5 * Version 2.1, February 1999
7 * Wolfgang Denk <wd@denx.de>
10 /* This code is derived from a public domain shell sort routine by
11 * Ray Gardner and found in Bob Stout's snippets collection. The
12 * original code is included below in an #if 0/#endif block.
14 * I modified it to avoid the possibility of overflow in the wgap
15 * calculation, as well as to reduce the generated code size with
18 #include <linux/types.h>
22 void qsort(void *base,
25 int (*comp)(const void *, const void *))
30 if ((nel > 1) && (width > 0)) {
31 assert(nel <= ((size_t)(-1)) / width); /* check for overflow */
35 } while (wgap < (nel-1)/3);
36 /* From the above, we know that either wgap == 1 < nel or */
37 /* ((wgap-1)/3 < (int) ((nel-1)/3) <= (nel-1)/3 ==> wgap < nel. */
38 wgap *= width; /* So this can not overflow if wnel doesn't. */
39 nel *= width; /* Convert nel to 'wnel' */
49 a = j + ((char *)base);
51 if ((*comp)(a, b) <= 0) {
63 wgap = (wgap - width)/3;
68 int strcmp_compar(const void *p1, const void *p2)
70 return strcmp(*(const char **)p1, *(const char **)p2);