1*ae771770SStanislav Sedov /*
2*ae771770SStanislav Sedov * Copyright (c) 2004 Kungliga Tekniska Högskolan
3*ae771770SStanislav Sedov * (Royal Institute of Technology, Stockholm, Sweden).
4*ae771770SStanislav Sedov * All rights reserved.
5*ae771770SStanislav Sedov *
6*ae771770SStanislav Sedov * Redistribution and use in source and binary forms, with or without
7*ae771770SStanislav Sedov * modification, are permitted provided that the following conditions
8*ae771770SStanislav Sedov * are met:
9*ae771770SStanislav Sedov *
10*ae771770SStanislav Sedov * 1. Redistributions of source code must retain the above copyright
11*ae771770SStanislav Sedov * notice, this list of conditions and the following disclaimer.
12*ae771770SStanislav Sedov *
13*ae771770SStanislav Sedov * 2. Redistributions in binary form must reproduce the above copyright
14*ae771770SStanislav Sedov * notice, this list of conditions and the following disclaimer in the
15*ae771770SStanislav Sedov * documentation and/or other materials provided with the distribution.
16*ae771770SStanislav Sedov *
17*ae771770SStanislav Sedov * 3. Neither the name of the Institute nor the names of its contributors
18*ae771770SStanislav Sedov * may be used to endorse or promote products derived from this software
19*ae771770SStanislav Sedov * without specific prior written permission.
20*ae771770SStanislav Sedov *
21*ae771770SStanislav Sedov * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22*ae771770SStanislav Sedov * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23*ae771770SStanislav Sedov * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24*ae771770SStanislav Sedov * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25*ae771770SStanislav Sedov * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26*ae771770SStanislav Sedov * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27*ae771770SStanislav Sedov * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28*ae771770SStanislav Sedov * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29*ae771770SStanislav Sedov * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30*ae771770SStanislav Sedov * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31*ae771770SStanislav Sedov * SUCH DAMAGE.
32*ae771770SStanislav Sedov */
33*ae771770SStanislav Sedov
34*ae771770SStanislav Sedov #ifdef HAVE_CONFIG_H
35*ae771770SStanislav Sedov #include <config.h>
36*ae771770SStanislav Sedov #endif
37*ae771770SStanislav Sedov #include <stdio.h>
38*ae771770SStanislav Sedov #include "windlocl.h"
39*ae771770SStanislav Sedov
40*ae771770SStanislav Sedov #define MAX_LENGTH 10
41*ae771770SStanislav Sedov
42*ae771770SStanislav Sedov struct test {
43*ae771770SStanislav Sedov unsigned len;
44*ae771770SStanislav Sedov uint32_t vals[MAX_LENGTH];
45*ae771770SStanislav Sedov };
46*ae771770SStanislav Sedov
47*ae771770SStanislav Sedov static struct test passing_cases[] = {
48*ae771770SStanislav Sedov {0, {0}},
49*ae771770SStanislav Sedov {1, {0x0041}},
50*ae771770SStanislav Sedov {1, {0x05be}},
51*ae771770SStanislav Sedov };
52*ae771770SStanislav Sedov
53*ae771770SStanislav Sedov static struct test failing_cases[] = {
54*ae771770SStanislav Sedov {2, {0x05be, 0x0041}},
55*ae771770SStanislav Sedov {3, {0x05be, 0x0041, 0x05be}},
56*ae771770SStanislav Sedov };
57*ae771770SStanislav Sedov
58*ae771770SStanislav Sedov int
main(void)59*ae771770SStanislav Sedov main(void)
60*ae771770SStanislav Sedov {
61*ae771770SStanislav Sedov unsigned i;
62*ae771770SStanislav Sedov unsigned failures = 0;
63*ae771770SStanislav Sedov
64*ae771770SStanislav Sedov for (i = 0; i < sizeof(passing_cases)/sizeof(passing_cases[0]); ++i) {
65*ae771770SStanislav Sedov const struct test *t = &passing_cases[i];
66*ae771770SStanislav Sedov if (_wind_stringprep_testbidi(t->vals, t->len, WIND_PROFILE_NAME)) {
67*ae771770SStanislav Sedov printf ("passing case %u failed\n", i);
68*ae771770SStanislav Sedov ++failures;
69*ae771770SStanislav Sedov }
70*ae771770SStanislav Sedov }
71*ae771770SStanislav Sedov
72*ae771770SStanislav Sedov for (i = 0; i < sizeof(failing_cases)/sizeof(failing_cases[0]); ++i) {
73*ae771770SStanislav Sedov const struct test *t = &failing_cases[i];
74*ae771770SStanislav Sedov if (!_wind_stringprep_testbidi(t->vals, t->len, WIND_PROFILE_NAME)) {
75*ae771770SStanislav Sedov printf ("failing case %u passed\n", i);
76*ae771770SStanislav Sedov ++failures;
77*ae771770SStanislav Sedov }
78*ae771770SStanislav Sedov }
79*ae771770SStanislav Sedov
80*ae771770SStanislav Sedov return failures != 0;
81*ae771770SStanislav Sedov }
82