#ifndef lint
#endif
/*
* Copyright (c) 2001,2002 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
* 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,
* materials provided with the distribution. For the purposes of binary
* distribution the "Copyright Notice" refers to the following language:
* "Copyright (c) 2000-2002 Japan Network Information Center. All rights reserved."
*
* 4. The name of JPNIC may not 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.
*/
#include <config.h>
#include <stdlib.h>
#include <string.h>
#include <idn/logmacro.h>
#include <idn/nameprep.h>
/*
* Load NAMEPREP compiled tables.
*/
#include "nameprepdata.c"
/*
*/
#include "nameprep_template.c"
typedef const char *(*nameprep_mapproc)(unsigned long v);
typedef int (*nameprep_checkproc)(unsigned long v);
static struct idn_nameprep {
char *version;
} nameprep_versions[] = {
{ version, \
};
const unsigned long *str,
const unsigned long **found);
TRACE(("idn_nameprep_create(version=%-.50s)\n",
/*
* Lookup table for the specified version. Since the number of
* versions won't be large (I don't want see draft-23 or such :-),
* simple linear search is OK.
*/
return (idn_success);
}
}
return (idn_notfound);
}
void
TRACE(("idn_nameprep_destroy()\n"));
/* Nothing to do. */
}
TRACE(("idn_nameprep_map(ctx=%s, from=\"%s\")\n",
while (*from != '\0') {
unsigned long v = *from;
const char *mapped;
if (v > UCS_MAX) {
/* This cannot happen, but just in case.. */
return (idn_invalid_codepoint);
} else if (v > UNICODE_MAX) {
/* No mapping is possible. */
} else {
/* Try mapping. */
}
/* No mapping. Just copy verbatim. */
if (tolen < 1)
return (idn_buffer_overflow);
*to++ = v;
tolen--;
} else {
const unsigned char *mappeddata;
return (idn_buffer_overflow);
while (mappedlen >= 4) {
*to = *mappeddata++;
mappedlen -= 4;
to++;
}
if (mappedlen > 0) {
*to = *mappeddata++;
*mappeddata++ << 8: 0;
*mappeddata++ << 16: 0;
to++;
}
}
from++;
}
if (tolen == 0)
return (idn_buffer_overflow);
*to = '\0';
return (idn_success);
}
const unsigned long **found) {
TRACE(("idn_nameprep_isprohibited(ctx=%s, str=\"%s\")\n",
}
const unsigned long **found) {
TRACE(("idn_nameprep_isunassigned(handle->version, str=\"%s\")\n",
}
static idn_result_t
const unsigned long **found) {
unsigned long v;
while (*str != '\0') {
v = *str;
if (v > UCS_MAX) {
/* This cannot happen, but just in case.. */
return (idn_invalid_codepoint);
} else if (v > UNICODE_MAX) {
/* It is invalid.. */
return (idn_success);
} else if ((*proc)(v)) {
return (idn_success);
}
str++;
}
return (idn_success);
}
const unsigned long **found) {
unsigned long v;
int found_r_al;
TRACE(("idn_nameprep_isvalidbidi(ctx=%s, str=\"%s\")\n",
if (*str == '\0') {
return (idn_success);
}
/*
* check first character's type and initialize variables.
*/
found_r_al = 0;
/* This cannot happen, but just in case.. */
return (idn_invalid_codepoint);
} else if (*str > UNICODE_MAX) {
/* It is invalid.. */
return (idn_success);
}
if (first_char == idn_biditype_r_al) {
found_r_al = 1;
}
str++;
/*
* see whether string is valid or not.
*/
while (*str != '\0') {
v = *str;
if (v > UCS_MAX) {
/* This cannot happen, but just in case.. */
return (idn_invalid_codepoint);
} else if (v > UNICODE_MAX) {
/* It is invalid.. */
return (idn_success);
} else {
return (idn_success);
}
return (idn_success);
}
if (last_char == idn_biditype_r_al) {
found_r_al = 1;
}
}
str++;
}
if (found_r_al) {
if (last_char != idn_biditype_r_al) {
return (idn_success);
}
}
return (idn_success);
}
}
void
}
}
const unsigned long **found) {
}
const unsigned long **found) {
}
const unsigned long **found) {
}