#ifndef lint
static char *rcsid = "$Id: unicode.c,v 1.1 2003/06/04 00:26:16 marka Exp $";
#endif
#include <config.h>
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
#include <idn/result.h>
#include <idn/logmacro.h>
#include <idn/assert.h>
#include <idn/unicode.h>
#define UNICODE_CURRENT "3.2.0"
#define UCS_MAX 0x10ffff
#define END_BIT 0x80000000
#define SBase 0xac00
#define LBase 0x1100
#define VBase 0x1161
#define TBase 0x11a7
#define LCount 19
#define VCount 21
#define TCount 28
#define SLast (SBase + LCount * VCount * TCount)
#define compose_sym(a, b) compose_symX(a, b)
#define compose_symX(a, b) a ## b
struct composition {
unsigned long c2;
unsigned long comp;
};
#include "unicodedata_320.c"
#define VERSION v320
#include "unicode_template.c"
#undef VERSION
typedef int (*unicode_canonclassproc)(unsigned long v);
typedef int (*unicode_decomposeproc)(unsigned long c,
const unsigned long **seqp);
typedef int (*unicode_composeproc)(unsigned long c,
const struct composition **compp);
static struct idn__unicode_ops {
char *version;
unicode_canonclassproc canonclass_proc;
unicode_decomposeproc decompose_proc;
unicode_composeproc compose_proc;
} unicode_versions[] = {
#define MAKE_UNICODE_HANDLE(version, suffix) \
{ version, \
compose_sym(canonclass_, suffix), \
compose_sym(decompose_, suffix), \
compose_sym(compose_, suffix) }
MAKE_UNICODE_HANDLE("3.2.0", v320),
{ NULL },
#undef MAKE_UNICODE_HANDLE
};
idn_result_t
idn__unicode_create(const char *version,
idn__unicode_version_t *versionp) {
idn__unicode_version_t v;
assert(versionp != NULL);
TRACE(("idn__unicode_create(version=%-.50s)\n",
version == NULL ? "<NULL>" : version));
if (version == NULL)
version = UNICODE_CURRENT;
for (v = unicode_versions; v->version != NULL; v++) {
if (strcmp(v->version, version) == 0) {
*versionp = v;
return (idn_success);
}
}
return (idn_notfound);
}
void
idn__unicode_destroy(idn__unicode_version_t version) {
assert(version != NULL);
TRACE(("idn__unicode_destroy()\n"));
}
int
idn__unicode_canonicalclass(idn__unicode_version_t version, unsigned long c) {
if (c > UCS_MAX)
return (0);
return (*version->canonclass_proc)(c);
}
idn_result_t
idn__unicode_decompose(idn__unicode_version_t version,
int compat, unsigned long *v, size_t vlen,
unsigned long c, int *decomp_lenp) {
unsigned long *vorg = v;
int seqidx;
const unsigned long *seq;
assert(v != NULL && vlen >= 0 && decomp_lenp != NULL);
if (c > UCS_MAX)
return (idn_notfound);
if (SBase <= c && c < SLast) {
int idx, t_offset, v_offset, l_offset;
idx = c - SBase;
t_offset = idx % TCount;
idx /= TCount;
v_offset = idx % VCount;
l_offset = idx / VCount;
if ((t_offset == 0 && vlen < 2) || (t_offset > 0 && vlen < 3))
return (idn_buffer_overflow);
*v++ = LBase + l_offset;
*v++ = VBase + v_offset;
if (t_offset > 0)
*v++ = TBase + t_offset;
*decomp_lenp = v - vorg;
return (idn_success);
}
seqidx = (*version->decompose_proc)(c, &seq);
if (seqidx == 0 || (compat == 0 && (seqidx & DECOMP_COMPAT) != 0))
return (idn_notfound);
do {
unsigned long c;
int dlen;
idn_result_t r;
c = *seq & ~END_BIT;
r = idn__unicode_decompose(version, compat, v, vlen, c, &dlen);
if (r == idn_success) {
v += dlen;
vlen -= dlen;
} else if (r == idn_notfound) {
if (vlen < 1)
return (idn_buffer_overflow);
*v++ = c;
vlen--;
} else {
return (r);
}
} while ((*seq++ & END_BIT) == 0);
*decomp_lenp = v - vorg;
return (idn_success);
}
int
idn__unicode_iscompositecandidate(idn__unicode_version_t version,
unsigned long c) {
const struct composition *dummy;
if (c > UCS_MAX)
return (0);
if ((LBase <= c && c < LBase + LCount) || (SBase <= c && c < SLast))
return (1);
if ((*version->compose_proc)(c, &dummy) == 0)
return (0);
else
return (1);
}
idn_result_t
idn__unicode_compose(idn__unicode_version_t version, unsigned long c1,
unsigned long c2, unsigned long *compp) {
int n;
int lo, hi;
const struct composition *cseq;
assert(compp != NULL);
if (c1 > UCS_MAX || c2 > UCS_MAX)
return (idn_notfound);
if (LBase <= c1 && c1 < LBase + LCount &&
VBase <= c2 && c2 < VBase + VCount) {
*compp = SBase +
((c1 - LBase) * VCount + (c2 - VBase)) * TCount;
return (idn_success);
} else if (SBase <= c1 && c1 < SLast &&
TBase <= c2 && c2 < TBase + TCount &&
(c1 - SBase) % TCount == 0) {
*compp = c1 + (c2 - TBase);
return (idn_success);
}
if ((n = (*version->compose_proc)(c1, &cseq)) == 0)
return (idn_notfound);
lo = 0;
hi = n - 1;
while (lo <= hi) {
int mid = (lo + hi) / 2;
if (cseq[mid].c2 < c2) {
lo = mid + 1;
} else if (cseq[mid].c2 > c2) {
hi = mid - 1;
} else {
*compp = cseq[mid].comp;
return (idn_success);
}
}
return (idn_notfound);
}