File: test_qsort_s.c

package info (click to toggle)
safeclib 3.9.1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 6,832 kB
  • sloc: ansic: 52,639; makefile: 1,271; perl: 528; sh: 518
file content (119 lines) | stat: -rw-r--r-- 3,164 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
/*------------------------------------------------------------------
 * test_qsort_s
 * File 'misc/qsort_s.c'
 * Lines executed:89.23% of 130
 *
 *------------------------------------------------------------------
 */

#include "test_private.h"
#include "safe_lib.h"
#include <stdlib.h>

#ifdef HAVE_QSORT_S
#define HAVE_NATIVE 1
#else
#define HAVE_NATIVE 0
#endif
#include "test_msvcrt.h"

/* conflicting API, void return. skip only shared */
#if defined(MINGW_HAS_SECURE_API) && !defined(DISABLE_DLLIMPORT)
int main(void) {
    printf("skipped under windows sec_api: conflicting API\n");
    return 0;
}
#else
int test_qsort_s(void);

#define LEN 10
struct items {
    int iv;
    const char *sv;
} array[] = {{1, "one"},  {3, "three"}, {8, "eight"}, {4, "four"},
             {0, "zero"}, {5, "five"},  {2, "two"},   {6, "six"},
             {9, "nine"}, {7, "seven"}, {10, "ten"}};

static int comp(const void *ptr1, const void *ptr2, void *ctx) {
    struct items *i1 = (struct items *)ptr1;
    struct items *i2 = (struct items *)ptr2;
    if (ctx) {
        errno = -1;
        return 0; /* shortcut just for testing */
    }
    return i1->iv > i2->iv ? 1 : i1->iv == i2->iv ? 0 : -1;
}

int test_qsort_s(void) {
    errno_t rc;
    int errs = 0;
    int ind;

    /*--------------------------------------------------*/

    print_msvcrt(use_msvcrt);

#ifndef HAVE_CT_BOS_OVR
    EXPECT_BOS("empty buf or bufsize")
    rc = qsort_s(NULL, LEN, sizeof(array[0]), comp, NULL);
    init_msvcrt(rc == ESNULLP, &use_msvcrt);
    if (!use_msvcrt) {
        ERR(ESNULLP);
    } /* msvcrt returns void */

    EXPECT_BOS("empty compar")
    rc = qsort_s(array, LEN, sizeof(array[0]), NULL, NULL);
    if (!use_msvcrt) {
        ERR(ESNULLP);
    } /* msvcrt returns void */

    /*--------------------------------------------------*/

    if (!use_msvcrt) {
        EXPECT_BOS("base overflow")
        rc = qsort_s(array, RSIZE_MAX_MEM + 1, sizeof(array[0]), comp, NULL);
        ERR(ESNOSPC);

        EXPECT_BOS("base overflow")
        rc = qsort_s(array, LEN, RSIZE_MAX_MEM + 1, comp, NULL);
        ERR(ESNOSPC);
    }
#endif

    /*--------------------------------------------------*/

    /* allow empty array with safec, msvcrt does not! */
    if (!use_msvcrt) {
        rc = qsort_s(NULL, 0, 0, comp, NULL);
        ERR(EOK);
    }

    /*--------------------------------------------------*/

    /* sorted */
    rc = qsort_s(array, LEN, sizeof(array[0]), comp, NULL);
    if (!use_msvcrt) {
        ERR(EOK);
    }
    for (ind = 0; ind <= LEN; ++ind) {
        if (ind != array[ind].iv) {
            /* TODO check why msvcrt fails here */
            printf("%s %u  %s  got=%d expected=%d \n", __FUNCTION__, __LINE__,
                   use_msvcrt ? "Todo" : "Error", array[ind].iv, ind);
            if (!use_msvcrt)
                errs++;
        }
    }

    /*--------------------------------------------------*/

    return (errs);
}

#ifndef __KERNEL__
/* simple hack to get this to work for both userspace and Linux kernel,
   until a better solution can be created. */
int main(void) { return (test_qsort_s()); }
#endif

#endif /* sec_api */