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