| 1 |
/* |
| 2 |
* Copyright (c) 2008 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 <string.h> |
| 39 |
#include <err.h> |
| 40 |
#include <assert.h> |
| 41 |
#include "windlocl.h" |
| 42 |
|
| 43 |
#define MAX_LENGTH 10 |
| 44 |
|
| 45 |
struct testcase { |
| 46 |
uint32_t in[MAX_LENGTH]; |
| 47 |
size_t ilen; |
| 48 |
uint32_t out[MAX_LENGTH]; |
| 49 |
size_t olen; |
| 50 |
}; |
| 51 |
|
| 52 |
static const struct testcase testcases[] = { |
| 53 |
{ { 0x20 }, 1, { 0 }, 0 }, |
| 54 |
{ { 0x20, 0x61 }, 2, { 0x20, 0x61, 0x20}, 3 }, |
| 55 |
{ { 0x20, 0x61, 0x20 }, 3, { 0x20, 0x61, 0x20}, 3 }, |
| 56 |
{ { 0x20, 0x61, 0x20, 0x61 }, 4, { 0x20, 0x61, 0x20, 0x20, 0x61, 0x20}, 6 } |
| 57 |
}; |
| 58 |
|
| 59 |
static const struct testcase testcases2[] = { |
| 60 |
{ { 0x20 }, 1, { 0x20 }, 1 }, |
| 61 |
{ { 0x20, 0x41 }, 2, { 0x20, 0x61}, 2 } |
| 62 |
}; |
| 63 |
|
| 64 |
|
| 65 |
int |
| 66 |
main(void) |
| 67 |
{ |
| 68 |
uint32_t out[MAX_LENGTH]; |
| 69 |
unsigned failures = 0; |
| 70 |
unsigned i; |
| 71 |
size_t olen; |
| 72 |
int ret; |
| 73 |
|
| 74 |
|
| 75 |
for (i = 0; i < sizeof(testcases)/sizeof(testcases[0]); ++i) { |
| 76 |
const struct testcase *t = &testcases[i]; |
| 77 |
|
| 78 |
olen = sizeof(out)/sizeof(out[0]); |
| 79 |
assert(olen > t->olen); |
| 80 |
|
| 81 |
ret = _wind_ldap_case_exact_attribute(t->in, t->ilen, out, &olen); |
| 82 |
if (ret) { |
| 83 |
printf("wlcea: %u: %d\n", i, ret); |
| 84 |
++failures; |
| 85 |
continue; |
| 86 |
} |
| 87 |
if (olen != t->olen) { |
| 88 |
printf("len wlcea: %u %u != %u\n", i, |
| 89 |
(unsigned)olen, (unsigned)t->olen); |
| 90 |
failures++; |
| 91 |
continue; |
| 92 |
} |
| 93 |
if (memcmp(t->out, out, sizeof(out[0]) * olen) != 0) { |
| 94 |
printf("memcmp wlcea: %u\n", i); |
| 95 |
failures++; |
| 96 |
continue; |
| 97 |
} |
| 98 |
} |
| 99 |
|
| 100 |
for (i = 0; i < sizeof(testcases2)/sizeof(testcases2[0]); ++i) { |
| 101 |
const struct testcase *t = &testcases2[i]; |
| 102 |
|
| 103 |
olen = sizeof(out)/sizeof(out[0]); |
| 104 |
assert(olen > t->olen); |
| 105 |
|
| 106 |
ret = wind_stringprep(t->in, t->ilen, out, &olen, |
| 107 |
WIND_PROFILE_LDAP_CASE); |
| 108 |
|
| 109 |
if (ret) { |
| 110 |
printf("wsplc: %u: %d\n", i, ret); |
| 111 |
++failures; |
| 112 |
continue; |
| 113 |
} |
| 114 |
|
| 115 |
if (olen != t->olen) { |
| 116 |
printf("strlen wsplc: %u: %d\n", i, ret); |
| 117 |
++failures; |
| 118 |
continue; |
| 119 |
} |
| 120 |
if (memcmp(t->out, out, sizeof(out[0]) * olen) != 0) { |
| 121 |
printf("memcmp wsplc: %u\n", i); |
| 122 |
failures++; |
| 123 |
continue; |
| 124 |
} |
| 125 |
} |
| 126 |
|
| 127 |
return failures != 0; |
| 128 |
} |