1*ae771770SStanislav Sedov /*
2*ae771770SStanislav Sedov * Copyright (c) 2008 Kungliga Tekniska Högskolan
3*ae771770SStanislav Sedov * (Royal Institute of Technology, Stockholm, Sweden).
4*ae771770SStanislav Sedov * All rights reserved.
5*ae771770SStanislav Sedov *
6*ae771770SStanislav Sedov * Redistribution and use in source and binary forms, with or without
7*ae771770SStanislav Sedov * modification, are permitted provided that the following conditions
8*ae771770SStanislav Sedov * are met:
9*ae771770SStanislav Sedov *
10*ae771770SStanislav Sedov * 1. Redistributions of source code must retain the above copyright
11*ae771770SStanislav Sedov * notice, this list of conditions and the following disclaimer.
12*ae771770SStanislav Sedov *
13*ae771770SStanislav Sedov * 2. Redistributions in binary form must reproduce the above copyright
14*ae771770SStanislav Sedov * notice, this list of conditions and the following disclaimer in the
15*ae771770SStanislav Sedov * documentation and/or other materials provided with the distribution.
16*ae771770SStanislav Sedov *
17*ae771770SStanislav Sedov * 3. Neither the name of the Institute nor the names of its contributors
18*ae771770SStanislav Sedov * may be used to endorse or promote products derived from this software
19*ae771770SStanislav Sedov * without specific prior written permission.
20*ae771770SStanislav Sedov *
21*ae771770SStanislav Sedov * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22*ae771770SStanislav Sedov * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23*ae771770SStanislav Sedov * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24*ae771770SStanislav Sedov * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25*ae771770SStanislav Sedov * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26*ae771770SStanislav Sedov * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27*ae771770SStanislav Sedov * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28*ae771770SStanislav Sedov * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29*ae771770SStanislav Sedov * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30*ae771770SStanislav Sedov * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31*ae771770SStanislav Sedov * SUCH DAMAGE.
32*ae771770SStanislav Sedov */
33*ae771770SStanislav Sedov
34*ae771770SStanislav Sedov #ifdef HAVE_CONFIG_H
35*ae771770SStanislav Sedov #include <config.h>
36*ae771770SStanislav Sedov #endif
37*ae771770SStanislav Sedov #include <stdio.h>
38*ae771770SStanislav Sedov #include <string.h>
39*ae771770SStanislav Sedov #include <err.h>
40*ae771770SStanislav Sedov #include <assert.h>
41*ae771770SStanislav Sedov #include "windlocl.h"
42*ae771770SStanislav Sedov
43*ae771770SStanislav Sedov #define MAX_LENGTH 10
44*ae771770SStanislav Sedov
45*ae771770SStanislav Sedov struct testcase {
46*ae771770SStanislav Sedov uint32_t in[MAX_LENGTH];
47*ae771770SStanislav Sedov size_t ilen;
48*ae771770SStanislav Sedov uint32_t out[MAX_LENGTH];
49*ae771770SStanislav Sedov size_t olen;
50*ae771770SStanislav Sedov };
51*ae771770SStanislav Sedov
52*ae771770SStanislav Sedov static const struct testcase testcases[] = {
53*ae771770SStanislav Sedov { { 0x20 }, 1, { 0 }, 0 },
54*ae771770SStanislav Sedov { { 0x20, 0x61 }, 2, { 0x20, 0x61, 0x20}, 3 },
55*ae771770SStanislav Sedov { { 0x20, 0x61, 0x20 }, 3, { 0x20, 0x61, 0x20}, 3 },
56*ae771770SStanislav Sedov { { 0x20, 0x61, 0x20, 0x61 }, 4, { 0x20, 0x61, 0x20, 0x20, 0x61, 0x20}, 6 }
57*ae771770SStanislav Sedov };
58*ae771770SStanislav Sedov
59*ae771770SStanislav Sedov static const struct testcase testcases2[] = {
60*ae771770SStanislav Sedov { { 0x20 }, 1, { 0x20 }, 1 },
61*ae771770SStanislav Sedov { { 0x20, 0x41 }, 2, { 0x20, 0x61}, 2 }
62*ae771770SStanislav Sedov };
63*ae771770SStanislav Sedov
64*ae771770SStanislav Sedov
65*ae771770SStanislav Sedov int
main(void)66*ae771770SStanislav Sedov main(void)
67*ae771770SStanislav Sedov {
68*ae771770SStanislav Sedov uint32_t out[MAX_LENGTH];
69*ae771770SStanislav Sedov unsigned failures = 0;
70*ae771770SStanislav Sedov unsigned i;
71*ae771770SStanislav Sedov size_t olen;
72*ae771770SStanislav Sedov int ret;
73*ae771770SStanislav Sedov
74*ae771770SStanislav Sedov
75*ae771770SStanislav Sedov for (i = 0; i < sizeof(testcases)/sizeof(testcases[0]); ++i) {
76*ae771770SStanislav Sedov const struct testcase *t = &testcases[i];
77*ae771770SStanislav Sedov
78*ae771770SStanislav Sedov olen = sizeof(out)/sizeof(out[0]);
79*ae771770SStanislav Sedov assert(olen > t->olen);
80*ae771770SStanislav Sedov
81*ae771770SStanislav Sedov ret = _wind_ldap_case_exact_attribute(t->in, t->ilen, out, &olen);
82*ae771770SStanislav Sedov if (ret) {
83*ae771770SStanislav Sedov printf("wlcea: %u: %d\n", i, ret);
84*ae771770SStanislav Sedov ++failures;
85*ae771770SStanislav Sedov continue;
86*ae771770SStanislav Sedov }
87*ae771770SStanislav Sedov if (olen != t->olen) {
88*ae771770SStanislav Sedov printf("len wlcea: %u %u != %u\n", i,
89*ae771770SStanislav Sedov (unsigned)olen, (unsigned)t->olen);
90*ae771770SStanislav Sedov failures++;
91*ae771770SStanislav Sedov continue;
92*ae771770SStanislav Sedov }
93*ae771770SStanislav Sedov if (memcmp(t->out, out, sizeof(out[0]) * olen) != 0) {
94*ae771770SStanislav Sedov printf("memcmp wlcea: %u\n", i);
95*ae771770SStanislav Sedov failures++;
96*ae771770SStanislav Sedov continue;
97*ae771770SStanislav Sedov }
98*ae771770SStanislav Sedov }
99*ae771770SStanislav Sedov
100*ae771770SStanislav Sedov for (i = 0; i < sizeof(testcases2)/sizeof(testcases2[0]); ++i) {
101*ae771770SStanislav Sedov const struct testcase *t = &testcases2[i];
102*ae771770SStanislav Sedov
103*ae771770SStanislav Sedov olen = sizeof(out)/sizeof(out[0]);
104*ae771770SStanislav Sedov assert(olen > t->olen);
105*ae771770SStanislav Sedov
106*ae771770SStanislav Sedov ret = wind_stringprep(t->in, t->ilen, out, &olen,
107*ae771770SStanislav Sedov WIND_PROFILE_LDAP_CASE);
108*ae771770SStanislav Sedov
109*ae771770SStanislav Sedov if (ret) {
110*ae771770SStanislav Sedov printf("wsplc: %u: %d\n", i, ret);
111*ae771770SStanislav Sedov ++failures;
112*ae771770SStanislav Sedov continue;
113*ae771770SStanislav Sedov }
114*ae771770SStanislav Sedov
115*ae771770SStanislav Sedov if (olen != t->olen) {
116*ae771770SStanislav Sedov printf("strlen wsplc: %u: %d\n", i, ret);
117*ae771770SStanislav Sedov ++failures;
118*ae771770SStanislav Sedov continue;
119*ae771770SStanislav Sedov }
120*ae771770SStanislav Sedov if (memcmp(t->out, out, sizeof(out[0]) * olen) != 0) {
121*ae771770SStanislav Sedov printf("memcmp wsplc: %u\n", i);
122*ae771770SStanislav Sedov failures++;
123*ae771770SStanislav Sedov continue;
124*ae771770SStanislav Sedov }
125*ae771770SStanislav Sedov }
126*ae771770SStanislav Sedov
127*ae771770SStanislav Sedov return failures != 0;
128*ae771770SStanislav Sedov }
129