2009-05-10 15:47:20 +04:00
/* code49.c - Handles Code 49 */
/*
libzint - the open source barcode library
2017-05-11 23:14:38 +03:00
Copyright ( C ) 2009 - 2017 Robin Stuart < rstuart114 @ gmail . com >
2009-05-10 15:47:20 +04:00
2013-05-16 21:26:38 +04:00
Redistribution and use in source and binary forms , with or without
modification , are permitted provided that the following conditions
are met :
2009-05-10 15:47:20 +04:00
2016-02-20 12:38:03 +03:00
1. Redistributions of source code must retain the above copyright
notice , this list of conditions and the following disclaimer .
2013-05-16 21:26:38 +04:00
2. Redistributions in binary form must reproduce the above copyright
notice , this list of conditions and the following disclaimer in the
2016-02-20 12:38:03 +03:00
documentation and / or other materials provided with the distribution .
2013-05-16 21:26:38 +04:00
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
2016-02-20 12:38:03 +03:00
without specific prior written permission .
2009-05-10 15:47:20 +04:00
2013-05-16 21:26:38 +04:00
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
2016-02-20 12:38:03 +03:00
OUT OF THE USE OF THIS SOFTWARE , EVEN IF ADVISED OF THE POSSIBILITY OF
2013-05-16 21:26:38 +04:00
SUCH DAMAGE .
2016-02-20 12:38:03 +03:00
*/
2009-05-10 15:47:20 +04:00
# include <string.h>
# include <stdio.h>
# include <stdlib.h>
# include "common.h"
# include "code49.h"
2009-07-09 12:28:00 +04:00
# define INSET "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ-. $ / +%!&*"
2016-02-20 12:38:03 +03:00
2009-07-09 12:28:00 +04:00
/* "!" represents Shift 1 and "&" represents Shift 2, "*" represents FNC1 */
2009-05-10 15:47:20 +04:00
2016-03-03 00:12:38 +03:00
int code_49 ( struct zint_symbol * symbol , unsigned char source [ ] , const int length ) {
int i , j , rows , M , x_count , y_count , z_count , posn_val , local_value ;
2016-02-29 22:42:32 +03:00
char intermediate [ 170 ] = " " ;
2016-02-20 12:38:03 +03:00
int codewords [ 170 ] , codeword_count ;
int c_grid [ 8 ] [ 8 ] ; /* Refers to table 3 */
int w_grid [ 8 ] [ 4 ] ; /* Refets to table 2 */
int pad_count = 0 ;
2017-06-10 12:45:42 +03:00
char pattern [ 80 ] ;
2016-02-20 12:38:03 +03:00
int gs1 ;
2016-03-03 00:12:38 +03:00
size_t h ;
2016-02-20 12:38:03 +03:00
if ( length > 81 ) {
2017-07-27 18:01:53 +03:00
strcpy ( symbol - > errtxt , " 430: Input too long " ) ;
2016-02-20 12:38:03 +03:00
return ZINT_ERROR_TOO_LONG ;
}
if ( symbol - > input_mode = = GS1_MODE ) {
gs1 = 1 ;
strcpy ( intermediate , " * " ) ; /* FNC1 */
} else {
gs1 = 0 ;
}
for ( i = 0 ; i < length ; i + + ) {
if ( source [ i ] > 127 ) {
2017-07-27 18:01:53 +03:00
strcpy ( symbol - > errtxt , " 431: Invalid characters in input data " ) ;
2016-02-20 12:38:03 +03:00
return ZINT_ERROR_INVALID_DATA ;
}
if ( gs1 & & ( source [ i ] = = ' [ ' ) )
2016-03-03 00:12:38 +03:00
strcat ( intermediate , " * " ) ; /* FNC1 */
2016-02-20 12:38:03 +03:00
else
2016-03-03 00:12:38 +03:00
strcat ( intermediate , c49_table7 [ source [ i ] ] ) ;
2016-02-20 12:38:03 +03:00
}
codeword_count = 0 ;
i = 0 ;
h = strlen ( intermediate ) ;
do {
if ( ( intermediate [ i ] > = ' 0 ' ) & & ( intermediate [ i ] < = ' 9 ' ) ) {
/* Numeric data */
for ( j = 0 ; ( intermediate [ i + j ] > = ' 0 ' ) & & ( intermediate [ i + j ] < = ' 9 ' ) ; j + + ) ;
if ( j > = 5 ) {
/* Use Numeric Encodation Method */
int block_count , c ;
int block_remain ;
int block_value ;
codewords [ codeword_count ] = 48 ; /* Numeric Shift */
codeword_count + + ;
block_count = j / 5 ;
block_remain = j % 5 ;
for ( c = 0 ; c < block_count ; c + + ) {
if ( ( c = = block_count - 1 ) & & ( block_remain = = 2 ) ) {
/* Rule (d) */
block_value = 100000 ;
block_value + = ctoi ( intermediate [ i ] ) * 1000 ;
block_value + = ctoi ( intermediate [ i + 1 ] ) * 100 ;
block_value + = ctoi ( intermediate [ i + 2 ] ) * 10 ;
block_value + = ctoi ( intermediate [ i + 3 ] ) ;
codewords [ codeword_count ] = block_value / ( 48 * 48 ) ;
block_value = block_value - ( 48 * 48 ) * codewords [ codeword_count ] ;
codeword_count + + ;
codewords [ codeword_count ] = block_value / 48 ;
block_value = block_value - 48 * codewords [ codeword_count ] ;
codeword_count + + ;
codewords [ codeword_count ] = block_value ;
codeword_count + + ;
i + = 4 ;
block_value = ctoi ( intermediate [ i ] ) * 100 ;
block_value + = ctoi ( intermediate [ i + 1 ] ) * 10 ;
block_value + = ctoi ( intermediate [ i + 2 ] ) ;
codewords [ codeword_count ] = block_value / 48 ;
block_value = block_value - 48 * codewords [ codeword_count ] ;
codeword_count + + ;
codewords [ codeword_count ] = block_value ;
codeword_count + + ;
i + = 3 ;
} else {
block_value = ctoi ( intermediate [ i ] ) * 10000 ;
block_value + = ctoi ( intermediate [ i + 1 ] ) * 1000 ;
block_value + = ctoi ( intermediate [ i + 2 ] ) * 100 ;
block_value + = ctoi ( intermediate [ i + 3 ] ) * 10 ;
block_value + = ctoi ( intermediate [ i + 4 ] ) ;
codewords [ codeword_count ] = block_value / ( 48 * 48 ) ;
block_value = block_value - ( 48 * 48 ) * codewords [ codeword_count ] ;
codeword_count + + ;
codewords [ codeword_count ] = block_value / 48 ;
block_value = block_value - 48 * codewords [ codeword_count ] ;
codeword_count + + ;
codewords [ codeword_count ] = block_value ;
codeword_count + + ;
i + = 5 ;
}
}
switch ( block_remain ) {
case 1 :
/* Rule (a) */
codewords [ codeword_count ] = posn ( INSET , intermediate [ i ] ) ;
codeword_count + + ;
i + + ;
break ;
case 3 :
/* Rule (b) */
block_value = ctoi ( intermediate [ i ] ) * 100 ;
block_value + = ctoi ( intermediate [ i + 1 ] ) * 10 ;
block_value + = ctoi ( intermediate [ i + 2 ] ) ;
codewords [ codeword_count ] = block_value / 48 ;
block_value = block_value - 48 * codewords [ codeword_count ] ;
codeword_count + + ;
codewords [ codeword_count ] = block_value ;
codeword_count + + ;
i + = 3 ;
break ;
case 4 :
/* Rule (c) */
block_value = 100000 ;
block_value + = ctoi ( intermediate [ i ] ) * 1000 ;
block_value + = ctoi ( intermediate [ i + 1 ] ) * 100 ;
block_value + = ctoi ( intermediate [ i + 2 ] ) * 10 ;
block_value + = ctoi ( intermediate [ i + 3 ] ) ;
codewords [ codeword_count ] = block_value / ( 48 * 48 ) ;
block_value = block_value - ( 48 * 48 ) * codewords [ codeword_count ] ;
codeword_count + + ;
codewords [ codeword_count ] = block_value / 48 ;
block_value = block_value - 48 * codewords [ codeword_count ] ;
codeword_count + + ;
codewords [ codeword_count ] = block_value ;
codeword_count + + ;
i + = 4 ;
break ;
}
if ( i < h ) {
/* There is more to add */
codewords [ codeword_count ] = 48 ; /* Numeric Shift */
codeword_count + + ;
}
} else {
codewords [ codeword_count ] = posn ( INSET , intermediate [ i ] ) ;
codeword_count + + ;
i + + ;
}
} else {
codewords [ codeword_count ] = posn ( INSET , intermediate [ i ] ) ;
codeword_count + + ;
i + + ;
}
} while ( i < h ) ;
switch ( codewords [ 0 ] ) {
2016-02-29 22:42:32 +03:00
/* Set starting mode value */
2016-02-20 12:38:03 +03:00
case 48 : M = 2 ;
break ;
case 43 : M = 4 ;
break ;
case 44 : M = 5 ;
break ;
default : M = 0 ;
break ;
}
if ( M ! = 0 ) {
2016-05-22 23:52:29 +03:00
codeword_count - - ;
2016-02-20 12:38:03 +03:00
for ( i = 0 ; i < codeword_count ; i + + ) {
codewords [ i ] = codewords [ i + 1 ] ;
}
}
if ( codeword_count > 49 ) {
2017-07-27 18:01:53 +03:00
strcpy ( symbol - > errtxt , " 432: Input too long " ) ;
2016-02-20 12:38:03 +03:00
return ZINT_ERROR_TOO_LONG ;
}
/* Place codewords in code character array (c grid) */
rows = 0 ;
do {
for ( i = 0 ; i < 7 ; i + + ) {
if ( ( ( rows * 7 ) + i ) < codeword_count ) {
c_grid [ rows ] [ i ] = codewords [ ( rows * 7 ) + i ] ;
} else {
c_grid [ rows ] [ i ] = 48 ; /* Pad */
pad_count + + ;
}
}
rows + + ;
} while ( ( rows * 7 ) < codeword_count ) ;
if ( ( ( ( rows < = 6 ) & & ( pad_count < 5 ) ) ) | | ( rows > 6 ) | | ( rows = = 1 ) ) {
/* Add a row */
for ( i = 0 ; i < 7 ; i + + ) {
c_grid [ rows ] [ i ] = 48 ; /* Pad */
}
rows + + ;
}
/* Add row count and mode character */
c_grid [ rows - 1 ] [ 6 ] = ( 7 * ( rows - 2 ) ) + M ;
/* Add row check character */
for ( i = 0 ; i < rows - 1 ; i + + ) {
int row_sum = 0 ;
for ( j = 0 ; j < 7 ; j + + ) {
row_sum + = c_grid [ i ] [ j ] ;
}
c_grid [ i ] [ 7 ] = row_sum % 49 ;
}
/* Calculate Symbol Check Characters */
posn_val = 0 ;
x_count = c_grid [ rows - 1 ] [ 6 ] * 20 ;
y_count = c_grid [ rows - 1 ] [ 6 ] * 16 ;
z_count = c_grid [ rows - 1 ] [ 6 ] * 38 ;
for ( i = 0 ; i < rows - 1 ; i + + ) {
for ( j = 0 ; j < 4 ; j + + ) {
local_value = ( c_grid [ i ] [ 2 * j ] * 49 ) + c_grid [ i ] [ ( 2 * j ) + 1 ] ;
x_count + = c49_x_weight [ posn_val ] * local_value ;
y_count + = c49_y_weight [ posn_val ] * local_value ;
z_count + = c49_z_weight [ posn_val ] * local_value ;
posn_val + + ;
}
}
if ( rows > 6 ) {
/* Add Z Symbol Check */
c_grid [ rows - 1 ] [ 0 ] = ( z_count % 2401 ) / 49 ;
c_grid [ rows - 1 ] [ 1 ] = ( z_count % 2401 ) % 49 ;
}
local_value = ( c_grid [ rows - 1 ] [ 0 ] * 49 ) + c_grid [ rows - 1 ] [ 1 ] ;
x_count + = c49_x_weight [ posn_val ] * local_value ;
y_count + = c49_y_weight [ posn_val ] * local_value ;
posn_val + + ;
/* Add Y Symbol Check */
c_grid [ rows - 1 ] [ 2 ] = ( y_count % 2401 ) / 49 ;
c_grid [ rows - 1 ] [ 3 ] = ( y_count % 2401 ) % 49 ;
local_value = ( c_grid [ rows - 1 ] [ 2 ] * 49 ) + c_grid [ rows - 1 ] [ 3 ] ;
x_count + = c49_x_weight [ posn_val ] * local_value ;
/* Add X Symbol Check */
c_grid [ rows - 1 ] [ 4 ] = ( x_count % 2401 ) / 49 ;
c_grid [ rows - 1 ] [ 5 ] = ( x_count % 2401 ) % 49 ;
/* Add last row check character */
j = 0 ;
for ( i = 0 ; i < 7 ; i + + ) {
j + = c_grid [ rows - 1 ] [ i ] ;
}
c_grid [ rows - 1 ] [ 7 ] = j % 49 ;
/* Transfer data to symbol character array (w grid) */
for ( i = 0 ; i < rows ; i + + ) {
for ( j = 0 ; j < 4 ; j + + ) {
w_grid [ i ] [ j ] = ( c_grid [ i ] [ 2 * j ] * 49 ) + c_grid [ i ] [ ( 2 * j ) + 1 ] ;
}
}
for ( i = 0 ; i < rows ; i + + ) {
2017-06-10 12:45:42 +03:00
strcpy ( pattern , " 10 " ) ; /* Start character */
2016-02-20 12:38:03 +03:00
for ( j = 0 ; j < 4 ; j + + ) {
if ( i ! = ( rows - 1 ) ) {
if ( c49_table4 [ i ] [ j ] = = ' E ' ) {
/* Even Parity */
2017-06-10 12:45:42 +03:00
bin_append ( c49_even_bitpattern [ w_grid [ i ] [ j ] ] , 16 , pattern ) ;
2016-02-20 12:38:03 +03:00
} else {
/* Odd Parity */
2017-06-10 12:45:42 +03:00
bin_append ( c49_odd_bitpattern [ w_grid [ i ] [ j ] ] , 16 , pattern ) ;
2016-02-20 12:38:03 +03:00
}
} else {
/* Last row uses all even parity */
2017-06-10 12:45:42 +03:00
bin_append ( c49_even_bitpattern [ w_grid [ i ] [ j ] ] , 16 , pattern ) ;
2016-02-20 12:38:03 +03:00
}
}
2017-06-10 12:45:42 +03:00
strcat ( pattern , " 1111 " ) ; /* Stop character */
2016-02-20 12:38:03 +03:00
/* Expand into symbol */
symbol - > row_height [ i ] = 10 ;
2017-10-23 22:37:52 +03:00
2017-06-10 12:45:42 +03:00
for ( j = 0 ; j < strlen ( pattern ) ; j + + ) {
if ( pattern [ j ] = = ' 1 ' ) {
set_module ( symbol , i , j ) ;
}
}
2016-02-20 12:38:03 +03:00
}
2017-06-10 12:45:42 +03:00
symbol - > rows = rows ;
symbol - > width = strlen ( pattern ) ;
2016-02-20 12:38:03 +03:00
symbol - > whitespace_width = 10 ;
2016-08-26 17:13:40 +03:00
if ( ! ( symbol - > output_options & BARCODE_BIND ) ) {
symbol - > output_options + = BARCODE_BIND ;
}
2016-02-20 12:38:03 +03:00
symbol - > border_width = 2 ;
return 0 ;
2016-05-22 23:52:29 +03:00
}
2017-10-23 22:37:52 +03:00