2 /* $NetBSD: citrus_viqr.c,v 1.5 2011/11/19 18:20:13 tnozaki Exp $ */
5 * SPDX-License-Identifier: BSD-2-Clause
7 * Copyright (c)2006 Citrus Project,
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 #include <sys/cdefs.h>
34 #include <sys/queue.h>
35 #include <sys/types.h>
46 #include "citrus_namespace.h"
47 #include "citrus_types.h"
48 #include "citrus_bcs.h"
49 #include "citrus_module.h"
50 #include "citrus_stdenc.h"
51 #include "citrus_viqr.h"
56 * this table generated from RFC 1456.
58 static const char *mnemonic_rfc1456[0x100] = {
59 NULL , NULL , "A(?", NULL , NULL , "A(~", "A^~", NULL ,
60 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
61 NULL , NULL , NULL , NULL , "Y?" , NULL , NULL , NULL ,
62 NULL , "Y~" , NULL , NULL , NULL , NULL , "Y." , 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 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
74 NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
75 "A." , "A('", "A(`", "A(.", "A^'", "A^`", "A^?", "A^.",
76 "E~" , "E." , "E^'", "E^`", "E^?", "E^~", "E^.", "O^'",
77 "O^`", "O^?", "O^~", "O^.", "O+.", "O+'", "O+`", "O+?",
78 "I." , "O?" , "O." , "I?" , "U?" , "U~" , "U." , "Y`" ,
79 "O~" , "a('", "a(`", "a(.", "a^'", "a^`", "a^?", "a^.",
80 "e~" , "e." , "e^'", "e^`", "e^?", "e^~", "e^.", "o^'",
81 "o^`", "o^?", "o^~", "O+~", "O+" , "o^.", "o+`", "o+?",
82 "i." , "U+.", "U+'", "U+`", "U+?", "o+" , "o+'", "U+" ,
83 "A`" , "A'" , "A^" , "A~" , "A?" , "A(" , "a(?", "a(~",
84 "E`" , "E'" , "E^" , "E?" , "I`" , "I'" , "I~" , "y`" ,
85 "DD" , "u+'", "O`" , "O'" , "O^" , "a." , "y?" , "u+`",
86 "u+?", "U`" , "U'" , "y~" , "y." , "Y'" , "o+~", "u+" ,
87 "a`" , "a'" , "a^" , "a~" , "a?" , "a(" , "u+~", "a^~",
88 "e`" , "e'" , "e^" , "e?" , "i`" , "i'" , "i~" , "i?" ,
89 "dd" , "u+.", "o`" , "o'" , "o^" , "o~" , "o?" , "o." ,
90 "u." , "u`" , "u'" , "u~" , "u?" , "y'" , "o+.", "U+~",
98 static const mnemonic_def_t mnemonic_ext[] = {
99 /* add extra mnemonic here (should be sorted by wchar_t order). */
101 static const size_t mnemonic_ext_size =
102 sizeof(mnemonic_ext) / sizeof(mnemonic_def_t);
105 mnemonic_ext_find(wchar_t wc, const mnemonic_def_t *head, size_t n)
107 const mnemonic_def_t *mid;
109 for (; n > 0; n >>= 1) {
110 mid = head + (n >> 1);
111 if (mid->value == wc)
113 else if (mid->value < wc) {
122 typedef TAILQ_HEAD(mnemonic_list_t, mnemonic_t) mnemonic_list_t;
123 typedef struct mnemonic_t {
124 TAILQ_ENTRY(mnemonic_t) entry;
125 struct mnemonic_t *parent;
126 mnemonic_list_t child;
132 mnemonic_list_find(mnemonic_list_t *ml, int ch)
136 TAILQ_FOREACH(m, ml, entry) {
145 mnemonic_create(mnemonic_t *parent, int ascii, wchar_t value)
149 m = malloc(sizeof(*m));
154 TAILQ_INIT(&m->child);
161 mnemonic_append_child(mnemonic_t *m, const char *s,
162 wchar_t value, wchar_t invalid)
167 ch = (unsigned char)*s++;
170 m0 = mnemonic_list_find(&m->child, ch);
172 m0 = mnemonic_create(m, ch, (wchar_t)ch);
175 TAILQ_INSERT_TAIL(&m->child, m0, entry);
178 for (m0 = NULL; (ch = (unsigned char)*s) != '\0'; ++s) {
179 m0 = mnemonic_list_find(&m->child, ch);
181 m0 = mnemonic_create(m, ch, invalid);
184 TAILQ_INSERT_TAIL(&m->child, m0, entry);
196 mnemonic_destroy(mnemonic_t *m)
200 TAILQ_FOREACH(m0, &m->child, entry)
201 mnemonic_destroy(m0);
216 #define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
217 #define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.s_##_func_
219 #define _FUNCNAME(m) _citrus_VIQR_##m
220 #define _ENCODING_INFO _VIQREncodingInfo
221 #define _ENCODING_STATE _VIQRState
222 #define _ENCODING_MB_CUR_MAX(_ei_) (_ei_)->mb_cur_max
223 #define _ENCODING_IS_STATE_DEPENDENT 1
224 #define _STATE_NEEDS_EXPLICIT_INIT(_ps_) 0
228 _citrus_VIQR_init_state(_VIQREncodingInfo * __restrict ei __unused,
229 _VIQRState * __restrict psenc)
238 _citrus_VIQR_pack_state(_VIQREncodingInfo * __restrict ei __unused,
239 void *__restrict pspriv, const _VIQRState * __restrict psenc)
242 memcpy(pspriv, (const void *)psenc, sizeof(*psenc));
247 _citrus_VIQR_unpack_state(_VIQREncodingInfo * __restrict ei __unused,
248 _VIQRState * __restrict psenc, const void * __restrict pspriv)
251 memcpy((void *)psenc, pspriv, sizeof(*psenc));
256 _citrus_VIQR_mbrtowc_priv(_VIQREncodingInfo * __restrict ei,
257 wchar_t * __restrict pwc, char ** __restrict s, size_t n,
258 _VIQRState * __restrict psenc, size_t * __restrict nresult)
267 _citrus_VIQR_init_state(ei, psenc);
268 *nresult = (size_t)_ENCODING_IS_STATE_DEPENDENT;
276 if (psenc->chlen == i) {
279 *nresult = (size_t)-2;
282 psenc->ch[psenc->chlen++] = *s0++;
284 ch = (unsigned char)psenc->ch[i++];
293 m0 = mnemonic_list_find(&m->child, ch);
298 while (m != ei->mroot) {
300 if (m->value != ei->invalid)
304 if (ch == ESCAPE && m != ei->mroot)
307 memmove(&psenc->ch[0], &psenc->ch[i], psenc->chlen);
308 wc = (m == ei->mroot) ? (wchar_t)ch : m->value;
311 *nresult = (size_t)(wc == 0 ? 0 : s0 - *s);
318 _citrus_VIQR_wcrtomb_priv(_VIQREncodingInfo * __restrict ei,
319 char * __restrict s, size_t n, wchar_t wc,
320 _VIQRState * __restrict psenc, size_t * __restrict nresult)
326 switch (psenc->chlen) {
333 if ((uint32_t)wc <= 0xFF) {
334 p = mnemonic_rfc1456[wc & 0xFF];
339 ch = (unsigned int)wc;
341 if (psenc->chlen > 0) {
342 m = mnemonic_list_find(&m->child, psenc->ch[0]);
345 psenc->ch[0] = ESCAPE;
347 if (mnemonic_list_find(&m->child, ch) == NULL) {
351 psenc->ch[psenc->chlen++] = ch;
353 p = mnemonic_ext_find(wc, &mnemonic_ext[0], mnemonic_ext_size);
355 *nresult = (size_t)-1;
363 psenc->ch[psenc->chlen++] = *p++;
367 memcpy(s, psenc->ch, psenc->chlen);
368 *nresult = psenc->chlen;
369 if (m == ei->mroot) {
378 *nresult = (size_t)-1;
384 _citrus_VIQR_put_state_reset(_VIQREncodingInfo * __restrict ei __unused,
385 char * __restrict s __unused, size_t n __unused,
386 _VIQRState * __restrict psenc, size_t * __restrict nresult)
389 switch (psenc->chlen) {
403 _citrus_VIQR_stdenc_wctocs(_VIQREncodingInfo * __restrict ei __unused,
404 _csid_t * __restrict csid, _index_t * __restrict idx, wchar_t wc)
415 _citrus_VIQR_stdenc_cstowc(_VIQREncodingInfo * __restrict ei __unused,
416 wchar_t * __restrict pwc, _csid_t csid, _index_t idx)
427 _citrus_VIQR_encoding_module_uninit(_VIQREncodingInfo *ei)
430 mnemonic_destroy(ei->mroot);
435 _citrus_VIQR_encoding_module_init(_VIQREncodingInfo * __restrict ei,
436 const void * __restrict var __unused, size_t lenvar __unused)
443 ei->invalid = (wchar_t)-1;
444 ei->mroot = mnemonic_create(NULL, '\0', ei->invalid);
445 if (ei->mroot == NULL)
447 for (i = 0; i < sizeof(mnemonic_rfc1456) / sizeof(const char *); ++i) {
448 s = mnemonic_rfc1456[i];
452 if (ei->mb_cur_max < n)
454 errnum = mnemonic_append_child(ei->mroot,
455 s, (wchar_t)i, ei->invalid);
457 _citrus_VIQR_encoding_module_uninit(ei);
461 /* a + 1 < b + 1 here to silence gcc warning about unsigned < 0. */
462 for (i = 0; i + 1 < mnemonic_ext_size + 1; ++i) {
463 const mnemonic_def_t *p;
465 p = &mnemonic_ext[i];
467 if (ei->mb_cur_max < n)
469 errnum = mnemonic_append_child(ei->mroot,
470 p->name, p->value, ei->invalid);
472 _citrus_VIQR_encoding_module_uninit(ei);
482 _citrus_VIQR_stdenc_get_state_desc_generic(_VIQREncodingInfo * __restrict ei __unused,
483 _VIQRState * __restrict psenc, int * __restrict rstate)
486 *rstate = (psenc->chlen == 0) ?
487 _STDENC_SDGEN_INITIAL :
488 _STDENC_SDGEN_INCOMPLETE_CHAR;
493 /* ----------------------------------------------------------------------
494 * public interface for stdenc
497 _CITRUS_STDENC_DECLS(VIQR);
498 _CITRUS_STDENC_DEF_OPS(VIQR);
500 #include "citrus_stdenc_template.h"