mirror of
https://github.com/zint/zint
synced 2024-11-16 20:57:25 +13:00
284 lines
12 KiB
C
284 lines
12 KiB
C
/*
|
||
libzint - the open source barcode library
|
||
Copyright (C) 2008-2019 Robin Stuart <rstuart114@gmail.com>
|
||
|
||
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.
|
||
3. Neither the name of the project nor the names of its contributors
|
||
may be used to endorse or promote products derived from this software
|
||
without specific prior written permission.
|
||
|
||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT OWNER OR CONTRIBUTORS 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.
|
||
*/
|
||
/* vim: set ts=4 sw=4 et : */
|
||
|
||
#include "testcommon.h"
|
||
#include "test_sjis_tab.h"
|
||
#include "../sjis.h"
|
||
|
||
// As control convert to Shift JIS using simple table generated from https://www.unicode.org/Public/MAPPINGS/OBSOLETE/EASTASIA/JIS/SHIFTJIS.TXT plus simple processing
|
||
static int sjis_wctomb_zint2(unsigned char* r, unsigned int wc, size_t n)
|
||
{
|
||
if (wc < 0x20 || wc == 0x7F) {
|
||
r[0] = wc;
|
||
return 1;
|
||
}
|
||
// Shortcut
|
||
if ((wc > 0x00F7 && wc < 0x0391) || (wc > 0x0451 && wc < 0x2010) || (wc > 0x9FA0 && wc < 0xE000) || (wc > 0xE757 && wc < 0xFF01) || wc > 0xFFE5) {
|
||
return 0;
|
||
}
|
||
if (wc >= 0xE000 && wc <= 0xE757) { // PUA mappings, not in SHIFTJIS.TXT
|
||
unsigned short c;
|
||
if (wc <= 0xE0BB) {
|
||
c = wc - 0xE000 + 0xF040 + (wc >= 0xE000 + 0x3F);
|
||
} else if (wc <= 0xE177) {
|
||
c = wc - 0xE0BC + 0xF140 + (wc >= 0xE0BC + 0x3F);
|
||
} else if (wc <= 0xE233) {
|
||
c = wc - 0xE178 + 0xF240 + (wc >= 0xE178 + 0x3F);
|
||
} else if (wc <= 0xE2EF) {
|
||
c = wc - 0xE234 + 0xF340 + (wc >= 0xE234 + 0x3F);
|
||
} else if (wc <= 0xE3AB) {
|
||
c = wc - 0xE2F0 + 0xF440 + (wc >= 0xE2F0 + 0x3F);
|
||
} else if (wc <= 0xE467) {
|
||
c = wc - 0xE3AC + 0xF540 + (wc >= 0xE3AC + 0x3F);
|
||
} else if (wc <= 0xE523) {
|
||
c = wc - 0xE468 + 0xF640 + (wc >= 0xE468 + 0x3F);
|
||
} else if (wc <= 0xE5DF) {
|
||
c = wc - 0xE524 + 0xF740 + (wc >= 0xE524 + 0x3F);
|
||
} else if (wc <= 0xE69B) {
|
||
c = wc - 0xE5E0 + 0xF840 + (wc >= 0xE5E0 + 0x3F);
|
||
} else {
|
||
c = wc - 0xE69C + 0xF940 + (wc >= 0xE69C + 0x3F);
|
||
}
|
||
r[0] = (c >> 8);
|
||
r[1] = c & 0xFF;
|
||
return 2;
|
||
}
|
||
int tab_length = sizeof(test_sjis_tab) / sizeof(unsigned short);
|
||
for (int i = 0; i < tab_length; i += 2) {
|
||
if (test_sjis_tab[i + 1] == wc) {
|
||
unsigned short c = test_sjis_tab[i];
|
||
if (c < 0xFF) {
|
||
r[0] = c;
|
||
return 1;
|
||
}
|
||
r[0] = (c >> 8);
|
||
r[1] = c & 0xFF;
|
||
return 2;
|
||
}
|
||
}
|
||
return 0;
|
||
}
|
||
|
||
static void test_sjis_wctomb_zint(void)
|
||
{
|
||
testStart("");
|
||
|
||
int ret, ret2;
|
||
unsigned char buf[2], buf2[2];
|
||
unsigned int val, val2;
|
||
|
||
for (unsigned int i = 0; i < 0xFFFE; i++) {
|
||
if (i >= 0xD800 && i <= 0xDFFF) { // UTF-16 surrogates
|
||
continue;
|
||
}
|
||
buf[0] = buf[1] = buf2[0] = buf2[1] = 0;
|
||
ret = sjis_wctomb_zint(buf, i, 2);
|
||
val = ret == 1 ? buf[0] : (buf[0] << 8) | buf[1];
|
||
ret2 = sjis_wctomb_zint2(buf2, i, 2);
|
||
val2 = ret2 == 1 ? buf2[0] : (buf2[0] << 8) | buf2[1];
|
||
if (i == 0xFF3C) { // Extra mapping full-width reverse solidus U+FF3C to 0x815F, duplicate of U+005C (backslash)
|
||
assert_equal(ret, 2, "i:%d 0x%04X ret %d != 2, val 0x%04X\n", i, i, ret, val);
|
||
assert_equal(val, 0x815F, "i:%d 0x%04X val 0x%04X != 0x815F\n", i, i, val);
|
||
assert_zero(ret2, "i:%d 0x%04X ret2 %d != 0, val2 0x%04X\n", i, i, ret2, val2);
|
||
} else {
|
||
assert_equal(ret, ret2, "i:%d 0x%04X ret %d != ret2 %d, val 0x%04X, val2 0x%04X\n", i, i, ret, ret2, val, val2);
|
||
}
|
||
if (ret2) {
|
||
assert_equal(val, val2, "i:%d 0x%04X val 0x%04X != val2 0x%04X\n", i, i, val, val2);
|
||
}
|
||
}
|
||
|
||
testFinish();
|
||
}
|
||
|
||
static void test_sjis_utf8tomb(void)
|
||
{
|
||
testStart("");
|
||
|
||
int ret;
|
||
struct item {
|
||
unsigned char* data;
|
||
int length;
|
||
int ret;
|
||
size_t ret_length;
|
||
unsigned int expected_jisdata[20];
|
||
char* comment;
|
||
};
|
||
// é U+00E9 in ISO 8859-1 plus other ISO 8859 (but not in ISO 8859-7 or ISO 8859-11), Win 1250 plus other Win, not in Shift JIS, UTF-8 C3A9
|
||
// β U+03B2 in ISO 8859-7 Greek (but not other ISO 8859 or Win page), in Shift JIS 0x83C0, UTF-8 CEB2
|
||
// Ж U+0416 in ISO 8859-5 Cyrillic (but not other ISO 8859), Win 1251, in Shift JIS 0x8447, UTF-8 D096
|
||
// ¥ U+00A5 in ISO 8859-1 0xA5 (\245), in Shift JIS single-byte 0x5C (\134) (backslash); 0xA5 same codepoint as single-byte half-width katakana ・ (U+FF65) in Shift JIS (below), UTF-8 C2A5
|
||
// ・ U+FF65 half-width katakana, not in ISO/Win, in Shift JIS single-byte 0xA5 (\245), UTF-8 EFBDA5
|
||
// ソ U+FF7F half-width katakana, not in ISO/Win, in Shift JIS single-byte 0xBF (\277), UTF-8 EFBDBF
|
||
// ‾ U+203E overline, not in ISO/Win, in Shift JIS single-byte 0x7E (\176) (tilde), UTF-8 E280BE
|
||
// \ U+FF3C full-width reverse solidus, in Shift JIS 0x815F, duplicate of mapping of U+005C, UTF-8 EFBCBC
|
||
// 点 U+70B9 kanji, in Shift JIS 0x935F (\223\137), UTF-8 E782B9
|
||
// 茗 U+8317 kanji, in Shift JIS 0xE4AA (\344\252), UTF-8 E88C97
|
||
// テ U+30C6 katakana, in Shift JIS 0x8365 (\203\145), UTF-8 E38386
|
||
// s/\/\*[ 0-9]*\*\//\=printf("\/*%3d*\/", line(".") - line("'<"))
|
||
struct item data[] = {
|
||
/* 0*/ { "é", -1, ZINT_ERROR_INVALID_DATA, -1, {}, "" },
|
||
/* 1*/ { "~", -1, ZINT_ERROR_INVALID_DATA, -1, {}, "" },
|
||
/* 2*/ { "β", -1, 0, 1, { 0x83C0 }, "" },
|
||
/* 3*/ { "¥", -1, 0, 1, { 0x5C }, "" },
|
||
/* 4*/ { "aβcЖ¥・ソ‾\\\点茗テ", -1, 0, 13, { 'a', 0x83C0, 'c', 0x8447, 0x5C, 0xA5, 0xBF, 0x7E, 0x815F, 0x815F, 0x935F, 0xE4AA, 0x8365 }, "" },
|
||
};
|
||
|
||
int data_size = sizeof(data) / sizeof(struct item);
|
||
|
||
struct zint_symbol symbol;
|
||
unsigned int jisdata[20];
|
||
|
||
for (int i = 0; i < data_size; i++) {
|
||
|
||
int length = data[i].length == -1 ? strlen(data[i].data) : data[i].length;
|
||
size_t ret_length = length;
|
||
|
||
ret = sjis_utf8tomb(&symbol, data[i].data, &ret_length, jisdata);
|
||
assert_equal(ret, data[i].ret, "i:%d ret %d != %d (%s)\n", i, ret, data[i].ret, symbol.errtxt);
|
||
if (ret == 0) {
|
||
assert_equal(ret_length, data[i].ret_length, "i:%d ret_length %zu != %zu\n", i, ret_length, data[i].ret_length);
|
||
for (int j = 0; j < ret_length; j++) {
|
||
assert_equal(jisdata[j], data[i].expected_jisdata[j], "i:%d jisdata[%d] %04X != %04X\n", i, j, jisdata[j], data[i].expected_jisdata[j]);
|
||
}
|
||
}
|
||
}
|
||
|
||
testFinish();
|
||
}
|
||
|
||
static void test_sjis_utf8tosb(void)
|
||
{
|
||
testStart("");
|
||
|
||
int ret;
|
||
struct item {
|
||
int eci;
|
||
unsigned char* data;
|
||
int length;
|
||
int ret;
|
||
size_t ret_length;
|
||
unsigned int expected_jisdata[20];
|
||
char* comment;
|
||
};
|
||
// é U+00E9 in ISO 8859-1 0xE9, Win 1250 plus other Win
|
||
// β U+03B2 in ISO 8859-7 Greek 0xE2 (but not other ISO 8859 or Win page)
|
||
// ¥ U+00A5 in ISO 8859-1 0xA5, in QR Kanji mode first byte range 0x81..9F, 0xE0..EB
|
||
// ú U+00FA in ISO 8859-1 0xFA, outside first byte range
|
||
// à U+00FA in ISO 8859-1 0xE0, in first byte range
|
||
// ë U+00FA in ISO 8859-1 0xEB, in first byte range
|
||
// ì U+00FA in ISO 8859-1 0xEC, outside first byte range
|
||
// µ U+00B5 in ISO 8859-1 0xB5, outside first byte range
|
||
// s/\/\*[ 0-9]*\*\//\=printf("\/*%3d*\/", line(".") - line("'<"))
|
||
struct item data[] = {
|
||
/* 0*/ { 3, "é", -1, 0, 1, { 0xE9 }, "" },
|
||
/* 1*/ { 3, "β", -1, ZINT_ERROR_INVALID_DATA, -1, {}, "" },
|
||
/* 2*/ { 9, "β", -1, 0, 1, { 0xE2 }, "" },
|
||
/* 3*/ { 3, "¥", -1, 0, 1, { 0xA5 }, "" },
|
||
/* 4*/ { 3, "éa", -1, 0, 1, { 0xE961 }, "In QR Kanji mode range" },
|
||
/* 5*/ { 3, "éaúbàcëdìeµ", -1, 0, 8, { 0xE961, 0xFA, 0x62, 0xE063, 0xEB64, 0xEC, 0x65, 0xB5 }, "" },
|
||
};
|
||
|
||
int data_size = sizeof(data) / sizeof(struct item);
|
||
|
||
unsigned int jisdata[20];
|
||
|
||
for (int i = 0; i < data_size; i++) {
|
||
|
||
int length = data[i].length == -1 ? strlen(data[i].data) : data[i].length;
|
||
size_t ret_length = length;
|
||
|
||
ret = sjis_utf8tosb(data[i].eci, data[i].data, &ret_length, jisdata);
|
||
assert_equal(ret, data[i].ret, "i:%d ret %d != %d\n", i, ret, data[i].ret);
|
||
if (ret == 0) {
|
||
assert_equal(ret_length, data[i].ret_length, "i:%d ret_length %zu != %zu\n", i, ret_length, data[i].ret_length);
|
||
for (int j = 0; j < ret_length; j++) {
|
||
assert_equal(jisdata[j], data[i].expected_jisdata[j], "i:%d jisdata[%d] %04X != %04X\n", i, j, jisdata[j], data[i].expected_jisdata[j]);
|
||
}
|
||
}
|
||
}
|
||
|
||
testFinish();
|
||
}
|
||
|
||
static void test_sjis_cpy(void)
|
||
{
|
||
testStart("");
|
||
|
||
int ret;
|
||
struct item {
|
||
unsigned char* data;
|
||
int length;
|
||
int ret;
|
||
size_t ret_length;
|
||
unsigned int expected_jisdata[20];
|
||
char* comment;
|
||
};
|
||
// s/\/\*[ 0-9]*\*\//\=printf("\/*%3d*\/", line(".") - line("'<"))
|
||
struct item data[] = {
|
||
/* 0*/ { "\351", -1, 0, 1, { 0xE9 }, "In QR Kanji mode first-byte range but only one byte" },
|
||
/* 1*/ { "\351\141", -1, 0, 1, { 0xE961 }, "In QR Kanji mode range" },
|
||
/* 0*/ { "\201", -1, 0, 1, { 0x81 }, "In QR Kanji mode first-byte range but only one byte" },
|
||
/* 0*/ { "\201\141", -1, 0, 1, { 0x8161 }, "In QR Kanji mode range" },
|
||
/* 0*/ { "\201\077\201\100\237\374\237\375\340\077\340\100\353\277\353\300", -1, 0, 12, { 0x81, 0x3F, 0x8140, 0x9FFC, 0x9F, 0xFD, 0xE0, 0x3F, 0xE040, 0xEBBF, 0xEB, 0xC0 }, "" },
|
||
};
|
||
|
||
int data_size = sizeof(data) / sizeof(struct item);
|
||
|
||
unsigned int jisdata[20];
|
||
|
||
for (int i = 0; i < data_size; i++) {
|
||
|
||
int length = data[i].length == -1 ? strlen(data[i].data) : data[i].length;
|
||
size_t ret_length = length;
|
||
|
||
sjis_cpy(data[i].data, &ret_length, jisdata);
|
||
assert_equal(ret_length, data[i].ret_length, "i:%d ret_length %zu != %zu\n", i, ret_length, data[i].ret_length);
|
||
for (int j = 0; j < ret_length; j++) {
|
||
assert_equal(jisdata[j], data[i].expected_jisdata[j], "i:%d jisdata[%d] %04X != %04X\n", i, j, jisdata[j], data[i].expected_jisdata[j]);
|
||
}
|
||
}
|
||
|
||
testFinish();
|
||
}
|
||
|
||
int main()
|
||
{
|
||
test_sjis_wctomb_zint();
|
||
test_sjis_utf8tomb();
|
||
test_sjis_utf8tosb();
|
||
test_sjis_cpy();
|
||
|
||
testReport();
|
||
|
||
return 0;
|
||
}
|