libc: add test case for qsort_b(3)
Reviewed by: markj MFC after: 2 weeks Differential Revision: https://reviews.freebsd.org/D36463
This commit is contained in:
parent
aa74cc6d6f
commit
c65e42dbde
@ -7,6 +7,7 @@ ATF_TESTS_C+= dynthr_test
|
|||||||
ATF_TESTS_C+= heapsort_test
|
ATF_TESTS_C+= heapsort_test
|
||||||
ATF_TESTS_C+= mergesort_test
|
ATF_TESTS_C+= mergesort_test
|
||||||
ATF_TESTS_C+= qsort_test
|
ATF_TESTS_C+= qsort_test
|
||||||
|
ATF_TESTS_C+= qsort_b_test
|
||||||
ATF_TESTS_C+= qsort_r_test
|
ATF_TESTS_C+= qsort_r_test
|
||||||
ATF_TESTS_C+= qsort_s_test
|
ATF_TESTS_C+= qsort_s_test
|
||||||
ATF_TESTS_C+= set_constraint_handler_s_test
|
ATF_TESTS_C+= set_constraint_handler_s_test
|
||||||
@ -59,6 +60,12 @@ CXXSTD.cxa_thread_atexit_test= c++11
|
|||||||
CXXSTD.cxa_thread_atexit_nothr_test= c++11
|
CXXSTD.cxa_thread_atexit_nothr_test= c++11
|
||||||
LIBADD.cxa_thread_atexit_test+= pthread
|
LIBADD.cxa_thread_atexit_test+= pthread
|
||||||
|
|
||||||
|
# Tests that requires Blocks feature
|
||||||
|
.for t in qsort_b_test
|
||||||
|
CFLAGS.${t}.c+= -fblocks
|
||||||
|
LIBADD.${t}+= BlocksRuntime
|
||||||
|
.endfor
|
||||||
|
|
||||||
.for t in h_getopt h_getopt_long
|
.for t in h_getopt h_getopt_long
|
||||||
CFLAGS.$t+= -I${LIBNETBSD_SRCDIR} -I${SRCTOP}/contrib/netbsd-tests
|
CFLAGS.$t+= -I${LIBNETBSD_SRCDIR} -I${SRCTOP}/contrib/netbsd-tests
|
||||||
LDFLAGS.$t+= -L${LIBNETBSD_OBJDIR}
|
LDFLAGS.$t+= -L${LIBNETBSD_OBJDIR}
|
||||||
|
76
lib/libc/tests/stdlib/qsort_b_test.c
Normal file
76
lib/libc/tests/stdlib/qsort_b_test.c
Normal file
@ -0,0 +1,76 @@
|
|||||||
|
/*-
|
||||||
|
* Copyright (C) 2004 Maxim Sobolev <sobomax@FreeBSD.org>
|
||||||
|
* All rights reserved.
|
||||||
|
*
|
||||||
|
* 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 AUTHOR 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 AUTHOR 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.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Test for qsort_b() routine.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <assert.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
|
||||||
|
#include "test-sort.h"
|
||||||
|
|
||||||
|
ATF_TC_WITHOUT_HEAD(qsort_b_test);
|
||||||
|
ATF_TC_BODY(qsort_b_test, tc)
|
||||||
|
{
|
||||||
|
int testvector[IVEC_LEN];
|
||||||
|
int sresvector[IVEC_LEN];
|
||||||
|
int i, j;
|
||||||
|
|
||||||
|
for (j = 2; j < IVEC_LEN; j++) {
|
||||||
|
/* Populate test vectors */
|
||||||
|
for (i = 0; i < j; i++)
|
||||||
|
testvector[i] = sresvector[i] = initvector[i];
|
||||||
|
|
||||||
|
/* Sort using qsort_b(3) */
|
||||||
|
qsort_b(testvector, j, sizeof(testvector[0]),
|
||||||
|
^(const void* a, const void* b) {
|
||||||
|
if (*(int *)a > *(int *)b)
|
||||||
|
return (1);
|
||||||
|
else if (*(int *)a < *(int *)b)
|
||||||
|
return (-1);
|
||||||
|
else
|
||||||
|
return (0);
|
||||||
|
});
|
||||||
|
/* Sort using reference slow sorting routine */
|
||||||
|
ssort(sresvector, j);
|
||||||
|
|
||||||
|
/* Compare results */
|
||||||
|
for (i = 0; i < j; i++)
|
||||||
|
ATF_CHECK_MSG(testvector[i] == sresvector[i],
|
||||||
|
"item at index %d didn't match: %d != %d",
|
||||||
|
i, testvector[i], sresvector[i]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
ATF_TP_ADD_TCS(tp)
|
||||||
|
{
|
||||||
|
|
||||||
|
ATF_TP_ADD_TC(tp, qsort_b_test);
|
||||||
|
|
||||||
|
return (atf_no_error());
|
||||||
|
}
|
@ -97,6 +97,7 @@ _LIBRARIES= \
|
|||||||
archive \
|
archive \
|
||||||
asn1 \
|
asn1 \
|
||||||
avl \
|
avl \
|
||||||
|
BlocksRuntime \
|
||||||
be \
|
be \
|
||||||
begemot \
|
begemot \
|
||||||
bluetooth \
|
bluetooth \
|
||||||
|
Loading…
Reference in New Issue
Block a user