tests/freebsd_qsort.c

   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 qsort() routine.
  29  */
  30
  31 #include <sys/cdefs.h>
  32
  33 #include <assert.h>
  34 #include <stdio.h>
  35 #include <stdlib.h>
  36 #include <darwintest.h>
  37
  38 #include "freebsd_qsort.h"
  39
  40 T_DECL(qsort, "qsort sanity check")
  41 {
  42         int testvector[IVEC_LEN];
  43         int sresvector[IVEC_LEN];
  44         size_t i, j;
  45
  46         for (j = 2; j < IVEC_LEN; j++) {
  47                 /* Populate test vectors */
  48                 for (i = 0; i < j; i++) {
  49                         testvector[i] = sresvector[i] = initvector[i];
  50         }
  51
  52                 /* Sort using qsort(3) */
  53                 qsort(testvector, j, sizeof(testvector[0]), sorthelp);
  54                 /* Sort using reference slow sorting routine */
  55                 ssort(sresvector, (int)j);
  56
  57                 /* Compare results */
  58                 for (i = 0; i < j; i++){
  59             T_QUIET;
  60             T_EXPECT_EQ(testvector[i], sresvector[i],
  61                 "item at index %zd should match", i);
  62         }
  63         }
  64 }
  65
  66 T_DECL(qsort_b, "qsort_b sanity check")
  67 {
  68         int testvector[IVEC_LEN];
  69         int sresvector[IVEC_LEN];
  70         size_t i, j;
  71
  72         for (j = 2; j < IVEC_LEN; j++) {
  73                 /* Populate test vectors */
  74                 for (i = 0; i < j; i++) {
  75                         testvector[i] = sresvector[i] = initvector[i];
  76         }
  77
  78                 /* Sort using qsort(3) */
  79                 qsort_b(testvector, j, sizeof(testvector[0]), sorthelp_b);
  80                 /* Sort using reference slow sorting routine */
  81                 ssort(sresvector, (int)j);
  82
  83                 /* Compare results */
  84                 for (i = 0; i < j; i++){
  85             T_QUIET;
  86             T_EXPECT_EQ(testvector[i], sresvector[i],
  87                 "item at index %zd should match", i);
  88         }
  89         }
  90 }