mirrors/cosmopolitan
1
0
Fork 0
mirror of https://github.com/jart/cosmopolitan.git synced 2025-05-23 22:02:27 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

Polyfill IPv6 on non-Linux

Browse source
This commit is contained in:
Justine Tunney 2022-09-08 06:06:22 -07:00
parent b73e35c6fa
commit 0547eabcd6
No known key found for this signature in database
GPG key ID: BE714B4575D6E328
10 changed files with 185 additions and 78 deletions
Download patch file Download diff file Expand all files Collapse all files

18
test/libc/mem/qsort_test.c
View file

@ -22,6 +22,7 @@
#include "libc/mem/mem.h"
#include "libc/nexgen32e/bsr.h"
#include "libc/runtime/gc.internal.h"
#include "libc/runtime/runtime.h"
#include "libc/stdio/rand.h"
#include "libc/stdio/stdio.h"
#include "libc/str/str.h"
@ -62,10 +63,15 @@ TEST(qsort, equivalence_random) {
qsort(b, n, sizeof(long), CompareLong);
heapsort(c, n, sizeof(long), CompareLong);
ASSERT_EQ(0, memcmp(b, c, n * sizeof(long)));
memcpy(c, a, n * sizeof(long));
mergesort(c, n, sizeof(long), CompareLong);
ASSERT_EQ(0, memcmp(b, c, n * sizeof(long)));
memcpy(c, a, n * sizeof(long));
smoothsort(c, n, sizeof(long), CompareLong);
ASSERT_EQ(0, memcmp(b, c, n * sizeof(long)));
memcpy(c, a, n * sizeof(long));
longsort(c, n);
ASSERT_EQ(0, memcmp(b, c, n * sizeof(long)));
}
TEST(qsort, equivalence_reverse) {
@ -80,10 +86,15 @@ TEST(qsort, equivalence_reverse) {
qsort(b, n, sizeof(long), CompareLong);
heapsort(c, n, sizeof(long), CompareLong);
ASSERT_EQ(0, memcmp(b, c, n * sizeof(long)));
memcpy(c, a, n * sizeof(long));
mergesort(c, n, sizeof(long), CompareLong);
ASSERT_EQ(0, memcmp(b, c, n * sizeof(long)));
memcpy(c, a, n * sizeof(long));
smoothsort(c, n, sizeof(long), CompareLong);
ASSERT_EQ(0, memcmp(b, c, n * sizeof(long)));
memcpy(c, a, n * sizeof(long));
longsort(c, n);
ASSERT_EQ(0, memcmp(b, c, n * sizeof(long)));
}
BENCH(qsort, bench) {
@ -102,6 +113,8 @@ BENCH(qsort, bench) {
mergesort(p2, n, sizeof(long), CompareLong));
EZBENCH2("smoothsort nearly", memcpy(p2, p1, n * sizeof(long)),
smoothsort(p2, n, sizeof(long), CompareLong));
EZBENCH2("longsort nearly", memcpy(p2, p1, n * sizeof(long)),
longsort(p2, n));
printf("\n");
for (i = 0; i < n; ++i) p1[i] = n - i;
@ -113,6 +126,8 @@ BENCH(qsort, bench) {
mergesort(p2, n, sizeof(long), CompareLong));
EZBENCH2("smoothsort reverse", memcpy(p2, p1, n * sizeof(long)),
smoothsort(p2, n, sizeof(long), CompareLong));
EZBENCH2("longsort reverse", memcpy(p2, p1, n * sizeof(long)),
longsort(p2, n));
printf("\n");
rngset(p1, n * sizeof(long), 0, 0);
@ -124,6 +139,8 @@ BENCH(qsort, bench) {
mergesort(p2, n, sizeof(long), CompareLong));
EZBENCH2("smoothsort random", memcpy(p2, p1, n * sizeof(long)),
smoothsort(p2, n, sizeof(long), CompareLong));
EZBENCH2("longsort random", memcpy(p2, p1, n * sizeof(long)),
longsort(p2, n));
printf("\n");
for (i = 0; i < n / 2; ++i) {
@ -138,4 +155,5 @@ BENCH(qsort, bench) {
mergesort(p2, n, sizeof(long), CompareLong));
EZBENCH2("smoothsort 2n", memcpy(p2, p1, n * sizeof(long)),
smoothsort(p2, n, sizeof(long), CompareLong));
EZBENCH2("longsort 2n", memcpy(p2, p1, n * sizeof(long)), longsort(p2, n));
}