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