No empty .Rs/.Re
[netbsd-mini2440.git] / crypto / dist / heimdal / lib / krb5 / parse-name-test.c
blobde45f49733ed0cf72042480bff86b374bf77ccc1
1 /*
2 * Copyright (c) 2002 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
4 * All rights reserved.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
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.
17 * 3. Neither the name of KTH nor the names of its contributors may be
18 * used to endorse or promote products derived from this software without
19 * specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY KTH AND ITS CONTRIBUTORS ``AS IS'' AND ANY
22 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
24 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL KTH OR ITS CONTRIBUTORS BE
25 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
26 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
27 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
28 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
29 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
30 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
31 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */
33 #include "krb5_locl.h"
34 #include <err.h>
36 __RCSID("$Heimdal: parse-name-test.c 16342 2005-12-02 14:14:43Z lha $"
37 "$NetBSD$");
39 enum { MAX_COMPONENTS = 3 };
41 static struct testcase {
42 const char *input_string;
43 const char *output_string;
44 krb5_realm realm;
45 unsigned ncomponents;
46 char *comp_val[MAX_COMPONENTS];
47 int realmp;
48 } tests[] = {
49 {"", "@", "", 1, {""}, FALSE},
50 {"a", "a@", "", 1, {"a"}, FALSE},
51 {"\\n", "\\n@", "", 1, {"\n"}, FALSE},
52 {"\\ ", "\\ @", "", 1, {" "}, FALSE},
53 {"\\t", "\\t@", "", 1, {"\t"}, FALSE},
54 {"\\b", "\\b@", "", 1, {"\b"}, FALSE},
55 {"\\\\", "\\\\@", "", 1, {"\\"}, FALSE},
56 {"\\/", "\\/@", "", 1, {"/"}, FALSE},
57 {"\\@", "\\@@", "", 1, {"@"}, FALSE},
58 {"@", "@", "", 1, {""}, TRUE},
59 {"a/b", "a/b@", "", 2, {"a", "b"}, FALSE},
60 {"a/", "a/@", "", 2, {"a", ""}, FALSE},
61 {"a\\//\\/", "a\\//\\/@", "", 2, {"a/", "/"}, FALSE},
62 {"/a", "/a@", "", 2, {"", "a"}, FALSE},
63 {"\\@@\\@", "\\@@\\@", "@", 1, {"@"}, TRUE},
64 {"a/b/c", "a/b/c@", "", 3, {"a", "b", "c"}, FALSE},
65 {NULL, NULL, "", 0, { NULL }, FALSE}};
67 int KRB5_LIB_FUNCTION
68 main(int argc, char **argv)
70 struct testcase *t;
71 krb5_context context;
72 krb5_error_code ret;
73 int val = 0;
75 ret = krb5_init_context (&context);
76 if (ret)
77 errx (1, "krb5_init_context failed: %d", ret);
79 /* to enable realm-less principal name above */
81 krb5_set_default_realm(context, "");
83 for (t = tests; t->input_string; ++t) {
84 krb5_principal princ;
85 int i, j;
86 char name_buf[1024];
87 char *s;
89 ret = krb5_parse_name(context, t->input_string, &princ);
90 if (ret)
91 krb5_err (context, 1, ret, "krb5_parse_name %s",
92 t->input_string);
93 if (strcmp (t->realm, princ->realm) != 0) {
94 printf ("wrong realm (\"%s\" should be \"%s\")"
95 " for \"%s\"\n",
96 princ->realm, t->realm,
97 t->input_string);
98 val = 1;
101 if (t->ncomponents != princ->name.name_string.len) {
102 printf ("wrong number of components (%u should be %u)"
103 " for \"%s\"\n",
104 princ->name.name_string.len, t->ncomponents,
105 t->input_string);
106 val = 1;
107 } else {
108 for (i = 0; i < t->ncomponents; ++i) {
109 if (strcmp(t->comp_val[i],
110 princ->name.name_string.val[i]) != 0) {
111 printf ("bad component %d (\"%s\" should be \"%s\")"
112 " for \"%s\"\n",
114 princ->name.name_string.val[i],
115 t->comp_val[i],
116 t->input_string);
117 val = 1;
121 for (j = 0; j < strlen(t->output_string); ++j) {
122 ret = krb5_unparse_name_fixed(context, princ,
123 name_buf, j);
124 if (ret != ERANGE) {
125 printf ("unparse_name %s with length %d should have failed\n",
126 t->input_string, j);
127 val = 1;
128 break;
131 ret = krb5_unparse_name_fixed(context, princ,
132 name_buf, sizeof(name_buf));
133 if (ret)
134 krb5_err (context, 1, ret, "krb5_unparse_name_fixed");
136 if (strcmp (t->output_string, name_buf) != 0) {
137 printf ("failed comparing the re-parsed"
138 " (\"%s\" should be \"%s\")\n",
139 name_buf, t->output_string);
140 val = 1;
143 ret = krb5_unparse_name(context, princ, &s);
144 if (ret)
145 krb5_err (context, 1, ret, "krb5_unparse_name");
147 if (strcmp (t->output_string, s) != 0) {
148 printf ("failed comparing the re-parsed"
149 " (\"%s\" should be \"%s\"\n",
150 s, t->output_string);
151 val = 1;
153 free(s);
155 if (!t->realmp) {
156 for (j = 0; j < strlen(t->input_string); ++j) {
157 ret = krb5_unparse_name_fixed_short(context, princ,
158 name_buf, j);
159 if (ret != ERANGE) {
160 printf ("unparse_name_short %s with length %d"
161 " should have failed\n",
162 t->input_string, j);
163 val = 1;
164 break;
167 ret = krb5_unparse_name_fixed_short(context, princ,
168 name_buf, sizeof(name_buf));
169 if (ret)
170 krb5_err (context, 1, ret, "krb5_unparse_name_fixed");
172 if (strcmp (t->input_string, name_buf) != 0) {
173 printf ("failed comparing the re-parsed"
174 " (\"%s\" should be \"%s\")\n",
175 name_buf, t->input_string);
176 val = 1;
179 ret = krb5_unparse_name_short(context, princ, &s);
180 if (ret)
181 krb5_err (context, 1, ret, "krb5_unparse_name_short");
183 if (strcmp (t->input_string, s) != 0) {
184 printf ("failed comparing the re-parsed"
185 " (\"%s\" should be \"%s\"\n",
186 s, t->input_string);
187 val = 1;
189 free(s);
191 krb5_free_principal (context, princ);
193 krb5_free_context(context);
194 return val;