1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294
|
#ifndef lint
static char *rcsid = "$Id: ace.c,v 1.2.2.2 2002/01/18 08:31:12 m-kasahr Exp $";
#endif
/*
* Copyright (c) 2000,2001 Japan Network Information Center.
* All rights reserved.
*
* By using this file, you agree to the terms and conditions set forth bellow.
*
* LICENSE TERMS AND CONDITIONS
*
* The following License Terms and Conditions apply, unless a different
* license is obtained from Japan Network Information Center ("JPNIC"),
* a Japanese association, Kokusai-Kougyou-Kanda Bldg 6F, 2-3-4 Uchi-Kanda,
* Chiyoda-ku, Tokyo 101-0047, Japan.
*
* 1. Use, Modification and Redistribution (including distribution of any
* modified or derived work) in source and/or binary forms is permitted
* under this License Terms and Conditions.
*
* 2. Redistribution of source code must retain the copyright notices as they
* appear in each source code file, this License Terms and Conditions.
*
* 3. Redistribution in binary form must reproduce the Copyright Notice,
* this License Terms and Conditions, in the documentation and/or other
* materials provided with the distribution. For the purposes of binary
* distribution the "Copyright Notice" refers to the following language:
* "Copyright (c) Japan Network Information Center. All rights reserved."
*
* 4. Neither the name of JPNIC may be used to endorse or promote products
* derived from this Software without specific prior written approval of
* JPNIC.
*
* 5. Disclaimer/Limitation of Liability: THIS SOFTWARE IS PROVIDED BY JPNIC
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JPNIC BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
*
* 6. Indemnification by Licensee
* Any person or entities using and/or redistributing this Software under
* this License Terms and Conditions shall defend indemnify and hold
* harmless JPNIC from and against any and all judgements damages,
* expenses, settlement liabilities, cost and other liabilities of any
* kind as a result of use and redistribution of this Software or any
* claim, suite, action, litigation or proceeding by any third party
* arising out of or relates to this License Terms and Conditions.
*
* 7. Governing Law, Jurisdiction and Venue
* This License Terms and Conditions shall be governed by and and
* construed in accordance with the law of Japan. Any person or entities
* using and/or redistributing this Software under this License Terms and
* Conditions hereby agrees and consent to the personal and exclusive
* jurisdiction and venue of Tokyo District Court of Japan.
*/
#include <config.h>
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
#include <mdn/result.h>
#include <mdn/assert.h>
#include <mdn/converter.h>
#include <mdn/util.h>
#include <mdn/ace.h>
static mdn_result_t l2u(mdn__ace_t *ctx, const char *from, const char *end,
char *to, size_t tolen, size_t *clenp);
static mdn_result_t u2l(mdn__ace_t *ctx, const char *from, const char *end,
char *to, size_t tolen, size_t *clenp);
mdn_result_t
mdn__ace_convert(mdn__ace_t *ctx, mdn_converter_dir_t dir,
const char *from, char *to, size_t tolen)
{
assert(ctx != NULL && ctx->encoder != NULL && ctx->decoder != NULL &&
from != NULL && to != NULL &&
(dir == mdn_converter_l2u || dir == mdn_converter_u2l));
for (;;) {
const char *end;
size_t convlen = 0;
mdn_result_t r;
/*
* Find the end of this component (label).
*/
if ((end = strchr(from, '.')) == NULL)
end = from + strlen(from);
/*
* Convert it.
*/
if (end > from) {
if (dir == mdn_converter_l2u)
r = l2u(ctx, from, end, to, tolen, &convlen);
else
r = u2l(ctx, from, end, to, tolen, &convlen);
if (r != mdn_success)
return (r);
}
/*
* Copy '.' or NUL.
*/
if (tolen <= convlen)
return (mdn_buffer_overflow);
to += convlen;
*to++ = *end;
tolen -= convlen + 1;
/*
* Finished?
*/
if (*end == '\0') {
break;
} else if (*(end + 1) == '\0') {
/* End with '.' */
if (tolen < 1)
return (mdn_buffer_overflow);
*to++ = '\0';
tolen--;
break;
}
from = end + 1;
}
return (mdn_success);
}
static mdn_result_t
l2u(mdn__ace_t *ctx, const char *from, const char *end,
char *to, size_t tolen, size_t *clenp)
{
size_t acelen = end - from;
size_t idlen = strlen(ctx->id_str);
size_t utflen;
const char *top;
mdn_result_t r;
char *buf;
char local_buf[256];
if (ctx->id_type == mdn__ace_prefix &&
acelen >= idlen &&
mdn_util_casematch(from, ctx->id_str, idlen)) {
/*
* Prefix found.
*/
top = from + idlen;
acelen -= idlen;
} else if (ctx->id_type == mdn__ace_suffix &&
acelen >= idlen &&
mdn_util_casematch(end - idlen, ctx->id_str, idlen)) {
/*
* Suffix found.
*/
top = from;
acelen -= idlen;
} else {
/*
* Not ACE encoded.
*/
copy:
/*
* Check if it comforms to STD-13.
*/
if (!mdn_util_validstd13(from, end)) {
/* invalid character found */
return (mdn_invalid_encoding);
}
/*
* Copy verbatim.
*/
acelen = end - from;
if (tolen < acelen)
return (mdn_buffer_overflow);
(void)memcpy(to, from, acelen);
*clenp = acelen;
return (mdn_success);
}
/*
* Now, top and acelen refers the ACE encoded name
* without prefix/suffix.
*/
/* Decode it. */
r = (*ctx->decoder)(top, acelen, to, tolen);
if (r == mdn_invalid_encoding)
goto copy;
else if (r != mdn_success)
return (r);
*clenp = utflen = strlen(to);
/*
* Check if the decode result is a STD13 conforming name.
*/
if (mdn_util_validstd13(to, to + utflen))
return (mdn_invalid_encoding);
/*
* Do round-trip conversion check. Encode the decoded result,
* and compare it with the original. If they don't match,
* the original name must be illegally encoded.
*
* We need a buffer at least acelen+1 (for the NUL byte) bytes long.
*/
if (acelen >= sizeof(local_buf)) {
if ((buf = malloc(acelen + 1)) == NULL)
return (mdn_nomemory);
} else {
buf = local_buf;
}
if ((*ctx->encoder)(to, utflen, buf, acelen + 1) != mdn_success ||
strlen(buf) != acelen ||
!mdn_util_casematch(buf, top, acelen)) {
r = mdn_invalid_encoding;
}
if (buf != local_buf)
free(buf);
return (r);
}
static mdn_result_t
u2l(mdn__ace_t *ctx, const char *from, const char *end,
char *to, size_t tolen, size_t *clenp)
{
size_t len = end - from;
/*
* See if encoding is really necessary.
*/
if (!mdn_util_validstd13(from, end)) {
/*
* Conversion is necessary.
*/
mdn_result_t r;
size_t idlen = strlen(ctx->id_str);
size_t acelen;
if (mdn_util_havenonldhascii(from, end))
return (mdn_prohibited);
if (ctx->id_type == mdn__ace_prefix) {
/* Prepend prefix. */
if (tolen < idlen)
return (mdn_buffer_overflow);
(void)memcpy(to, ctx->id_str, idlen);
to += idlen;
tolen -= idlen;
}
r = (*ctx->encoder)(from, len, to, tolen);
if (r != mdn_success)
return (r);
acelen = strlen(to);
if (ctx->id_type == mdn__ace_suffix) {
/* Append suffix. */
if (acelen + idlen > tolen)
return (mdn_buffer_overflow);
(void)memcpy(to + acelen, ctx->id_str, idlen);
}
len = idlen + acelen;
} else {
/*
* Conversion is NOT necessary.
* Copy verbatim.
*/
if (tolen < len)
return (mdn_buffer_overflow);
(void)memcpy(to, from, len);
}
*clenp = len;
return (mdn_success);
}
|