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 <stdlib.h> 39226031Sstas#include <string.h> 40226031Sstas#include <err.h> 41226031Sstas 42226031Sstas#include "windlocl.h" 43226031Sstas 44226031Sstas#define MAX_LENGTH 2 45226031Sstas 46226031Sstasstruct example { 47226031Sstas uint32_t in[MAX_LENGTH]; 48226031Sstas size_t in_len; 49226031Sstas uint32_t out[MAX_LENGTH]; 50226031Sstas size_t out_len; 51226031Sstas}; 52226031Sstas 53226031Sstasstatic struct example cases[] = { 54226031Sstas {{0}, 0, {0}, 0}, 55226031Sstas {{0x0041}, 1, {0x0061}, 1}, 56226031Sstas {{0x0061}, 1, {0x0061}, 1}, 57226031Sstas {{0x00AD}, 1, {0}, 0}, 58226031Sstas {{0x00DF}, 1, {0x0073, 0x0073}, 2} 59226031Sstas}; 60226031Sstas 61226031Sstasstatic int 62226031Sstastry(const struct example *c) 63226031Sstas{ 64226031Sstas int ret; 65226031Sstas size_t out_len = c->out_len; 66226031Sstas uint32_t *tmp = malloc(out_len * sizeof(uint32_t)); 67226031Sstas if (tmp == NULL && out_len != 0) 68226031Sstas err(1, "malloc"); 69226031Sstas ret = _wind_stringprep_map(c->in, c->in_len, tmp, &out_len, WIND_PROFILE_NAME); 70226031Sstas if (ret) { 71226031Sstas printf("wind_stringprep_map failed\n"); 72226031Sstas return 1; 73226031Sstas } 74226031Sstas if (out_len != c->out_len) { 75226031Sstas printf("wrong out len\n"); 76226031Sstas free(tmp); 77226031Sstas return 1; 78226031Sstas } 79226031Sstas if (memcmp(c->out, tmp, out_len * sizeof(uint32_t)) != 0) { 80226031Sstas printf("wrong out data\n"); 81226031Sstas free(tmp); 82226031Sstas return 1; 83226031Sstas } 84226031Sstas free(tmp); 85226031Sstas return 0; 86226031Sstas} 87226031Sstas 88226031Sstasint 89226031Sstasmain(void) 90226031Sstas{ 91226031Sstas unsigned i; 92226031Sstas unsigned failures = 0; 93226031Sstas 94226031Sstas for (i = 0; i < sizeof(cases)/sizeof(cases[0]); ++i) 95226031Sstas failures += try(&cases[i]); 96226031Sstas return failures != 0; 97226031Sstas} 98226031Sstas 99