zint/backend/common.c

375 lines
10 KiB
C
Raw Normal View History

2008-07-14 09:15:55 +12:00
/* common.c - Contains functions needed for a number of barcodes */
/*
libzint - the open source barcode library
2008-11-17 21:47:42 +13:00
Copyright (C) 2008 Robin Stuart <robin@zint.org.uk>
2008-07-14 09:15:55 +12:00
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include "common.h"
2013-01-01 02:41:59 +13:00
int ustrlen(const unsigned char data[]) {
2008-10-01 04:05:53 +13:00
/* Local replacement for strlen() with unsigned char strings */
int i;
2009-01-15 22:05:54 +13:00
for (i=0;data[i];i++);
2008-10-01 04:05:53 +13:00
return i;
}
2013-01-01 02:41:59 +13:00
void ustrcpy(unsigned char target[],const unsigned char source[]) {
2009-02-20 08:09:57 +13:00
/* Local replacement for strcpy() with unsigned char strings */
int i, len;
len = ustrlen(source);
for(i = 0; i < len; i++) {
target[i] = source[i];
}
target[i] = '\0';
}
2012-12-30 07:37:03 +13:00
void concat(char dest[],const char source[])
2008-07-14 09:15:55 +12:00
{ /* Concatinates dest[] with the contents of source[], copying /0 as well */
2009-10-07 08:03:00 +13:00
unsigned int i, j, n;
2008-07-14 09:15:55 +12:00
j = strlen(dest);
2009-10-07 08:03:00 +13:00
n = strlen(source);
for(i = 0; i <= n; i++) {
2008-07-14 09:15:55 +12:00
dest[i + j] = source[i]; }
}
2013-01-01 02:41:59 +13:00
void uconcat(unsigned char dest[], const unsigned char source[])
2009-02-20 08:09:57 +13:00
{ /* Concatinates dest[] with the contents of source[], copying /0 as well */
unsigned int i, j;
j = ustrlen(dest);
for(i = 0; i <= ustrlen(source); i++) {
dest[i + j] = source[i]; }
}
2008-07-14 09:15:55 +12:00
int ctoi(char source)
{ /* Converts a character 0-9 to its equivalent integer value */
if((source >= '0') && (source <= '9'))
return (source - '0');
return(source - 'A' + 10);
}
char itoc(int source)
{ /* Converts an integer value to its hexadecimal character */
if ((source >= 0) && (source <= 9)) {
return ('0' + source); }
else {
return ('A' + (source - 10)); }
}
void to_upper(unsigned char source[])
{ /* Converts lower case characters to upper case in a string source[] */
2009-10-07 08:03:00 +13:00
unsigned int i, src_len = ustrlen(source);
2008-07-14 09:15:55 +12:00
2009-10-07 08:03:00 +13:00
for (i = 0; i < src_len; i++) {
2008-07-14 09:15:55 +12:00
if ((source[i] >= 'a') && (source[i] <= 'z')) {
source [i] = (source[i] - 'a') + 'A'; }
}
}
int is_sane(char test_string[], unsigned char source[], int length)
2008-07-14 09:15:55 +12:00
{ /* Verifies that a string only uses valid characters */
unsigned int i, j, latch;
2009-10-07 08:03:00 +13:00
unsigned int lt = strlen(test_string);
2008-07-14 09:15:55 +12:00
for(i = 0; i < length; i++) {
2008-07-14 09:15:55 +12:00
latch = FALSE;
2009-10-07 08:03:00 +13:00
for(j = 0; j < lt; j++) {
if (source[i] == test_string[j]) {
latch = TRUE;
break;
}
}
2008-07-14 09:15:55 +12:00
if (!(latch)) {
2009-10-07 08:03:00 +13:00
return ERROR_INVALID_DATA;
}
2008-07-14 09:15:55 +12:00
}
2013-01-01 02:41:59 +13:00
2008-07-14 09:15:55 +12:00
return 0;
}
int posn(char set_string[], char data)
{ /* Returns the position of data in set_string */
2009-10-07 08:03:00 +13:00
unsigned int i, n = strlen(set_string);
2008-07-14 09:15:55 +12:00
2009-10-07 08:03:00 +13:00
for(i = 0; i < n; i++) {
2008-07-14 09:15:55 +12:00
if (data == set_string[i]) { return i; } }
return 0;
}
2012-12-30 07:37:03 +13:00
void lookup(char set_string[],const char *table[], char data, char dest[])
2008-07-14 09:15:55 +12:00
{ /* Replaces huge switch statements for looking up in tables */
2009-10-07 08:03:00 +13:00
unsigned int i, n = strlen(set_string);
2008-07-14 09:15:55 +12:00
2009-10-07 08:03:00 +13:00
for(i = 0; i < n; i++) {
2008-07-14 09:15:55 +12:00
if (data == set_string[i]) { concat(dest, table[i]); } }
}
int module_is_set(struct zint_symbol *symbol, int y_coord, int x_coord)
{
return (symbol->encoded_data[y_coord][x_coord / 7] >> (x_coord % 7)) & 1;
2009-10-07 08:03:00 +13:00
#if 0
switch(x_sub) {
case 0: if((symbol->encoded_data[y_coord][x_char] & 0x01) != 0) { result = 1; } break;
case 1: if((symbol->encoded_data[y_coord][x_char] & 0x02) != 0) { result = 1; } break;
case 2: if((symbol->encoded_data[y_coord][x_char] & 0x04) != 0) { result = 1; } break;
case 3: if((symbol->encoded_data[y_coord][x_char] & 0x08) != 0) { result = 1; } break;
case 4: if((symbol->encoded_data[y_coord][x_char] & 0x10) != 0) { result = 1; } break;
case 5: if((symbol->encoded_data[y_coord][x_char] & 0x20) != 0) { result = 1; } break;
case 6: if((symbol->encoded_data[y_coord][x_char] & 0x40) != 0) { result = 1; } break;
}
return result;
2009-10-07 08:03:00 +13:00
#endif
}
void set_module(struct zint_symbol *symbol, int y_coord, int x_coord)
{
symbol->encoded_data[y_coord][x_coord / 7] |= 1 << (x_coord % 7);
2009-10-07 08:03:00 +13:00
#if 0
int x_char, x_sub;
x_char = x_coord / 7;
x_sub = x_coord % 7;
switch(x_sub) {
case 0: symbol->encoded_data[y_coord][x_char] += 0x01; break;
case 1: symbol->encoded_data[y_coord][x_char] += 0x02; break;
case 2: symbol->encoded_data[y_coord][x_char] += 0x04; break;
case 3: symbol->encoded_data[y_coord][x_char] += 0x08; break;
case 4: symbol->encoded_data[y_coord][x_char] += 0x10; break;
case 5: symbol->encoded_data[y_coord][x_char] += 0x20; break;
case 6: symbol->encoded_data[y_coord][x_char] += 0x40; break;
} /* The last binary digit is reserved for colour barcodes */
2009-10-07 08:03:00 +13:00
#endif
}
void unset_module(struct zint_symbol *symbol, int y_coord, int x_coord)
{
symbol->encoded_data[y_coord][x_coord / 7] &= ~(1 << (x_coord % 7));
2009-10-07 08:03:00 +13:00
#if 0
int x_char, x_sub;
x_char = x_coord / 7;
x_sub = x_coord % 7;
switch(x_sub) {
case 0: symbol->encoded_data[y_coord][x_char] -= 0x01; break;
case 1: symbol->encoded_data[y_coord][x_char] -= 0x02; break;
case 2: symbol->encoded_data[y_coord][x_char] -= 0x04; break;
case 3: symbol->encoded_data[y_coord][x_char] -= 0x08; break;
case 4: symbol->encoded_data[y_coord][x_char] -= 0x10; break;
case 5: symbol->encoded_data[y_coord][x_char] -= 0x20; break;
case 6: symbol->encoded_data[y_coord][x_char] -= 0x40; break;
} /* The last binary digit is reserved for colour barcodes */
2009-10-07 08:03:00 +13:00
#endif
}
2008-07-14 09:15:55 +12:00
void expand(struct zint_symbol *symbol, char data[])
{ /* Expands from a width pattern to a bit pattern */
2013-01-01 02:41:59 +13:00
2009-10-07 08:03:00 +13:00
unsigned int reader, n = strlen(data);
int writer, i;
2008-07-14 09:15:55 +12:00
char latch;
2013-01-01 02:41:59 +13:00
2008-07-14 09:15:55 +12:00
writer = 0;
latch = '1';
2013-01-01 02:41:59 +13:00
2009-10-07 08:03:00 +13:00
for(reader = 0; reader < n; reader++) {
2008-07-14 09:15:55 +12:00
for(i = 0; i < ctoi(data[reader]); i++) {
if(latch == '1') { set_module(symbol, symbol->rows, writer); }
2008-07-14 09:15:55 +12:00
writer++;
}
latch = (latch == '1' ? '0' : '1');
2008-07-14 09:15:55 +12:00
}
2013-01-01 02:41:59 +13:00
2008-07-14 09:15:55 +12:00
if(symbol->symbology != BARCODE_PHARMA) {
if(writer > symbol->width) {
symbol->width = writer;
}
} else {
/* Pharmacode One ends with a space - adjust for this */
if(writer > symbol->width + 2) {
symbol->width = writer - 2;
}
}
symbol->rows = symbol->rows + 1;
}
int is_stackable(int symbology) {
/* Indicates which symbologies can have row binding */
if(symbology < BARCODE_PDF417) { return 1; }
if(symbology == BARCODE_CODE128B) { return 1; }
if(symbology == BARCODE_ISBNX) { return 1; }
if(symbology == BARCODE_EAN14) { return 1; }
if(symbology == BARCODE_NVE18) { return 1; }
if(symbology == BARCODE_KOREAPOST) { return 1; }
if(symbology == BARCODE_PLESSEY) { return 1; }
if(symbology == BARCODE_TELEPEN_NUM) { return 1; }
if(symbology == BARCODE_ITF14) { return 1; }
if(symbology == BARCODE_CODE32) { return 1; }
2013-01-01 02:41:59 +13:00
return 0;
}
int is_extendable(int symbology) {
/* Indicates which symbols can have addon */
if(symbology == BARCODE_EANX) { return 1; }
if(symbology == BARCODE_UPCA) { return 1; }
if(symbology == BARCODE_UPCE) { return 1; }
if(symbology == BARCODE_ISBNX) { return 1; }
if(symbology == BARCODE_UPCA_CC) { return 1; }
if(symbology == BARCODE_UPCE_CC) { return 1; }
if(symbology == BARCODE_EANX_CC) { return 1; }
2013-01-01 02:41:59 +13:00
return 0;
}
2009-02-18 06:48:39 +13:00
int roundup(float input)
{
float remainder;
int integer_part;
2013-01-01 02:41:59 +13:00
2009-02-18 06:48:39 +13:00
integer_part = (int)input;
remainder = input - integer_part;
2013-01-01 02:41:59 +13:00
2009-02-18 06:48:39 +13:00
if(remainder > 0.1) {
integer_part++;
}
2013-01-01 02:41:59 +13:00
2009-02-18 06:48:39 +13:00
return integer_part;
}
2009-07-05 08:48:42 +12:00
int istwodigits(unsigned char source[], int position)
{
if((source[position] >= '0') && (source[position] <= '9')) {
if((source[position + 1] >= '0') && (source[position + 1] <= '9')) {
return 1;
}
}
2013-01-01 02:41:59 +13:00
2009-07-05 08:48:42 +12:00
return 0;
}
float froundup(float input)
{
float fraction, output = 0.0;
2013-01-01 02:41:59 +13:00
2009-07-05 08:48:42 +12:00
fraction = input - (int)input;
if(fraction > 0.01) { output = (input - fraction) + 1.0; } else { output = input; }
2013-01-01 02:41:59 +13:00
2009-07-05 08:48:42 +12:00
return output;
}
int latin1_process(struct zint_symbol *symbol, unsigned char source[], unsigned char preprocessed[], int *length)
{
int j, i, next;
/* Convert Unicode to Latin-1 for those symbologies which only support Latin-1 */
j = 0;
i = 0;
do {
next = -1;
if(source[i] < 128) {
preprocessed[j] = source[i];
j++;
next = i + 1;
} else {
if(source[i] == 0xC2) {
preprocessed[j] = source[i + 1];
j++;
next = i + 2;
}
if(source[i] == 0xC3) {
preprocessed[j] = source[i + 1] + 64;
j++;
next = i + 2;
}
}
if(next == -1) {
strcpy(symbol->errtxt, "error: Invalid character in input string (only Latin-1 characters supported)");
return ERROR_INVALID_DATA;
}
i = next;
} while(i < *length);
preprocessed[j] = '\0';
*length = j;
2013-01-01 02:41:59 +13:00
return 0;
}
2009-10-07 08:03:00 +13:00
int utf8toutf16(struct zint_symbol *symbol, unsigned char source[], int vals[], int *length)
{
int bpos, jpos, error_number;
2009-10-07 08:03:00 +13:00
int next;
2013-01-01 02:41:59 +13:00
2009-10-07 08:03:00 +13:00
bpos = 0;
jpos = 0;
error_number = 0;
next = 0;
2013-01-01 02:41:59 +13:00
2009-10-07 08:03:00 +13:00
do {
if(source[bpos] <= 0x7f) {
/* 1 byte mode (7-bit ASCII) */
vals[jpos] = source[bpos];
next = bpos + 1;
jpos++;
} else {
2009-10-07 08:03:00 +13:00
if((source[bpos] >= 0x80) && (source[bpos] <= 0xbf)) {
strcpy(symbol->errtxt, "Corrupt Unicode data");
return ERROR_INVALID_DATA;
}
if((source[bpos] >= 0xc0) && (source[bpos] <= 0xc1)) {
strcpy(symbol->errtxt, "Overlong encoding not supported");
return ERROR_INVALID_DATA;
}
2009-10-07 08:03:00 +13:00
if((source[bpos] >= 0xc2) && (source[bpos] <= 0xdf)) {
/* 2 byte mode */
vals[jpos] = ((source[bpos] & 0x1f) << 6) + (source[bpos + 1] & 0x3f);
next = bpos + 2;
jpos++;
} else
2009-10-07 08:03:00 +13:00
if((source[bpos] >= 0xe0) && (source[bpos] <= 0xef)) {
/* 3 byte mode */
vals[jpos] = ((source[bpos] & 0x0f) << 12) + ((source[bpos + 1] & 0x3f) << 6) + (source[bpos + 2] & 0x3f);
next = bpos + 3;
jpos ++;
} else
2009-10-07 08:03:00 +13:00
if(source[bpos] >= 0xf0) {
strcpy(symbol->errtxt, "Unicode sequences of more than 3 bytes not supported");
return ERROR_INVALID_DATA;
}
}
2013-01-01 02:41:59 +13:00
2009-10-07 08:03:00 +13:00
bpos = next;
2013-01-01 02:41:59 +13:00
2009-10-07 08:03:00 +13:00
} while(bpos < *length);
*length = jpos;
2013-01-01 02:41:59 +13:00
2009-10-07 08:03:00 +13:00
return error_number;
}