Path: blob/main/crypto/heimdal/lib/wind/test-bidi.c
34907 views
/*1* Copyright (c) 2004 Kungliga Tekniska Högskolan2* (Royal Institute of Technology, Stockholm, Sweden).3* All rights reserved.4*5* Redistribution and use in source and binary forms, with or without6* modification, are permitted provided that the following conditions7* are met:8*9* 1. Redistributions of source code must retain the above copyright10* notice, this list of conditions and the following disclaimer.11*12* 2. Redistributions in binary form must reproduce the above copyright13* notice, this list of conditions and the following disclaimer in the14* documentation and/or other materials provided with the distribution.15*16* 3. Neither the name of the Institute nor the names of its contributors17* may be used to endorse or promote products derived from this software18* without specific prior written permission.19*20* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND21* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE22* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE23* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE24* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL25* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS26* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)27* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT28* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY29* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF30* SUCH DAMAGE.31*/3233#ifdef HAVE_CONFIG_H34#include <config.h>35#endif36#include <stdio.h>37#include "windlocl.h"3839#define MAX_LENGTH 104041struct test {42unsigned len;43uint32_t vals[MAX_LENGTH];44};4546static struct test passing_cases[] = {47{0, {0}},48{1, {0x0041}},49{1, {0x05be}},50};5152static struct test failing_cases[] = {53{2, {0x05be, 0x0041}},54{3, {0x05be, 0x0041, 0x05be}},55};5657int58main(void)59{60unsigned i;61unsigned failures = 0;6263for (i = 0; i < sizeof(passing_cases)/sizeof(passing_cases[0]); ++i) {64const struct test *t = &passing_cases[i];65if (_wind_stringprep_testbidi(t->vals, t->len, WIND_PROFILE_NAME)) {66printf ("passing case %u failed\n", i);67++failures;68}69}7071for (i = 0; i < sizeof(failing_cases)/sizeof(failing_cases[0]); ++i) {72const struct test *t = &failing_cases[i];73if (!_wind_stringprep_testbidi(t->vals, t->len, WIND_PROFILE_NAME)) {74printf ("failing case %u passed\n", i);75++failures;76}77}7879return failures != 0;80}818283