| 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 <stdlib.h>
|
|---|
| 39 | #include <string.h>
|
|---|
| 40 | #include <err.h>
|
|---|
| 41 |
|
|---|
| 42 | #include "windlocl.h"
|
|---|
| 43 |
|
|---|
| 44 | #define MAX_LENGTH 2
|
|---|
| 45 |
|
|---|
| 46 | struct example {
|
|---|
| 47 | uint32_t in[MAX_LENGTH];
|
|---|
| 48 | size_t in_len;
|
|---|
| 49 | uint32_t out[MAX_LENGTH];
|
|---|
| 50 | size_t out_len;
|
|---|
| 51 | };
|
|---|
| 52 |
|
|---|
| 53 | static struct example cases[] = {
|
|---|
| 54 | {{0}, 0, {0}, 0},
|
|---|
| 55 | {{0x0041}, 1, {0x0061}, 1},
|
|---|
| 56 | {{0x0061}, 1, {0x0061}, 1},
|
|---|
| 57 | {{0x00AD}, 1, {0}, 0},
|
|---|
| 58 | {{0x00DF}, 1, {0x0073, 0x0073}, 2}
|
|---|
| 59 | };
|
|---|
| 60 |
|
|---|
| 61 | static int
|
|---|
| 62 | try(const struct example *c)
|
|---|
| 63 | {
|
|---|
| 64 | int ret;
|
|---|
| 65 | size_t out_len = c->out_len;
|
|---|
| 66 | uint32_t *tmp = malloc(out_len * sizeof(uint32_t));
|
|---|
| 67 | if (tmp == NULL && out_len != 0)
|
|---|
| 68 | err(1, "malloc");
|
|---|
| 69 | ret = _wind_stringprep_map(c->in, c->in_len, tmp, &out_len, WIND_PROFILE_NAME);
|
|---|
| 70 | if (ret) {
|
|---|
| 71 | printf("wind_stringprep_map failed\n");
|
|---|
| 72 | return 1;
|
|---|
| 73 | }
|
|---|
| 74 | if (out_len != c->out_len) {
|
|---|
| 75 | printf("wrong out len\n");
|
|---|
| 76 | free(tmp);
|
|---|
| 77 | return 1;
|
|---|
| 78 | }
|
|---|
| 79 | if (memcmp(c->out, tmp, out_len * sizeof(uint32_t)) != 0) {
|
|---|
| 80 | printf("wrong out data\n");
|
|---|
| 81 | free(tmp);
|
|---|
| 82 | return 1;
|
|---|
| 83 | }
|
|---|
| 84 | free(tmp);
|
|---|
| 85 | return 0;
|
|---|
| 86 | }
|
|---|
| 87 |
|
|---|
| 88 | int
|
|---|
| 89 | main(void)
|
|---|
| 90 | {
|
|---|
| 91 | unsigned i;
|
|---|
| 92 | unsigned failures = 0;
|
|---|
| 93 |
|
|---|
| 94 | for (i = 0; i < sizeof(cases)/sizeof(cases[0]); ++i)
|
|---|
| 95 | failures += try(&cases[i]);
|
|---|
| 96 | return failures != 0;
|
|---|
| 97 | }
|
|---|
| 98 |
|
|---|