Page MenuHomeFreeBSD
Files F47959045

testsort.c
hselasky (Hans Petter Selasky)
Actions

Authored By
hselasky
Sep 8 2022, 10:33 AM
Size
3 KB
Referenced Files
None
Subscribers
None

testsort.c
View Options

#include <string.h>
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
uint32_t calls;
static int
hps_compare(const void *pa, const void *pb)
{
uintptr_t a = (uintptr_t)*(void **)pa;
uintptr_t b = (uintptr_t)*(void **)pb;
if (a > b)
return (1);
else if (a < b)
return (-1);
return (0);
}
static void
hps_bad(void **v, uint32_t n)
{
uint32_t i;
for (i = 0; i < n / 2; i++)
v[i] = (void *)(uintptr_t)(n / 2 - i);
v[n / 2] = (void *)(uintptr_t)(n / 2 + 1);
for (i = n / 2 + 1; i < n; i++)
v[i] = (void *)(uintptr_t)(n + n / 2 + 1 - i);
}
#define CMP(t,a,b) ((*a < *b) ? -1 : (*a > *b) ? 1 : 0)
#define swap(a,b) do { \
void *tmp = *a; \
*a = *b; \
*b = tmp; \
} while(0)
static void
hps_test()
{
uintptr_t a, b, c, d, e, f, g, h;
void *array[8];
void *copy[8];
for (a = 0; a != 8; a++) {
for (b = 0; b != 8; b++) {
for (c = 0; c != 8; c++) {
for (d = 0; d != 8; d++) {
for (e = 0; e != 8; e++) {
for (f = 0; f != 8; f++) {
for (g = 0; g != 8; g++) {
for (h = 0; h != 8; h++) {
array[0] = (void *)(uintptr_t)a;
array[1] = (void *)(uintptr_t)b;
array[2] = (void *)(uintptr_t)c;
array[3] = (void *)(uintptr_t)d;
array[4] = (void *)(uintptr_t)e;
array[5] = (void *)(uintptr_t)f;
array[6] = (void *)(uintptr_t)g;
array[7] = (void *)(uintptr_t)h;
memcpy(copy, array, sizeof(copy));
bsort(array, 8, sizeof(void *), &hps_compare);
qsort(copy, 8, sizeof(void *), &hps_compare);
if (memcmp(array, copy, sizeof(array)) != 0)
printf("%zd %zd %zd %zd %zd %zd %zd %zd\n",
(uintptr_t)array[0], (uintptr_t)array[1], (uintptr_t)array[2], (uintptr_t)array[3],
(uintptr_t)array[4], (uintptr_t)array[5], (uintptr_t)array[6], (uintptr_t)array[7]);
}
}
}
}
}
}
}
}
}
int
main(int argc, char **argv)
{
#ifdef HPS_TEST
hps_test();
return (0);
#endif
if (argc < 4)
return (0);
uint32_t LBASE = atoi(argv[1]);
uint32_t BASE = (1 << LBASE);
uint32_t algo = atoi(argv[2]);
uint32_t data = atoi(argv[3]);
void *array[BASE + BASE];
unsigned x;
unsigned y;
unsigned z;
for (z = 0; z != 1024; z++) {
if (data == 0) {
for (x = 0; x != BASE; x++) {
if (x > 4 && (random() & 1)) {
array[BASE + x] = array[BASE + x - 4];
} else
array[BASE + x] = (void *)(uintptr_t)((uint32_t)(random() /* % BASE */ ));
*(short *)&array[BASE + x] = x;
}
} else if (data == 1) {
for (x = 0; x != BASE; x++) {
array[BASE + x] = (void *)(uintptr_t)(random() % BASE);
}
} else {
hps_bad(array + BASE, BASE);
}
if (algo == 0)
qsort(array + BASE, BASE, sizeof(void *), hps_compare);
else if (algo == 1)
qsort(array + BASE, BASE, sizeof(void *), hps_compare);
else if (algo == 2)
bsort(array + BASE, BASE, sizeof(void *), hps_compare);
else
mergesort(array + BASE, BASE, sizeof(void *), hps_compare);
#ifdef HPS_VERIFY
memcpy(array, array + BASE, sizeof(array[0]) * BASE);
for (x = 0; x != BASE; x++) {
if (x + 1 < BASE &&
(uintptr_t)array[BASE + x] > (uintptr_t)array[BASE + x + 1]) {
printf("WRAP\n");
}
}
for (x = 0; x != BASE; x++) {
for (y = x + 1; y != BASE; y++) {
if (array[x] == array[y]) {
x++;
if (x != y) {
printf("SORT ERROR %d %d\n", x, y);
return (0);
}
}
}
}
#endif
}
return (0);
}

File Metadata

Mime Type
text/x-c
Storage Engine
blob
Storage Format
Raw Data
Storage Handle
5113047
Default Alt Text
testsort.c (3 KB)

Event Timeline