#include <stdio.h>
#include <errno.h>
#include <stdlib.h>
#include <sys/types.h>
#define __NEED_TCVN_2_UNI__
#include <unicode_tcvn.h>
#include <vi_combine.h>
#include "common_defs.h"
typedef struct _icv_state {
int _errno;
unsigned long last;
} _iconv_st;
#if defined(UCS_2LE)
#define SET_UCS(UNI) *(*outbuf)++ = (unsigned char)((UNI)&0xff); \
*(*outbuf)++ = (unsigned char)(((UNI)>>8)&0xff);
#else
#define SET_UCS(UNI) *(*outbuf)++ = (unsigned char)(((UNI)>>8)&0xff); \
*(*outbuf)++ = (unsigned char)((UNI)&0xff);
#endif
static int binsearch(unsigned long x, Combine_map v[], int n);
void *
_icv_open()
{
_iconv_st *st;
if ((st = (_iconv_st *)malloc(sizeof(_iconv_st))) == NULL) {
errno = ENOMEM;
return ((void *) -1);
}
st->_errno = 0;
st->last = 0;
return ((void *) st);
}
void
_icv_close(_iconv_st *st)
{
if (!st)
errno = EBADF;
else
free(st);
}
size_t
_icv_iconv(_iconv_st *st, char **inbuf, size_t *inbytesleft,
char **outbuf, size_t *outbytesleft)
{
int unidx = -1;
#ifdef DEBUG
fprintf(stderr, "========== iconv(): TCVN5712 -->UCS-2 ==========\n");
#endif
if (st == NULL) {
errno = EBADF;
return ((size_t) -1);
}
if (inbuf == NULL || *inbuf == NULL) {
st->_errno = 0;
return ((size_t) 0);
}
st->_errno = 0;
errno = 0;
while (*inbytesleft > 0 && *outbytesleft > 1) {
unsigned long uni = 0;
tcvn_2_uni((unsigned char*)*inbuf, &uni);
if (st->last != 0) {
if (ISCOMB_UNI(uni)) {
unsigned int k = 0;
switch (uni) {
case 0x0300: k = 0; break;
case 0x0301: k = 1; break;
case 0x0303: k = 2; break;
case 0x0309: k = 3; break;
case 0x0323: k = 4; break;
default:
break;
}
unidx = binsearch(st->last, vi_comb_data, VOWEL_NUM);
if (unidx >= 0) {
uni = vi_comb_data[unidx].composed[k];
} else {
errno = EBADF;
return ((size_t)-1);
}
st->last = 0;
} else {
SET_UCS(st->last);
(*outbytesleft) -= 2;
}
st->last = 0;
} else {
if (uni >= 0x0041 && uni <= 0x01b0
&& ((tcvn_comp_bases_mask[(uni-0x0040) >> 5] >> (uni & 0x1f)) & 1)) {
st->last = uni;
(*inbuf)++;
(*inbytesleft)--;
continue;
}
}
SET_UCS(uni);
(*outbytesleft) -= 2;
(*inbuf)++;
(*inbytesleft)--;
}
if ( *inbytesleft > 0 && *outbytesleft <= 1 ) {
errno = E2BIG;
st->last = 0;
return ((size_t)-1);
}
if (st->last!=0 ) {
SET_UCS(st->last);
st->last = 0;
(*outbytesleft) -= 2;
}
return ((size_t)(*inbytesleft));
}
static int binsearch(unsigned long x, Combine_map v[], int n)
{
int low = 0;
int mid = 0;
int high = n - 1;
low = 0;
while (low <= high) {
mid = ((high - low)>>1) + low;
if (x < v[mid].base)
high = mid - 1;
else if (x > v[mid].base)
low = mid + 1;
else
return mid;
}
return (-1);
}