2 /* $NetBSD: citrus_viqr.c,v 1.5 2011/11/19 18:20:13 tnozaki Exp $ */
5 * Copyright (c)2006 Citrus Project,
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * 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 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 #include <sys/cdefs.h>
32 #include <sys/queue.h>
33 #include <sys/types.h>
44 #include "citrus_namespace.h"
45 #include "citrus_types.h"
46 #include "citrus_bcs.h"
47 #include "citrus_module.h"
48 #include "citrus_stdenc.h"
49 #include "citrus_viqr.h"
54 * this table generated from RFC 1456.
56 static const char *mnemonic_rfc1456[0x100] = {
57 NULL , NULL , "A(?", NULL , NULL , "A(~", "A^~", NULL ,
58 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
59 NULL , NULL , NULL , NULL , "Y?" , NULL , NULL , NULL ,
60 NULL , "Y~" , NULL , NULL , NULL , NULL , "Y." , NULL ,
61 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
62 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
63 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
64 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
65 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
66 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
67 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
68 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
69 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
70 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
71 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
72 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
73 "A." , "A('", "A(`", "A(.", "A^'", "A^`", "A^?", "A^.",
74 "E~" , "E." , "E^'", "E^`", "E^?", "E^~", "E^.", "O^'",
75 "O^`", "O^?", "O^~", "O^.", "O+.", "O+'", "O+`", "O+?",
76 "I." , "O?" , "O." , "I?" , "U?" , "U~" , "U." , "Y`" ,
77 "O~" , "a('", "a(`", "a(.", "a^'", "a^`", "a^?", "a^.",
78 "e~" , "e." , "e^'", "e^`", "e^?", "e^~", "e^.", "o^'",
79 "o^`", "o^?", "o^~", "O+~", "O+" , "o^.", "o+`", "o+?",
80 "i." , "U+.", "U+'", "U+`", "U+?", "o+" , "o+'", "U+" ,
81 "A`" , "A'" , "A^" , "A~" , "A?" , "A(" , "a(?", "a(~",
82 "E`" , "E'" , "E^" , "E?" , "I`" , "I'" , "I~" , "y`" ,
83 "DD" , "u+'", "O`" , "O'" , "O^" , "a." , "y?" , "u+`",
84 "u+?", "U`" , "U'" , "y~" , "y." , "Y'" , "o+~", "u+" ,
85 "a`" , "a'" , "a^" , "a~" , "a?" , "a(" , "u+~", "a^~",
86 "e`" , "e'" , "e^" , "e?" , "i`" , "i'" , "i~" , "i?" ,
87 "dd" , "u+.", "o`" , "o'" , "o^" , "o~" , "o?" , "o." ,
88 "u." , "u`" , "u'" , "u~" , "u?" , "y'" , "o+.", "U+~",
96 static const mnemonic_def_t mnemonic_ext[] = {
97 /* add extra mnemonic here (should be sorted by wchar_t order). */
99 static const size_t mnemonic_ext_size =
100 sizeof(mnemonic_ext) / sizeof(mnemonic_def_t);
103 mnemonic_ext_find(wchar_t wc, const mnemonic_def_t *head, size_t n)
105 const mnemonic_def_t *mid;
107 for (; n > 0; n >>= 1) {
108 mid = head + (n >> 1);
109 if (mid->value == wc)
111 else if (mid->value < wc) {
120 typedef TAILQ_HEAD(mnemonic_list_t, mnemonic_t) mnemonic_list_t;
121 typedef struct mnemonic_t {
122 TAILQ_ENTRY(mnemonic_t) entry;
123 struct mnemonic_t *parent;
124 mnemonic_list_t child;
130 mnemonic_list_find(mnemonic_list_t *ml, int ch)
134 TAILQ_FOREACH(m, ml, entry) {
143 mnemonic_create(mnemonic_t *parent, int ascii, wchar_t value)
147 m = malloc(sizeof(*m));
152 TAILQ_INIT(&m->child);
159 mnemonic_append_child(mnemonic_t *m, const char *s,
160 wchar_t value, wchar_t invalid)
165 ch = (unsigned char)*s++;
168 m0 = mnemonic_list_find(&m->child, ch);
170 m0 = mnemonic_create(m, ch, (wchar_t)ch);
173 TAILQ_INSERT_TAIL(&m->child, m0, entry);
176 for (m0 = NULL; (ch = (unsigned char)*s) != '\0'; ++s) {
177 m0 = mnemonic_list_find(&m->child, ch);
179 m0 = mnemonic_create(m, ch, invalid);
182 TAILQ_INSERT_TAIL(&m->child, m0, entry);
194 mnemonic_destroy(mnemonic_t *m)
198 TAILQ_FOREACH(m0, &m->child, entry)
199 mnemonic_destroy(m0);
214 #define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
215 #define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.s_##_func_
217 #define _FUNCNAME(m) _citrus_VIQR_##m
218 #define _ENCODING_INFO _VIQREncodingInfo
219 #define _ENCODING_STATE _VIQRState
220 #define _ENCODING_MB_CUR_MAX(_ei_) (_ei_)->mb_cur_max
221 #define _ENCODING_IS_STATE_DEPENDENT 1
222 #define _STATE_NEEDS_EXPLICIT_INIT(_ps_) 0
226 _citrus_VIQR_init_state(_VIQREncodingInfo * __restrict ei __unused,
227 _VIQRState * __restrict psenc)
236 _citrus_VIQR_pack_state(_VIQREncodingInfo * __restrict ei __unused,
237 void *__restrict pspriv, const _VIQRState * __restrict psenc)
240 memcpy(pspriv, (const void *)psenc, sizeof(*psenc));
245 _citrus_VIQR_unpack_state(_VIQREncodingInfo * __restrict ei __unused,
246 _VIQRState * __restrict psenc, const void * __restrict pspriv)
249 memcpy((void *)psenc, pspriv, sizeof(*psenc));
254 _citrus_VIQR_mbrtowc_priv(_VIQREncodingInfo * __restrict ei,
255 wchar_t * __restrict pwc, char ** __restrict s, size_t n,
256 _VIQRState * __restrict psenc, size_t * __restrict nresult)
265 _citrus_VIQR_init_state(ei, psenc);
266 *nresult = (size_t)_ENCODING_IS_STATE_DEPENDENT;
274 if (psenc->chlen == i) {
277 *nresult = (size_t)-2;
280 psenc->ch[psenc->chlen++] = *s0++;
282 ch = (unsigned char)psenc->ch[i++];
291 m0 = mnemonic_list_find(&m->child, ch);
296 while (m != ei->mroot) {
298 if (m->value != ei->invalid)
302 if (ch == ESCAPE && m != ei->mroot)
305 memmove(&psenc->ch[0], &psenc->ch[i], psenc->chlen);
306 wc = (m == ei->mroot) ? (wchar_t)ch : m->value;
309 *nresult = (size_t)(wc == 0 ? 0 : s0 - *s);
316 _citrus_VIQR_wcrtomb_priv(_VIQREncodingInfo * __restrict ei,
317 char * __restrict s, size_t n, wchar_t wc,
318 _VIQRState * __restrict psenc, size_t * __restrict nresult)
324 switch (psenc->chlen) {
331 if ((uint32_t)wc <= 0xFF) {
332 p = mnemonic_rfc1456[wc & 0xFF];
337 ch = (unsigned int)wc;
339 if (psenc->chlen > 0) {
340 m = mnemonic_list_find(&m->child, psenc->ch[0]);
343 psenc->ch[0] = ESCAPE;
345 if (mnemonic_list_find(&m->child, ch) == NULL) {
349 psenc->ch[psenc->chlen++] = ch;
351 p = mnemonic_ext_find(wc, &mnemonic_ext[0], mnemonic_ext_size);
353 *nresult = (size_t)-1;
361 psenc->ch[psenc->chlen++] = *p++;
365 memcpy(s, psenc->ch, psenc->chlen);
366 *nresult = psenc->chlen;
367 if (m == ei->mroot) {
376 *nresult = (size_t)-1;
382 _citrus_VIQR_put_state_reset(_VIQREncodingInfo * __restrict ei __unused,
383 char * __restrict s __unused, size_t n __unused,
384 _VIQRState * __restrict psenc, size_t * __restrict nresult)
387 switch (psenc->chlen) {
401 _citrus_VIQR_stdenc_wctocs(_VIQREncodingInfo * __restrict ei __unused,
402 _csid_t * __restrict csid, _index_t * __restrict idx, wchar_t wc)
413 _citrus_VIQR_stdenc_cstowc(_VIQREncodingInfo * __restrict ei __unused,
414 wchar_t * __restrict pwc, _csid_t csid, _index_t idx)
425 _citrus_VIQR_encoding_module_uninit(_VIQREncodingInfo *ei)
428 mnemonic_destroy(ei->mroot);
433 _citrus_VIQR_encoding_module_init(_VIQREncodingInfo * __restrict ei,
434 const void * __restrict var __unused, size_t lenvar __unused)
441 ei->invalid = (wchar_t)-1;
442 ei->mroot = mnemonic_create(NULL, '\0', ei->invalid);
443 if (ei->mroot == NULL)
445 for (i = 0; i < sizeof(mnemonic_rfc1456) / sizeof(const char *); ++i) {
446 s = mnemonic_rfc1456[i];
450 if (ei->mb_cur_max < n)
452 errnum = mnemonic_append_child(ei->mroot,
453 s, (wchar_t)i, ei->invalid);
455 _citrus_VIQR_encoding_module_uninit(ei);
459 /* a + 1 < b + 1 here to silence gcc warning about unsigned < 0. */
460 for (i = 0; i + 1 < mnemonic_ext_size + 1; ++i) {
461 const mnemonic_def_t *p;
463 p = &mnemonic_ext[i];
465 if (ei->mb_cur_max < n)
467 errnum = mnemonic_append_child(ei->mroot,
468 p->name, p->value, ei->invalid);
470 _citrus_VIQR_encoding_module_uninit(ei);
480 _citrus_VIQR_stdenc_get_state_desc_generic(_VIQREncodingInfo * __restrict ei __unused,
481 _VIQRState * __restrict psenc, int * __restrict rstate)
484 *rstate = (psenc->chlen == 0) ?
485 _STDENC_SDGEN_INITIAL :
486 _STDENC_SDGEN_INCOMPLETE_CHAR;
491 /* ----------------------------------------------------------------------
492 * public interface for stdenc
495 _CITRUS_STDENC_DECLS(VIQR);
496 _CITRUS_STDENC_DEF_OPS(VIQR);
498 #include "citrus_stdenc_template.h"