1 /*-
2 * Copyright (C) 2004 Maxim Sobolev <sobomax@FreeBSD.org>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 */
26
27 /*
28 * Test for mergesort() routine.
29 */
30
31 #include <sys/cdefs.h>
32 #include <assert.h>
33 #include <stdio.h>
34 #include <stdlib.h>
35
36 #include "test-sort.h"
37
38 ATF_TC_WITHOUT_HEAD(mergesort_test);
ATF_TC_BODY(mergesort_test,tc)39 ATF_TC_BODY(mergesort_test, tc)
40 {
41 int sresvector[IVEC_LEN];
42 int testvector[IVEC_LEN];
43 int i, j;
44
45 for (j = 2; j < IVEC_LEN; j++) {
46 /* Populate test vectors */
47 for (i = 0; i < j; i++)
48 testvector[i] = sresvector[i] = initvector[i];
49
50 /* Sort using mergesort(3) */
51 mergesort(testvector, j, sizeof(testvector[0]), sorthelp);
52 /* Sort using reference slow sorting routine */
53 ssort(sresvector, j);
54
55 /* Compare results */
56 for (i = 0; i < j; i++)
57 ATF_CHECK_MSG(testvector[i] == sresvector[i],
58 "item at index %d didn't match: %d != %d",
59 i, testvector[i], sresvector[i]);
60 }
61 }
62
ATF_TP_ADD_TCS(tp)63 ATF_TP_ADD_TCS(tp)
64 {
65
66 ATF_TP_ADD_TC(tp, mergesort_test);
67
68 return (atf_no_error());
69 }
70