1226031Sstas/*
2226031Sstas * Copyright (c) 2004 Kungliga Tekniska H��gskolan
3226031Sstas * (Royal Institute of Technology, Stockholm, Sweden).
4226031Sstas * All rights reserved.
5226031Sstas *
6226031Sstas * Redistribution and use in source and binary forms, with or without
7226031Sstas * modification, are permitted provided that the following conditions
8226031Sstas * are met:
9226031Sstas *
10226031Sstas * 1. Redistributions of source code must retain the above copyright
11226031Sstas *    notice, this list of conditions and the following disclaimer.
12226031Sstas *
13226031Sstas * 2. Redistributions in binary form must reproduce the above copyright
14226031Sstas *    notice, this list of conditions and the following disclaimer in the
15226031Sstas *    documentation and/or other materials provided with the distribution.
16226031Sstas *
17226031Sstas * 3. Neither the name of the Institute nor the names of its contributors
18226031Sstas *    may be used to endorse or promote products derived from this software
19226031Sstas *    without specific prior written permission.
20226031Sstas *
21226031Sstas * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22226031Sstas * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23226031Sstas * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24226031Sstas * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25226031Sstas * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26226031Sstas * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27226031Sstas * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28226031Sstas * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29226031Sstas * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30226031Sstas * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31226031Sstas * SUCH DAMAGE.
32226031Sstas */
33226031Sstas
34226031Sstas#ifdef HAVE_CONFIG_H
35226031Sstas#include <config.h>
36226031Sstas#endif
37226031Sstas#include <stdio.h>
38226031Sstas#include "windlocl.h"
39226031Sstas
40226031Sstas#define MAX_LENGTH 10
41226031Sstas
42226031Sstasstruct test {
43226031Sstas    unsigned len;
44226031Sstas    uint32_t vals[MAX_LENGTH];
45226031Sstas};
46226031Sstas
47226031Sstasstatic struct test passing_cases[] = {
48226031Sstas    {0, {0}},
49226031Sstas    {1, {0x0041}},
50226031Sstas    {1, {0x05be}},
51226031Sstas};
52226031Sstas
53226031Sstasstatic struct test failing_cases[] = {
54226031Sstas    {2, {0x05be, 0x0041}},
55226031Sstas    {3, {0x05be, 0x0041, 0x05be}},
56226031Sstas};
57226031Sstas
58226031Sstasint
59226031Sstasmain(void)
60226031Sstas{
61226031Sstas    unsigned i;
62226031Sstas    unsigned failures = 0;
63226031Sstas
64226031Sstas    for (i = 0; i < sizeof(passing_cases)/sizeof(passing_cases[0]); ++i) {
65226031Sstas	const struct test *t = &passing_cases[i];
66226031Sstas	if (_wind_stringprep_testbidi(t->vals, t->len, WIND_PROFILE_NAME)) {
67226031Sstas	    printf ("passing case %u failed\n", i);
68226031Sstas	    ++failures;
69226031Sstas	}
70226031Sstas    }
71226031Sstas
72226031Sstas    for (i = 0; i < sizeof(failing_cases)/sizeof(failing_cases[0]); ++i) {
73226031Sstas	const struct test *t = &failing_cases[i];
74226031Sstas	if (!_wind_stringprep_testbidi(t->vals, t->len, WIND_PROFILE_NAME)) {
75226031Sstas	    printf ("failing case %u passed\n", i);
76226031Sstas	    ++failures;
77226031Sstas	}
78226031Sstas    }
79226031Sstas
80226031Sstas    return failures != 0;
81226031Sstas}
82