[tyndur-devel] [PATCH 2/2] tests: Test für qsort
MNemo ·
On 25.09.2011 22:54, Kevin Wolf wrote: > + tests/libc: Ein paar Testfälle für qsort > > Signed-off-by: Kevin Wolf <kevin at tyndur.org> > --- > tests/libc/Makefile | 2 +- > tests/libc/main.c | 4 ++ > tests/libc/qsort.c | 114 +++++++++++++++++++++++++++++++++++++++++++++++++++ > 3 files changed, 119 insertions(+), 1 deletions(-) > create mode 100644 tests/libc/qsort.c > > diff --git a/tests/libc/Makefile b/tests/libc/Makefile > index 32f39b4..75e805f 100644 > --- a/tests/libc/Makefile > +++ b/tests/libc/Makefile > @@ -12,7 +12,7 @@ LDFLAGS=-T ../../src/modules/user-i386.ld --start-group ../../src/lib/library.a > qemu: main > @./run_test.sh > > -main: main.o ../lib/testlib.o > +main: main.o qsort.o ../lib/testlib.o > @$(LD) $^ $(LDFLAGS) -o $@ > > %.o: %.c > diff --git a/tests/libc/main.c b/tests/libc/main.c > index 355ad0b..eb15c21 100644 > --- a/tests/libc/main.c > +++ b/tests/libc/main.c > @@ -33,8 +33,12 @@ > > const char* test_name; > > +extern int test_qsort(void); > + > static void test1(void) > { > + test_name = "qsort"; > + test_qsort(); > } > > int main(int argc, char* argv[]) > diff --git a/tests/libc/qsort.c b/tests/libc/qsort.c > new file mode 100644 > index 0000000..2bcad55 > --- /dev/null > +++ b/tests/libc/qsort.c > @@ -0,0 +1,114 @@ > +/* > + * Copyright (c) 2011 The tyndur Project. All rights reserved. > + * > + * This code is derived from software contributed to the tyndur Project > + * by Kevin Wolf. > + * > + * Redistribution and use in source and binary forms, with or without > + * modification, are permitted provided that the following conditions > + * are met: > + * 1. Redistributions of source code must retain the above copyright > + * notice, this list of conditions and the following disclaimer. > + * 2. Redistributions in binary form must reproduce the above copyright > + * notice, this list of conditions and the following disclaimer in the > + * documentation and/or other materials provided with the distribution. > + * > + * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS > + * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED > + * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR > + * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR > + * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, > + * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, > + * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; > + * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, > + * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR > + * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF > + * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. > + */ > + > +#include "testlib.h" > + > +#include <stdlib.h> > +#include <stdio.h> > + > +struct test_data { > + int num; > + int* data; > + int* sorted; > +}; > + > +struct test_data test_data[] = { > + { > + .num = 0, > + .data = (int[]) {}, > + .sorted = (int[]) {}, > + }, > + { > + .num = 2, > + .data = (int[]) { 2, 5 }, > + .sorted = (int[]) { 2, 5 }, > + }, > + { > + .num = 2, > + .data = (int[]) { 5, 2 }, > + .sorted = (int[]) { 2, 5 }, > + }, > + { > + .num = 5, > + .data = (int[]) { 5, 2, 7, -21, 0 }, > + .sorted = (int[]) { -21, 0, 2, 5, 7 }, > + }, > + { > + .num = 6, > + .data = (int[]) { 6, 2, 5, 4, 3, 2 }, > + .sorted = (int[]) { 2, 2, 3, 4, 5, 6 }, > + }, > +}; > + > +static int compare(const void* a, const void* b) > +{ > + return *(int*)a - *(int*)b; > +} > + > +static void dump_result(int* data, int num) > +{ > + int i; > + > + printf("* Ergebnis: "); > + for (i = 0; i < num; i++) { > + printf("%s%d", i ? ", " : "", data[i]); > + } > + printf("\n"); > +} > + > +static int compare_result(int* data, int* sorted, int num) > +{ > + int i; > + > + for (i = 0; i < num; i++) { > + if (data[i] != sorted[i]) { > + return 0; > + } > + } > + > + return 1; > +} > + > +int test_qsort(void) > +{ > + int i; > + int num_tests = sizeof(test_data) / sizeof(test_data[0]); > + > + for (i = 0; i < num_tests; i++) { > + struct test_data* t = &test_data[i]; > + qsort(t->data, t->num, sizeof(int), compare); > + if (compare_result(t->data, t->sorted, t->num)) { > + printf("* PASS %s: Datensatz %d\n", test_name, i); > + } else { > + printf("* FAIL %s: Datensatz %d\n", test_name, i); > + dump_result(t->data, t->num); > + } > + } > + > + return 0; > +} Acked-by: Andreas Freimuth <m.nemo at gmx.net> -- MNemo