928 lines
		
	
	
		
			20 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			928 lines
		
	
	
		
			20 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| /*
 | |
|  * $Id$
 | |
|  *
 | |
|     Copyright (c) 2016-2018 Chung, Hyung-Hwan. All rights reserved.
 | |
| 
 | |
|     Redistribution and use in source and binary forms, with or without
 | |
|     modification, are permitted provided that the following conditions
 | |
|     are met:
 | |
|     1. Redistributions of source code must retain the above copyright
 | |
|        notice, this list of conditions and the following disclaimer.
 | |
|     2. Redistributions in binary form must reproduce the above copyright
 | |
|        notice, this list of conditions and the following disclaimer in the
 | |
|        documentation and/or other materials provided with the distribution.
 | |
| 
 | |
|     THIS SOFTWARE IS PROVIDED BY THE AUTHOR "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 THE AUTHOR 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 DAMAGE.
 | |
|  */
 | |
| 
 | |
| #include "hcl-prv.h"
 | |
| 
 | |
| /* some naming conventions
 | |
|  *  bchars, uchars -> pointer and length
 | |
|  *  bcstr, ucstr -> null-terminated string pointer
 | |
|  *  btouchars -> bchars to uchars
 | |
|  *  utobchars -> uchars to bchars
 | |
|  *  btoucstr -> bcstr to ucstr
 | |
|  *  utobcstr -> ucstr to bcstr
 | |
|  */
 | |
| 
 | |
| hcl_oow_t hcl_hash_bytes_ (const hcl_oob_t* ptr, hcl_oow_t len)
 | |
| {
 | |
| 	hcl_oow_t hv;
 | |
| 	HCL_HASH_BYTES (hv, ptr, len);
 | |
| 	/* constrain the hash value to be representable in a small integer
 | |
| 	 * for convenience sake */
 | |
| 	return hv % ((hcl_oow_t)HCL_SMOOI_MAX + 1);
 | |
| }
 | |
| 
 | |
| int hcl_equal_uchars (const hcl_uch_t* str1, const hcl_uch_t* str2, hcl_oow_t len)
 | |
| {
 | |
| 	hcl_oow_t i;
 | |
| 
 | |
| 	/* NOTE: you should call this function after having ensured that
 | |
| 	 *       str1 and str2 are in the same length */
 | |
| 
 | |
| 	for (i = 0; i < len; i++)
 | |
| 	{
 | |
| 		if (str1[i] != str2[i]) return 0;
 | |
| 	}
 | |
| 
 | |
| 	return 1;
 | |
| }
 | |
| 
 | |
| int hcl_equal_bchars (const hcl_bch_t* str1, const hcl_bch_t* str2, hcl_oow_t len)
 | |
| {
 | |
| 	hcl_oow_t i;
 | |
| 
 | |
| 	/* NOTE: you should call this function after having ensured that
 | |
| 	 *       str1 and str2 are in the same length */
 | |
| 
 | |
| 	for (i = 0; i < len; i++)
 | |
| 	{
 | |
| 		if (str1[i] != str2[i]) return 0;
 | |
| 	}
 | |
| 
 | |
| 	return 1;
 | |
| }
 | |
| 
 | |
| int hcl_comp_uchars (const hcl_uch_t* str1, hcl_oow_t len1, const hcl_uch_t* str2, hcl_oow_t len2)
 | |
| {
 | |
| 	hcl_uchu_t c1, c2;
 | |
| 	const hcl_uch_t* end1 = str1 + len1;
 | |
| 	const hcl_uch_t* end2 = str2 + len2;
 | |
| 
 | |
| 	while (str1 < end1)
 | |
| 	{
 | |
| 		c1 = *str1;
 | |
| 		if (str2 < end2) 
 | |
| 		{
 | |
| 			c2 = *str2;
 | |
| 			if (c1 > c2) return 1;
 | |
| 			if (c1 < c2) return -1;
 | |
| 		}
 | |
| 		else return 1;
 | |
| 		str1++; str2++;
 | |
| 	}
 | |
| 
 | |
| 	return (str2 < end2)? -1: 0;
 | |
| }
 | |
| 
 | |
| int hcl_comp_bchars (const hcl_bch_t* str1, hcl_oow_t len1, const hcl_bch_t* str2, hcl_oow_t len2)
 | |
| {
 | |
| 	hcl_bchu_t c1, c2;
 | |
| 	const hcl_bch_t* end1 = str1 + len1;
 | |
| 	const hcl_bch_t* end2 = str2 + len2;
 | |
| 
 | |
| 	while (str1 < end1)
 | |
| 	{
 | |
| 		c1 = *str1;
 | |
| 		if (str2 < end2) 
 | |
| 		{
 | |
| 			c2 = *str2;
 | |
| 			if (c1 > c2) return 1;
 | |
| 			if (c1 < c2) return -1;
 | |
| 		}
 | |
| 		else return 1;
 | |
| 		str1++; str2++;
 | |
| 	}
 | |
| 
 | |
| 	return (str2 < end2)? -1: 0;
 | |
| }
 | |
| 
 | |
| int hcl_comp_ucstr (const hcl_uch_t* str1, const hcl_uch_t* str2)
 | |
| {
 | |
| 	while (*str1 == *str2)
 | |
| 	{
 | |
| 		if (*str1 == '\0') return 0;
 | |
| 		str1++; str2++;
 | |
| 	}
 | |
| 
 | |
| 	return ((hcl_uchu_t)*str1 > (hcl_uchu_t)*str2)? 1: -1;
 | |
| }
 | |
| 
 | |
| int hcl_comp_bcstr (const hcl_bch_t* str1, const hcl_bch_t* str2)
 | |
| {
 | |
| 	while (*str1 == *str2)
 | |
| 	{
 | |
| 		if (*str1 == '\0') return 0;
 | |
| 		str1++; str2++;
 | |
| 	}
 | |
| 
 | |
| 	return ((hcl_bchu_t)*str1 > (hcl_bchu_t)*str2)? 1: -1;
 | |
| }
 | |
| 
 | |
| int hcl_comp_ucstr_bcstr (const hcl_uch_t* str1, const hcl_bch_t* str2)
 | |
| {
 | |
| 	while (*str1 == *str2)
 | |
| 	{
 | |
| 		if (*str1 == '\0') return 0;
 | |
| 		str1++; str2++;
 | |
| 	}
 | |
| 
 | |
| 	return ((hcl_uchu_t)*str1 > (hcl_bchu_t)*str2)? 1: -1;
 | |
| }
 | |
| 
 | |
| int hcl_comp_uchars_ucstr (const hcl_uch_t* str1, hcl_oow_t len, const hcl_uch_t* str2)
 | |
| {
 | |
| 	/* for "abc\0" of length 4 vs "abc", the fourth character
 | |
| 	 * of the first string is equal to the terminating null of
 | |
| 	 * the second string. the first string is still considered 
 | |
| 	 * bigger */
 | |
| 	const hcl_uch_t* end = str1 + len;
 | |
| 	while (str1 < end && *str2 != '\0') 
 | |
| 	{
 | |
| 		if (*str1 != *str2) return ((hcl_uchu_t)*str1 > (hcl_uchu_t)*str2)? 1: -1;
 | |
| 		str1++; str2++;
 | |
| 	}
 | |
| 	return (str1 < end)? 1: (*str2 == '\0'? 0: -1);
 | |
| }
 | |
| 
 | |
| int hcl_comp_uchars_bcstr (const hcl_uch_t* str1, hcl_oow_t len, const hcl_bch_t* str2)
 | |
| {
 | |
| 	const hcl_uch_t* end = str1 + len;
 | |
| 	while (str1 < end && *str2 != '\0') 
 | |
| 	{
 | |
| 		if (*str1 != *str2) return ((hcl_uchu_t)*str1 > (hcl_bchu_t)*str2)? 1: -1;
 | |
| 		str1++; str2++;
 | |
| 	}
 | |
| 	return (str1 < end)? 1: (*str2 == '\0'? 0: -1);
 | |
| }
 | |
| 
 | |
| int hcl_comp_bchars_bcstr (const hcl_bch_t* str1, hcl_oow_t len, const hcl_bch_t* str2)
 | |
| {
 | |
| 	const hcl_bch_t* end = str1 + len;
 | |
| 	while (str1 < end && *str2 != '\0') 
 | |
| 	{
 | |
| 		if (*str1 != *str2) return ((hcl_bchu_t)*str1 > (hcl_bchu_t)*str2)? 1: -1;
 | |
| 		str1++; str2++;
 | |
| 	}
 | |
| 	return (str1 < end)? 1: (*str2 == '\0'? 0: -1);
 | |
| }
 | |
| 
 | |
| int hcl_comp_bchars_ucstr (const hcl_bch_t* str1, hcl_oow_t len, const hcl_uch_t* str2)
 | |
| {
 | |
| 	const hcl_bch_t* end = str1 + len;
 | |
| 	while (str1 < end && *str2 != '\0') 
 | |
| 	{
 | |
| 		if (*str1 != *str2) return ((hcl_bchu_t)*str1 > (hcl_uchu_t)*str2)? 1: -1;
 | |
| 		str1++; str2++;
 | |
| 	}
 | |
| 	return (str1 < end)? 1: (*str2 == '\0'? 0: -1);
 | |
| }
 | |
| 
 | |
| void hcl_copy_uchars (hcl_uch_t* dst, const hcl_uch_t* src, hcl_oow_t len)
 | |
| {
 | |
| 	/* take note of no forced null termination */
 | |
| 	hcl_oow_t i;
 | |
| 	for (i = 0; i < len; i++) dst[i] = src[i];
 | |
| }
 | |
| 
 | |
| void hcl_copy_bchars (hcl_bch_t* dst, const hcl_bch_t* src, hcl_oow_t len)
 | |
| {
 | |
| 	/* take note of no forced null termination */
 | |
| 	hcl_oow_t i;
 | |
| 	for (i = 0; i < len; i++) dst[i] = src[i];
 | |
| }
 | |
| 
 | |
| void hcl_copy_bchars_to_uchars (hcl_uch_t* dst, const hcl_bch_t* src, hcl_oow_t len)
 | |
| {
 | |
| 	/* copy without conversions.
 | |
| 	 * use hcl_bctouchars() for conversion encoding */
 | |
| 	hcl_oow_t i;
 | |
| 	for (i = 0; i < len; i++) dst[i] = src[i];
 | |
| }
 | |
| 
 | |
| hcl_oow_t hcl_copy_ucstr (hcl_uch_t* dst, hcl_oow_t len, const hcl_uch_t* src)
 | |
| {
 | |
| 	hcl_uch_t* p, * p2;
 | |
| 
 | |
| 	p = dst; p2 = dst + len - 1;
 | |
| 
 | |
| 	while (p < p2)
 | |
| 	{
 | |
| 		 if (*src == '\0') break;
 | |
| 		 *p++ = *src++;
 | |
| 	}
 | |
| 
 | |
| 	if (len > 0) *p = '\0';
 | |
| 	return p - dst;
 | |
| }
 | |
| 
 | |
| hcl_oow_t hcl_copy_bcstr (hcl_bch_t* dst, hcl_oow_t len, const hcl_bch_t* src)
 | |
| {
 | |
| 	hcl_bch_t* p, * p2;
 | |
| 
 | |
| 	p = dst; p2 = dst + len - 1;
 | |
| 
 | |
| 	while (p < p2)
 | |
| 	{
 | |
| 		 if (*src == '\0') break;
 | |
| 		 *p++ = *src++;
 | |
| 	}
 | |
| 
 | |
| 	if (len > 0) *p = '\0';
 | |
| 	return p - dst;
 | |
| }
 | |
| 
 | |
| void hcl_fill_uchars (hcl_uch_t* dst, hcl_uch_t ch, hcl_oow_t len)
 | |
| {
 | |
| 	hcl_oow_t i;
 | |
| 	for (i = 0; i < len; i++) dst[i] = ch;
 | |
| }
 | |
| 
 | |
| void hcl_fill_bchars (hcl_bch_t* dst, hcl_bch_t ch, hcl_oow_t len)
 | |
| {
 | |
| 	hcl_oow_t i;
 | |
| 	for (i = 0; i < len; i++) dst[i] = ch;
 | |
| }
 | |
| 
 | |
| hcl_oow_t hcl_count_ucstr (const hcl_uch_t* str)
 | |
| {
 | |
| 	const hcl_uch_t* ptr = str;
 | |
| 	while (*ptr != '\0') ptr++;
 | |
| 	return ptr - str;
 | |
| }
 | |
| 
 | |
| hcl_oow_t hcl_count_bcstr (const hcl_bch_t* str)
 | |
| {
 | |
| 	const hcl_bch_t* ptr = str;
 | |
| 	while (*ptr != '\0') ptr++;
 | |
| 	return ptr - str;
 | |
| }
 | |
| 
 | |
| hcl_uch_t* hcl_find_uchar (const hcl_uch_t* ptr, hcl_oow_t len, hcl_uch_t c)
 | |
| {
 | |
| 	const hcl_uch_t* end;
 | |
| 
 | |
| 	end = ptr + len;
 | |
| 	while (ptr < end)
 | |
| 	{
 | |
| 		if (*ptr == c) return (hcl_uch_t*)ptr;
 | |
| 		ptr++;
 | |
| 	}
 | |
| 
 | |
| 	return HCL_NULL;
 | |
| }
 | |
| 
 | |
| hcl_bch_t* hcl_find_bchar (const hcl_bch_t* ptr, hcl_oow_t len, hcl_bch_t c)
 | |
| {
 | |
| 	const hcl_bch_t* end;
 | |
| 
 | |
| 	end = ptr + len;
 | |
| 	while (ptr < end)
 | |
| 	{
 | |
| 		if (*ptr == c) return (hcl_bch_t*)ptr;
 | |
| 		ptr++;
 | |
| 	}
 | |
| 
 | |
| 	return HCL_NULL;
 | |
| }
 | |
| 
 | |
| hcl_uch_t* hcl_rfind_uchar (const hcl_uch_t* ptr, hcl_oow_t len, hcl_uch_t c)
 | |
| {
 | |
| 	const hcl_uch_t* cur;
 | |
| 
 | |
| 	cur = ptr + len;
 | |
| 	while (cur > ptr)
 | |
| 	{
 | |
| 		--cur;
 | |
| 		if (*cur == c) return (hcl_uch_t*)cur;
 | |
| 	}
 | |
| 
 | |
| 	return HCL_NULL;
 | |
| }
 | |
| 
 | |
| hcl_bch_t* hcl_rfind_bchar (const hcl_bch_t* ptr, hcl_oow_t len, hcl_bch_t c)
 | |
| {
 | |
| 	const hcl_bch_t* cur;
 | |
| 
 | |
| 	cur = ptr + len;
 | |
| 	while (cur > ptr)
 | |
| 	{
 | |
| 		--cur;
 | |
| 		if (*cur == c) return (hcl_bch_t*)cur;
 | |
| 	}
 | |
| 
 | |
| 	return HCL_NULL;
 | |
| }
 | |
| 
 | |
| hcl_uch_t* hcl_find_uchar_in_ucstr (const hcl_uch_t* ptr, hcl_uch_t c)
 | |
| {
 | |
| 	while (*ptr != '\0')
 | |
| 	{
 | |
| 		if (*ptr == c) return (hcl_uch_t*)ptr;
 | |
| 		ptr++;
 | |
| 	}
 | |
| 
 | |
| 	return HCL_NULL;
 | |
| }
 | |
| 
 | |
| hcl_bch_t* hcl_find_bchar_in_bcstr (const hcl_bch_t* ptr, hcl_bch_t c)
 | |
| {
 | |
| 	while (*ptr != '\0')
 | |
| 	{
 | |
| 		if (*ptr == c) return (hcl_bch_t*)ptr;
 | |
| 		ptr++;
 | |
| 	}
 | |
| 
 | |
| 	return HCL_NULL;
 | |
| }
 | |
| 
 | |
| /* ----------------------------------------------------------------------- */
 | |
| 
 | |
| hcl_oow_t hcl_byte_to_bcstr (hcl_uint8_t byte, hcl_bch_t* buf, hcl_oow_t size, int flagged_radix, hcl_bch_t fill)
 | |
| {
 | |
| 	hcl_bch_t tmp[(HCL_SIZEOF(hcl_uint8_t) * HCL_BITS_PER_BYTE)];
 | |
| 	hcl_bch_t* p = tmp, * bp = buf, * be = buf + size - 1;
 | |
| 	int radix;
 | |
| 	hcl_bch_t radix_char;
 | |
| 
 | |
| 	radix = (flagged_radix & HCL_BYTE_TO_BCSTR_RADIXMASK);
 | |
| 	radix_char = (flagged_radix & HCL_BYTE_TO_BCSTR_LOWERCASE)? 'a': 'A';
 | |
| 	if (radix < 2 || radix > 36 || size <= 0) return 0;
 | |
| 
 | |
| 	do 
 | |
| 	{
 | |
| 		hcl_uint8_t digit = byte % radix;	
 | |
| 		if (digit < 10) *p++ = digit + '0';
 | |
| 		else *p++ = digit + radix_char - 10;
 | |
| 		byte /= radix;
 | |
| 	}
 | |
| 	while (byte > 0);
 | |
| 
 | |
| 	if (fill != '\0') 
 | |
| 	{
 | |
| 		while (size - 1 > p - tmp) 
 | |
| 		{
 | |
| 			*bp++ = fill;
 | |
| 			size--;
 | |
| 		}
 | |
| 	}
 | |
| 
 | |
| 	while (p > tmp && bp < be) *bp++ = *--p;
 | |
| 	*bp = '\0';
 | |
| 	return bp - buf;
 | |
| }
 | |
| 
 | |
| /* ----------------------------------------------------------------------- */
 | |
| 
 | |
| HCL_INLINE int hcl_conv_bchars_to_uchars_with_cmgr (const hcl_bch_t* bcs, hcl_oow_t* bcslen, hcl_uch_t* ucs, hcl_oow_t* ucslen, hcl_cmgr_t* cmgr, int all)
 | |
| {
 | |
| 	const hcl_bch_t* p;
 | |
| 	int ret = 0;
 | |
| 	hcl_oow_t mlen;
 | |
| 
 | |
| 	if (ucs)
 | |
| 	{
 | |
| 		/* destination buffer is specified. 
 | |
| 		 * copy the conversion result to the buffer */
 | |
| 
 | |
| 		hcl_uch_t* q, * qend;
 | |
| 
 | |
| 		p = bcs;
 | |
| 		q = ucs;
 | |
| 		qend = ucs + *ucslen;
 | |
| 		mlen = *bcslen;
 | |
| 
 | |
| 		while (mlen > 0)
 | |
| 		{
 | |
| 			hcl_oow_t n;
 | |
| 
 | |
| 			if (q >= qend)
 | |
| 			{
 | |
| 				/* buffer too small */
 | |
| 				ret = -2;
 | |
| 				break;
 | |
| 			}
 | |
| 
 | |
| 			n = cmgr->bctouc (p, mlen, q);
 | |
| 			if (n == 0)
 | |
| 			{
 | |
| 				/* invalid sequence */
 | |
| 				if (all)
 | |
| 				{
 | |
| 					n = 1;
 | |
| 					*q = '?';
 | |
| 				}
 | |
| 				else
 | |
| 				{
 | |
| 					ret = -1;
 | |
| 					break;
 | |
| 				}
 | |
| 			}
 | |
| 			if (n > mlen)
 | |
| 			{
 | |
| 				/* incomplete sequence */
 | |
| 				if (all)
 | |
| 				{
 | |
| 					n = 1;
 | |
| 					*q = '?';
 | |
| 				}
 | |
| 				else
 | |
| 				{
 | |
| 					ret = -3;
 | |
| 					break;
 | |
| 				}
 | |
| 			}
 | |
| 
 | |
| 			q++;
 | |
| 			p += n;
 | |
| 			mlen -= n;
 | |
| 		}
 | |
| 
 | |
| 		*ucslen = q - ucs;
 | |
| 		*bcslen = p - bcs;
 | |
| 	}
 | |
| 	else
 | |
| 	{
 | |
| 		/* no destination buffer is specified. perform conversion
 | |
| 		 * but don't copy the result. the caller can call this function
 | |
| 		 * without a buffer to find the required buffer size, allocate
 | |
| 		 * a buffer with the size and call this function again with 
 | |
| 		 * the buffer. */
 | |
| 
 | |
| 		hcl_uch_t w;
 | |
| 		hcl_oow_t wlen = 0;
 | |
| 
 | |
| 		p = bcs;
 | |
| 		mlen = *bcslen;
 | |
| 
 | |
| 		while (mlen > 0)
 | |
| 		{
 | |
| 			hcl_oow_t n;
 | |
| 
 | |
| 			n = cmgr->bctouc (p, mlen, &w);
 | |
| 			if (n == 0)
 | |
| 			{
 | |
| 				/* invalid sequence */
 | |
| 				if (all) n = 1;
 | |
| 				else
 | |
| 				{
 | |
| 					ret = -1;
 | |
| 					break;
 | |
| 				}
 | |
| 			}
 | |
| 			if (n > mlen)
 | |
| 			{
 | |
| 				/* incomplete sequence */
 | |
| 				if (all) n = 1;
 | |
| 				else
 | |
| 				{
 | |
| 					ret = -3;
 | |
| 					break;
 | |
| 				}
 | |
| 			}
 | |
| 
 | |
| 			p += n;
 | |
| 			mlen -= n;
 | |
| 			wlen += 1;
 | |
| 		}
 | |
| 
 | |
| 		*ucslen = wlen;
 | |
| 		*bcslen = p - bcs;
 | |
| 	}
 | |
| 
 | |
| 	return ret;
 | |
| }
 | |
| 
 | |
| HCL_INLINE int hcl_conv_bcstr_to_ucstr_with_cmgr (const hcl_bch_t* bcs, hcl_oow_t* bcslen, hcl_uch_t* ucs, hcl_oow_t* ucslen, hcl_cmgr_t* cmgr, int all)
 | |
| {
 | |
| 	const hcl_bch_t* bp;
 | |
| 	hcl_oow_t mlen, wlen;
 | |
| 	int n;
 | |
| 
 | |
| 	for (bp = bcs; *bp != '\0'; bp++) /* nothing */ ;
 | |
| 
 | |
| 	mlen = bp - bcs; wlen = *ucslen;
 | |
| 	n = hcl_conv_bchars_to_uchars_with_cmgr (bcs, &mlen, ucs, &wlen, cmgr, all);
 | |
| 	if (ucs)
 | |
| 	{
 | |
| 		/* null-terminate the target buffer if it has room for it. */
 | |
| 		if (wlen < *ucslen) ucs[wlen] = '\0';
 | |
| 		else n = -2; /* buffer too small */
 | |
| 	}
 | |
| 	*bcslen = mlen; *ucslen = wlen;
 | |
| 
 | |
| 	return n;
 | |
| }
 | |
| 
 | |
| HCL_INLINE int hcl_conv_uchars_to_bchars_with_cmgr (const hcl_uch_t* ucs, hcl_oow_t* ucslen, hcl_bch_t* bcs, hcl_oow_t* bcslen, hcl_cmgr_t* cmgr)
 | |
| {
 | |
| 	const hcl_uch_t* p = ucs;
 | |
| 	const hcl_uch_t* end = ucs + *ucslen;
 | |
| 	int ret = 0; 
 | |
| 
 | |
| 	if (bcs)
 | |
| 	{
 | |
| 		hcl_oow_t rem = *bcslen;
 | |
| 
 | |
| 		while (p < end) 
 | |
| 		{
 | |
| 			hcl_oow_t n;
 | |
| 
 | |
| 			if (rem <= 0)
 | |
| 			{
 | |
| 				ret = -2; /* buffer too small */
 | |
| 				break;
 | |
| 			}
 | |
| 
 | |
| 			n = cmgr->uctobc (*p, bcs, rem);
 | |
| 			if (n == 0) 
 | |
| 			{
 | |
| 				ret = -1;
 | |
| 				break; /* illegal character */
 | |
| 			}
 | |
| 			if (n > rem) 
 | |
| 			{
 | |
| 				ret = -2; /* buffer too small */
 | |
| 				break;
 | |
| 			}
 | |
| 			bcs += n; rem -= n; p++;
 | |
| 		}
 | |
| 
 | |
| 		*bcslen -= rem; 
 | |
| 	}
 | |
| 	else
 | |
| 	{
 | |
| 		hcl_bch_t bcsbuf[HCL_BCSIZE_MAX];
 | |
| 		hcl_oow_t mlen = 0;
 | |
| 
 | |
| 		while (p < end)
 | |
| 		{
 | |
| 			hcl_oow_t n;
 | |
| 
 | |
| 			n = cmgr->uctobc (*p, bcsbuf, HCL_COUNTOF(bcsbuf));
 | |
| 			if (n == 0) 
 | |
| 			{
 | |
| 				ret = -1;
 | |
| 				break; /* illegal character */
 | |
| 			}
 | |
| 
 | |
| 			/* it assumes that bcsbuf is large enough to hold a character */
 | |
| 			/*HCL_ASSERT (hcl, n <= HCL_COUNTOF(bcsbuf));*/
 | |
| 
 | |
| 			p++; mlen += n;
 | |
| 		}
 | |
| 
 | |
| 		/* this length excludes the terminating null character. 
 | |
| 		 * this function doesn't even null-terminate the result. */
 | |
| 		*bcslen = mlen;
 | |
| 	}
 | |
| 
 | |
| 	*ucslen = p - ucs;
 | |
| 	return ret;
 | |
| }
 | |
| 
 | |
| HCL_INLINE int hcl_conv_ucstr_to_bcstr_with_cmgr (const hcl_uch_t* ucs, hcl_oow_t* ucslen, hcl_bch_t* bcs, hcl_oow_t* bcslen, hcl_cmgr_t* cmgr)
 | |
| {
 | |
| 	const hcl_uch_t* p = ucs;
 | |
| 	int ret = 0;
 | |
| 
 | |
| 	if (bcs)
 | |
| 	{
 | |
| 		hcl_oow_t rem = *bcslen;
 | |
| 
 | |
| 		while (*p != '\0')
 | |
| 		{
 | |
| 			hcl_oow_t n;
 | |
| 
 | |
| 			if (rem <= 0)
 | |
| 			{
 | |
| 				ret = -2;
 | |
| 				break;
 | |
| 			}
 | |
| 			
 | |
| 			n = cmgr->uctobc (*p, bcs, rem);
 | |
| 			if (n == 0) 
 | |
| 			{
 | |
| 				ret = -1;
 | |
| 				break; /* illegal character */
 | |
| 			}
 | |
| 			if (n > rem) 
 | |
| 			{
 | |
| 				ret = -2;
 | |
| 				break; /* buffer too small */
 | |
| 			}
 | |
| 
 | |
| 			bcs += n; rem -= n; p++;
 | |
| 		}
 | |
| 
 | |
| 		/* update bcslen to the length of the bcs string converted excluding
 | |
| 		 * terminating null */
 | |
| 		*bcslen -= rem; 
 | |
| 
 | |
| 		/* null-terminate the multibyte sequence if it has sufficient space */
 | |
| 		if (rem > 0) *bcs = '\0';
 | |
| 		else 
 | |
| 		{
 | |
| 			/* if ret is -2 and cs[cslen] == '\0', 
 | |
| 			 * this means that the bcs buffer was lacking one
 | |
| 			 * slot for the terminating null */
 | |
| 			ret = -2; /* buffer too small */
 | |
| 		}
 | |
| 	}
 | |
| 	else
 | |
| 	{
 | |
| 		hcl_bch_t bcsbuf[HCL_BCSIZE_MAX];
 | |
| 		hcl_oow_t mlen = 0;
 | |
| 
 | |
| 		while (*p != '\0')
 | |
| 		{
 | |
| 			hcl_oow_t n;
 | |
| 
 | |
| 			n = cmgr->uctobc (*p, bcsbuf, HCL_COUNTOF(bcsbuf));
 | |
| 			if (n == 0) 
 | |
| 			{
 | |
| 				ret = -1;
 | |
| 				break; /* illegal character */
 | |
| 			}
 | |
| 
 | |
| 			/* it assumes that bcs is large enough to hold a character */
 | |
| 			/*HCL_ASSERT (hcl, n <= HCL_COUNTOF(bcs));*/
 | |
| 
 | |
| 			p++; mlen += n;
 | |
| 		}
 | |
| 
 | |
| 		/* this length holds the number of resulting multi-byte characters 
 | |
| 		 * excluding the terminating null character */
 | |
| 		*bcslen = mlen;
 | |
| 	}
 | |
| 
 | |
| 	*ucslen = p - ucs;  /* the number of wide characters handled. */
 | |
| 	return ret;
 | |
| }
 | |
| 
 | |
| /* ----------------------------------------------------------------------- */
 | |
| 
 | |
| static hcl_cmgr_t utf8_cmgr =
 | |
| {
 | |
| 	hcl_utf8_to_uc,
 | |
| 	hcl_uc_to_utf8
 | |
| };
 | |
| 
 | |
| hcl_cmgr_t* hcl_get_utf8_cmgr (void)
 | |
| {
 | |
| 	return &utf8_cmgr;
 | |
| }
 | |
| 
 | |
| int hcl_conv_utf8_to_uchars (const hcl_bch_t* bcs, hcl_oow_t* bcslen, hcl_uch_t* ucs, hcl_oow_t* ucslen)
 | |
| {
 | |
| 	/* the source is length bound */
 | |
| 	return hcl_conv_bchars_to_uchars_with_cmgr(bcs, bcslen, ucs, ucslen, &utf8_cmgr, 0);
 | |
| }
 | |
| 
 | |
| int hcl_conv_uchars_to_utf8 (const hcl_uch_t* ucs, hcl_oow_t* ucslen, hcl_bch_t* bcs, hcl_oow_t* bcslen)
 | |
| {
 | |
| 	/* length bound */
 | |
| 	return hcl_conv_uchars_to_bchars_with_cmgr(ucs, ucslen, bcs, bcslen, &utf8_cmgr);
 | |
| }
 | |
| 
 | |
| int hcl_conv_utf8_to_ucstr (const hcl_bch_t* bcs, hcl_oow_t* bcslen, hcl_uch_t* ucs, hcl_oow_t* ucslen)
 | |
| {
 | |
| 	/* null-terminated. */
 | |
| 	return hcl_conv_bcstr_to_ucstr_with_cmgr(bcs, bcslen, ucs, ucslen, &utf8_cmgr, 0);
 | |
| }
 | |
| 
 | |
| int hcl_conv_ucstr_to_utf8 (const hcl_uch_t* ucs, hcl_oow_t* ucslen, hcl_bch_t* bcs, hcl_oow_t* bcslen)
 | |
| {
 | |
| 	/* null-terminated */
 | |
| 	return hcl_conv_ucstr_to_bcstr_with_cmgr(ucs, ucslen, bcs, bcslen, &utf8_cmgr);
 | |
| }
 | |
| 
 | |
| /* ----------------------------------------------------------------------- */
 | |
| 
 | |
| int hcl_convbtouchars (hcl_t* hcl, const hcl_bch_t* bcs, hcl_oow_t* bcslen, hcl_uch_t* ucs, hcl_oow_t* ucslen)
 | |
| {
 | |
| 	/* length bound */
 | |
| 	int n;
 | |
| 
 | |
| 	n = hcl_conv_bchars_to_uchars_with_cmgr(bcs, bcslen, ucs, ucslen, hcl->cmgr, 0);
 | |
| 
 | |
| 	if (n <= -1)
 | |
| 	{
 | |
| 		/* -1: illegal character, -2: buffer too small, -3: incomplete sequence */
 | |
| 		hcl_seterrnum (hcl, (n == -2)? HCL_EBUFFULL: HCL_EECERR);
 | |
| 	}
 | |
| 
 | |
| 	return n;
 | |
| }
 | |
| 
 | |
| int hcl_convutobchars (hcl_t* hcl, const hcl_uch_t* ucs, hcl_oow_t* ucslen, hcl_bch_t* bcs, hcl_oow_t* bcslen)
 | |
| {
 | |
| 	/* length bound */
 | |
| 	int n;
 | |
| 
 | |
| 	n = hcl_conv_uchars_to_bchars_with_cmgr(ucs, ucslen, bcs, bcslen, hcl->cmgr);
 | |
| 
 | |
| 	if (n <= -1)
 | |
| 	{
 | |
| 		hcl_seterrnum (hcl, (n == -2)? HCL_EBUFFULL: HCL_EECERR);
 | |
| 	}
 | |
| 
 | |
| 	return n;
 | |
| }
 | |
| 
 | |
| int hcl_convbtoucstr (hcl_t* hcl, const hcl_bch_t* bcs, hcl_oow_t* bcslen, hcl_uch_t* ucs, hcl_oow_t* ucslen)
 | |
| {
 | |
| 	/* null-terminated. */
 | |
| 	int n;
 | |
| 
 | |
| 	n = hcl_conv_bcstr_to_ucstr_with_cmgr(bcs, bcslen, ucs, ucslen, hcl->cmgr, 0);
 | |
| 
 | |
| 	if (n <= -1)
 | |
| 	{
 | |
| 		hcl_seterrnum (hcl, (n == -2)? HCL_EBUFFULL: HCL_EECERR);
 | |
| 	}
 | |
| 
 | |
| 	return n;
 | |
| }
 | |
| 
 | |
| int hcl_convutobcstr (hcl_t* hcl, const hcl_uch_t* ucs, hcl_oow_t* ucslen, hcl_bch_t* bcs, hcl_oow_t* bcslen)
 | |
| {
 | |
| 	/* null-terminated */
 | |
| 	int n;
 | |
| 
 | |
| 	n = hcl_conv_ucstr_to_bcstr_with_cmgr(ucs, ucslen, bcs, bcslen, hcl->cmgr);
 | |
| 
 | |
| 	if (n <= -1)
 | |
| 	{
 | |
| 		hcl_seterrnum (hcl, (n == -2)? HCL_EBUFFULL: HCL_EECERR);
 | |
| 	}
 | |
| 
 | |
| 	return n;
 | |
| }
 | |
| 
 | |
| /* ----------------------------------------------------------------------- */
 | |
| 
 | |
| HCL_INLINE hcl_uch_t* hcl_dupbtoucharswithheadroom (hcl_t* hcl, hcl_oow_t headroom_bytes, const hcl_bch_t* bcs, hcl_oow_t bcslen, hcl_oow_t* ucslen)
 | |
| {
 | |
| 	hcl_oow_t inlen, outlen;
 | |
| 	hcl_uch_t* ptr;
 | |
| 
 | |
| 	inlen = bcslen;
 | |
| 	if (hcl_convbtouchars (hcl, bcs, &inlen, HCL_NULL, &outlen) <= -1) 
 | |
| 	{
 | |
| 		/* note it's also an error if no full conversion is made in this function */
 | |
| 		return HCL_NULL;
 | |
| 	}
 | |
| 
 | |
| 	ptr = (hcl_uch_t*)hcl_allocmem(hcl, headroom_bytes + ((outlen + 1) * HCL_SIZEOF(hcl_uch_t)));
 | |
| 	if (!ptr) return HCL_NULL;
 | |
| 
 | |
| 	inlen = bcslen;
 | |
| 
 | |
| 	ptr = (hcl_uch_t*)((hcl_oob_t*)ptr + headroom_bytes);
 | |
| 	hcl_convbtouchars (hcl, bcs, &inlen, ptr, &outlen);
 | |
| 
 | |
| 	/* hcl_convbtouchars() doesn't null-terminate the target. 
 | |
| 	 * but in hcl_dupbtouchars(), i allocate space. so i don't mind
 | |
| 	 * null-terminating it with 1 extra character overhead */
 | |
| 	ptr[outlen] = '\0'; 
 | |
| 	if (ucslen) *ucslen = outlen;
 | |
| 	return ptr;
 | |
| }
 | |
| 
 | |
| hcl_uch_t* hcl_dupbtouchars (hcl_t* hcl, const hcl_bch_t* bcs, hcl_oow_t bcslen, hcl_oow_t* ucslen)
 | |
| {
 | |
| 	return hcl_dupbtoucharswithheadroom (hcl, 0, bcs, bcslen, ucslen);
 | |
| }
 | |
| 
 | |
| HCL_INLINE hcl_bch_t* hcl_duputobcharswithheadroom (hcl_t* hcl, hcl_oow_t headroom_bytes, const hcl_uch_t* ucs, hcl_oow_t ucslen, hcl_oow_t* bcslen)
 | |
| {
 | |
| 	hcl_oow_t inlen, outlen;
 | |
| 	hcl_bch_t* ptr;
 | |
| 
 | |
| 	inlen = ucslen;
 | |
| 	if (hcl_convutobchars(hcl, ucs, &inlen, HCL_NULL, &outlen) <= -1) 
 | |
| 	{
 | |
| 		/* note it's also an error if no full conversion is made in this function */
 | |
| 		return HCL_NULL;
 | |
| 	}
 | |
| 
 | |
| 	ptr = (hcl_bch_t*)hcl_allocmem(hcl, headroom_bytes + ((outlen + 1) * HCL_SIZEOF(hcl_bch_t)));
 | |
| 	if (!ptr) return HCL_NULL;
 | |
| 
 | |
| 	inlen = ucslen;
 | |
| 	ptr = (hcl_bch_t*)((hcl_oob_t*)ptr + headroom_bytes);
 | |
| 	hcl_convutobchars (hcl, ucs, &inlen, ptr, &outlen);
 | |
| 
 | |
| 	ptr[outlen] = '\0';
 | |
| 	if (bcslen) *bcslen = outlen;
 | |
| 	return ptr;
 | |
| }
 | |
| 
 | |
| hcl_bch_t* hcl_duputobchars (hcl_t* hcl, const hcl_uch_t* ucs, hcl_oow_t ucslen, hcl_oow_t* bcslen)
 | |
| {
 | |
| 	return hcl_duputobcharswithheadroom (hcl, 0, ucs, ucslen, bcslen);
 | |
| }
 | |
| 
 | |
| 
 | |
| /* ----------------------------------------------------------------------- */
 | |
| 
 | |
| HCL_INLINE hcl_uch_t* hcl_dupbtoucstrwithheadroom (hcl_t* hcl, hcl_oow_t headroom_bytes, const hcl_bch_t* bcs, hcl_oow_t* ucslen)
 | |
| {
 | |
| 	hcl_oow_t inlen, outlen;
 | |
| 	hcl_uch_t* ptr;
 | |
| 
 | |
| 	if (hcl_convbtoucstr(hcl, bcs, &inlen, HCL_NULL, &outlen) <= -1) 
 | |
| 	{
 | |
| 		/* note it's also an error if no full conversion is made in this function */
 | |
| 		return HCL_NULL;
 | |
| 	}
 | |
| 
 | |
| 	outlen++;
 | |
| 	ptr = (hcl_uch_t*)hcl_allocmem (hcl, headroom_bytes + (outlen * HCL_SIZEOF(hcl_uch_t)));
 | |
| 	if (!ptr) return HCL_NULL;
 | |
| 
 | |
| 	hcl_convbtoucstr (hcl, bcs, &inlen, ptr, &outlen);
 | |
| 	if (ucslen) *ucslen = outlen;
 | |
| 	return ptr;
 | |
| }
 | |
| 
 | |
| hcl_uch_t* hcl_dupbtoucstr (hcl_t* hcl, const hcl_bch_t* bcs, hcl_oow_t* ucslen)
 | |
| {
 | |
| 	return hcl_dupbtoucstrwithheadroom (hcl, 0, bcs, ucslen);
 | |
| }
 | |
| 
 | |
| HCL_INLINE hcl_bch_t* hcl_duputobcstrwithheadroom (hcl_t* hcl, hcl_oow_t headroom_bytes, const hcl_uch_t* ucs, hcl_oow_t* bcslen)
 | |
| {
 | |
| 	hcl_oow_t inlen, outlen;
 | |
| 	hcl_bch_t* ptr;
 | |
| 
 | |
| 	if (hcl_convutobcstr (hcl, ucs, &inlen, HCL_NULL, &outlen) <= -1) 
 | |
| 	{
 | |
| 		/* note it's also an error if no full conversion is made in this function */
 | |
| 		return HCL_NULL;
 | |
| 	}
 | |
| 
 | |
| 	outlen++;
 | |
| 	ptr = (hcl_bch_t*)hcl_allocmem (hcl, headroom_bytes + (outlen * HCL_SIZEOF(hcl_bch_t)));
 | |
| 	if (!ptr) return HCL_NULL;
 | |
| 
 | |
| 	ptr = (hcl_bch_t*)((hcl_oob_t*)ptr + headroom_bytes);
 | |
| 
 | |
| 	hcl_convutobcstr (hcl, ucs, &inlen, ptr, &outlen);
 | |
| 	if (bcslen) *bcslen = outlen;
 | |
| 	return ptr;
 | |
| }
 | |
| 
 | |
| hcl_bch_t* hcl_duputobcstr (hcl_t* hcl, const hcl_uch_t* ucs, hcl_oow_t* bcslen)
 | |
| {
 | |
| 	return hcl_duputobcstrwithheadroom (hcl, 0, ucs, bcslen);
 | |
| }
 | |
| /* ----------------------------------------------------------------------- */
 | |
| 
 | |
| hcl_uch_t* hcl_dupuchars (hcl_t* hcl, const hcl_uch_t* ucs, hcl_oow_t ucslen)
 | |
| {
 | |
| 	hcl_uch_t* ptr;
 | |
| 
 | |
| 	ptr = (hcl_uch_t*)hcl_allocmem (hcl, (ucslen + 1) * HCL_SIZEOF(hcl_uch_t));
 | |
| 	if (!ptr) return HCL_NULL;
 | |
| 
 | |
| 	hcl_copy_uchars (ptr, ucs, ucslen);
 | |
| 	ptr[ucslen] = '\0';
 | |
| 	return ptr;
 | |
| }
 | |
| 
 | |
| hcl_bch_t* hcl_dupbchars (hcl_t* hcl, const hcl_bch_t* bcs, hcl_oow_t bcslen)
 | |
| {
 | |
| 	hcl_bch_t* ptr;
 | |
| 
 | |
| 	ptr = (hcl_bch_t*)hcl_allocmem (hcl, (bcslen + 1) * HCL_SIZEOF(hcl_bch_t));
 | |
| 	if (!ptr) return HCL_NULL;
 | |
| 
 | |
| 	hcl_copy_bchars (ptr, bcs, bcslen);
 | |
| 	ptr[bcslen] = '\0';
 | |
| 	return ptr;
 | |
| }
 | |
| 
 |