2008-07-14 09:15:55 +12:00
|
|
|
/* rss.c - Handles Reduced Space Symbology (GS1 DataBar) */
|
|
|
|
|
|
|
|
/*
|
|
|
|
libzint - the open source barcode library
|
2020-03-29 11:50:55 +13:00
|
|
|
Copyright (C) 2008-2020 Robin Stuart <rstuart114@gmail.com>
|
2008-07-14 09:15:55 +12:00
|
|
|
|
2013-05-17 05:26:38 +12:00
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
|
|
modification, are permitted provided that the following conditions
|
|
|
|
are met:
|
2008-07-14 09:15:55 +12:00
|
|
|
|
2017-10-24 08:37:52 +13:00
|
|
|
1. Redistributions of source code must retain the above copyright
|
|
|
|
notice, this list of conditions and the following disclaimer.
|
2013-05-17 05:26:38 +12:00
|
|
|
2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
notice, this list of conditions and the following disclaimer in the
|
2017-10-24 08:37:52 +13:00
|
|
|
documentation and/or other materials provided with the distribution.
|
2013-05-17 05:26:38 +12: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
|
2017-10-24 08:37:52 +13:00
|
|
|
without specific prior written permission.
|
2008-07-14 09:15:55 +12:00
|
|
|
|
2013-05-17 05:26:38 +12: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
|
2017-10-24 08:37:52 +13:00
|
|
|
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
2013-05-17 05:26:38 +12:00
|
|
|
SUCH DAMAGE.
|
2016-02-21 00:29:19 +13:00
|
|
|
*/
|
2019-10-17 22:06:21 +13:00
|
|
|
/* vim: set ts=4 sw=4 et : */
|
2008-07-14 09:15:55 +12:00
|
|
|
|
|
|
|
/* The functions "combins" and "getRSSwidths" are copyright BSI and are
|
|
|
|
released with permission under the following terms:
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2008-07-14 09:15:55 +12:00
|
|
|
"Copyright subsists in all BSI publications. BSI also holds the copyright, in the
|
|
|
|
UK, of the international standardisation bodies. Except as
|
|
|
|
permitted under the Copyright, Designs and Patents Act 1988 no extract may be
|
|
|
|
reproduced, stored in a retrieval system or transmitted in any form or by any
|
|
|
|
means - electronic, photocopying, recording or otherwise - without prior written
|
|
|
|
permission from BSI.
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2008-07-14 09:15:55 +12:00
|
|
|
"This does not preclude the free use, in the course of implementing the standard,
|
|
|
|
of necessary details such as symbols, and size, type or grade designations. If these
|
|
|
|
details are to be used for any other purpose than implementation then the prior
|
|
|
|
written permission of BSI must be obtained."
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2008-07-14 09:15:55 +12:00
|
|
|
The date of publication for these functions is 30 November 2006
|
2016-02-21 00:29:19 +13:00
|
|
|
*/
|
2010-05-23 19:18:15 +12:00
|
|
|
|
|
|
|
/* Includes numerous bugfixes thanks to Pablo Orduña @ the PIRAmIDE project */
|
2016-02-18 02:01:56 +13:00
|
|
|
|
|
|
|
/* Note: This code reflects the symbol names as used in ISO/IEC 24724:2006. These names
|
|
|
|
* were updated in ISO/IEC 24724:2011 as follows:
|
2017-10-24 08:37:52 +13:00
|
|
|
*
|
2016-02-18 02:01:56 +13:00
|
|
|
* RSS-14 > GS1 DataBar Omnidirectional
|
|
|
|
* RSS-14 Truncated > GS1 DataBar Truncated
|
|
|
|
* RSS-14 Stacked > GS1 DataBar Stacked
|
|
|
|
* RSS-14 Stacked Omnidirectional > GS1 DataBar Stacked Omnidirectional
|
|
|
|
* RSS Limited > GS1 DataBar Limited
|
|
|
|
* RSS Expanded > GS1 DataBar Expanded Omnidirectional
|
|
|
|
* RSS Expanded Stacked > GS1 DataBar Expanded Stacked Omnidirectional
|
|
|
|
*/
|
2016-02-21 00:29:19 +13:00
|
|
|
|
2008-07-14 09:15:55 +12:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <stdlib.h>
|
2009-06-03 08:23:38 +12:00
|
|
|
#ifdef _MSC_VER
|
2017-10-24 08:37:52 +13:00
|
|
|
#include <malloc.h>
|
2009-06-03 08:23:38 +12:00
|
|
|
#endif
|
2008-07-14 09:15:55 +12:00
|
|
|
#include "common.h"
|
|
|
|
#include "large.h"
|
|
|
|
#include "rss.h"
|
2009-01-08 21:43:25 +13:00
|
|
|
#include "gs1.h"
|
2019-10-31 15:01:42 +13:00
|
|
|
#include "general_field.h"
|
2008-07-14 09:15:55 +12:00
|
|
|
|
|
|
|
/**********************************************************************
|
2016-02-21 00:29:19 +13:00
|
|
|
* combins(n,r): returns the number of Combinations of r selected from n:
|
|
|
|
* Combinations = n! / ((n - r)! * r!)
|
|
|
|
**********************************************************************/
|
2019-12-19 13:37:55 +13:00
|
|
|
static int combins(int n, int r) {
|
2016-02-21 00:29:19 +13:00
|
|
|
int i, j;
|
|
|
|
int maxDenom, minDenom;
|
|
|
|
int val;
|
|
|
|
|
|
|
|
if (n - r > r) {
|
|
|
|
minDenom = r;
|
|
|
|
maxDenom = n - r;
|
|
|
|
} else {
|
|
|
|
minDenom = n - r;
|
|
|
|
maxDenom = r;
|
|
|
|
}
|
|
|
|
val = 1;
|
|
|
|
j = 1;
|
|
|
|
for (i = n; i > maxDenom; i--) {
|
|
|
|
val *= i;
|
|
|
|
if (j <= minDenom) {
|
|
|
|
val /= j;
|
|
|
|
j++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for (; j <= minDenom; j++) {
|
|
|
|
val /= j;
|
|
|
|
}
|
|
|
|
return (val);
|
2008-07-14 09:15:55 +12:00
|
|
|
}
|
|
|
|
|
|
|
|
/**********************************************************************
|
2016-02-21 00:29:19 +13:00
|
|
|
* getRSSwidths
|
|
|
|
* routine to generate widths for RSS elements for a given value.#
|
|
|
|
*
|
|
|
|
* Calling arguments:
|
|
|
|
* val = required value
|
|
|
|
* n = number of modules
|
|
|
|
* elements = elements in a set (RSS-14 & Expanded = 4; RSS Limited = 7)
|
|
|
|
* maxWidth = maximum module width of an element
|
|
|
|
* noNarrow = 0 will skip patterns without a one module wide element
|
|
|
|
*
|
|
|
|
* Return:
|
|
|
|
* static int widths[] = element widths
|
|
|
|
**********************************************************************/
|
2019-12-19 13:37:55 +13:00
|
|
|
static void getRSSwidths(int val, int n, int elements, int maxWidth, int noNarrow) {
|
2016-02-21 00:29:19 +13:00
|
|
|
int bar;
|
|
|
|
int elmWidth;
|
|
|
|
int mxwElement;
|
|
|
|
int subVal, lessVal;
|
|
|
|
int narrowMask = 0;
|
|
|
|
for (bar = 0; bar < elements - 1; bar++) {
|
|
|
|
for (elmWidth = 1, narrowMask |= (1 << bar);
|
|
|
|
;
|
|
|
|
elmWidth++, narrowMask &= ~(1 << bar)) {
|
|
|
|
/* get all combinations */
|
|
|
|
subVal = combins(n - elmWidth - 1, elements - bar - 2);
|
|
|
|
/* less combinations with no single-module element */
|
|
|
|
if ((!noNarrow) && (!narrowMask) &&
|
|
|
|
(n - elmWidth - (elements - bar - 1) >= elements - bar - 1)) {
|
|
|
|
subVal -= combins(n - elmWidth - (elements - bar), elements - bar - 2);
|
|
|
|
}
|
|
|
|
/* less combinations with elements > maxVal */
|
|
|
|
if (elements - bar - 1 > 1) {
|
|
|
|
lessVal = 0;
|
|
|
|
for (mxwElement = n - elmWidth - (elements - bar - 2);
|
|
|
|
mxwElement > maxWidth;
|
|
|
|
mxwElement--) {
|
|
|
|
lessVal += combins(n - elmWidth - mxwElement - 1, elements - bar - 3);
|
|
|
|
}
|
|
|
|
subVal -= lessVal * (elements - 1 - bar);
|
|
|
|
} else if (n - elmWidth > maxWidth) {
|
|
|
|
subVal--;
|
|
|
|
}
|
|
|
|
val -= subVal;
|
|
|
|
if (val < 0) break;
|
|
|
|
}
|
|
|
|
val += subVal;
|
|
|
|
n -= elmWidth;
|
|
|
|
widths[bar] = elmWidth;
|
|
|
|
}
|
|
|
|
widths[bar] = n;
|
|
|
|
return;
|
2008-07-14 09:15:55 +12:00
|
|
|
}
|
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
/* GS1 DataBar-14 */
|
2019-12-19 13:37:55 +13:00
|
|
|
INTERNAL int rss14(struct zint_symbol *symbol, unsigned char source[], int src_len) {
|
2016-02-21 00:29:19 +13:00
|
|
|
int error_number = 0, i, j, mask;
|
|
|
|
short int accum[112], left_reg[112], right_reg[112], x_reg[112], y_reg[112];
|
|
|
|
int data_character[4], data_group[4], v_odd[4], v_even[4];
|
|
|
|
int data_widths[8][4], checksum, c_left, c_right, total_widths[46], writer;
|
2017-09-11 03:03:09 +12:00
|
|
|
char latch, temp[32];
|
|
|
|
int separator_row;
|
2008-07-14 09:15:55 +12:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
separator_row = 0;
|
2008-07-14 09:15:55 +12:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
if (src_len > 13) {
|
2017-07-28 03:01:53 +12:00
|
|
|
strcpy(symbol->errtxt, "380: Input too long");
|
2016-02-21 00:29:19 +13:00
|
|
|
return ZINT_ERROR_TOO_LONG;
|
|
|
|
}
|
|
|
|
error_number = is_sane(NEON, source, src_len);
|
|
|
|
if (error_number == ZINT_ERROR_INVALID_DATA) {
|
2017-07-28 03:01:53 +12:00
|
|
|
strcpy(symbol->errtxt, "381: Invalid characters in data");
|
2016-02-21 00:29:19 +13:00
|
|
|
return error_number;
|
|
|
|
}
|
2008-07-14 09:15:55 +12:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
/* make some room for a separator row for composite symbols */
|
|
|
|
switch (symbol->symbology) {
|
|
|
|
case BARCODE_RSS14_CC:
|
|
|
|
case BARCODE_RSS14STACK_CC:
|
|
|
|
case BARCODE_RSS14_OMNI_CC:
|
|
|
|
separator_row = symbol->rows;
|
|
|
|
symbol->row_height[separator_row] = 1;
|
|
|
|
symbol->rows += 1;
|
|
|
|
break;
|
|
|
|
}
|
2008-07-14 09:15:55 +12:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
for (i = 0; i < 112; i++) {
|
|
|
|
accum[i] = 0;
|
|
|
|
x_reg[i] = 0;
|
|
|
|
y_reg[i] = 0;
|
|
|
|
}
|
2008-07-14 09:15:55 +12:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
for (i = 0; i < 4; i++) {
|
|
|
|
data_character[i] = 0;
|
|
|
|
data_group[i] = 0;
|
|
|
|
}
|
2008-07-14 09:15:55 +12:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
binary_load(accum, (char*) source, src_len);
|
|
|
|
strcpy(temp, "10000000000000");
|
|
|
|
if (symbol->option_1 == 2) {
|
|
|
|
/* Add symbol linkage flag */
|
|
|
|
binary_load(y_reg, temp, strlen(temp));
|
|
|
|
binary_add(accum, y_reg);
|
|
|
|
for (i = 0; i < 112; i++) {
|
|
|
|
y_reg[i] = 0;
|
|
|
|
}
|
|
|
|
}
|
2008-07-14 09:15:55 +12:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
/* Calculate left and right pair values */
|
|
|
|
strcpy(temp, "4537077");
|
|
|
|
binary_load(x_reg, temp, strlen(temp));
|
|
|
|
|
|
|
|
for (i = 0; i < 24; i++) {
|
|
|
|
shiftup(x_reg);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 24; i >= 0; i--) {
|
2019-09-02 07:23:15 +12:00
|
|
|
y_reg[i] = !islarger(x_reg, accum);
|
2016-02-21 00:29:19 +13:00
|
|
|
if (y_reg[i] == 1) {
|
|
|
|
binary_subtract(accum, x_reg);
|
|
|
|
}
|
|
|
|
shiftdown(x_reg);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < 112; i++) {
|
|
|
|
left_reg[i] = y_reg[i];
|
|
|
|
right_reg[i] = accum[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Calculate four data characters */
|
|
|
|
strcpy(temp, "1597");
|
|
|
|
binary_load(x_reg, temp, strlen(temp));
|
|
|
|
for (i = 0; i < 112; i++) {
|
|
|
|
accum[i] = left_reg[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < 24; i++) {
|
|
|
|
shiftup(x_reg);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 24; i >= 0; i--) {
|
2019-09-02 07:23:15 +12:00
|
|
|
y_reg[i] = !islarger(x_reg, accum);
|
2016-02-21 00:29:19 +13:00
|
|
|
if (y_reg[i] == 1) {
|
|
|
|
binary_subtract(accum, x_reg);
|
|
|
|
}
|
|
|
|
shiftdown(x_reg);
|
|
|
|
}
|
|
|
|
|
|
|
|
data_character[0] = 0;
|
|
|
|
data_character[1] = 0;
|
|
|
|
mask = 0x2000;
|
|
|
|
for (i = 13; i >= 0; i--) {
|
|
|
|
if (y_reg[i] == 1) {
|
|
|
|
data_character[0] += mask;
|
|
|
|
}
|
|
|
|
if (accum[i] == 1) {
|
|
|
|
data_character[1] += mask;
|
|
|
|
}
|
|
|
|
mask = mask >> 1;
|
|
|
|
}
|
|
|
|
strcpy(temp, "1597");
|
|
|
|
binary_load(x_reg, temp, strlen(temp));
|
|
|
|
for (i = 0; i < 112; i++) {
|
|
|
|
accum[i] = right_reg[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < 24; i++) {
|
|
|
|
shiftup(x_reg);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 24; i >= 0; i--) {
|
2019-09-02 07:23:15 +12:00
|
|
|
y_reg[i] = !islarger(x_reg, accum);
|
2016-02-21 00:29:19 +13:00
|
|
|
if (y_reg[i] == 1) {
|
|
|
|
binary_subtract(accum, x_reg);
|
|
|
|
}
|
|
|
|
shiftdown(x_reg);
|
|
|
|
}
|
|
|
|
|
|
|
|
data_character[2] = 0;
|
|
|
|
data_character[3] = 0;
|
|
|
|
mask = 0x2000;
|
|
|
|
for (i = 13; i >= 0; i--) {
|
|
|
|
if (y_reg[i] == 1) {
|
|
|
|
data_character[2] += mask;
|
|
|
|
}
|
|
|
|
if (accum[i] == 1) {
|
|
|
|
data_character[3] += mask;
|
|
|
|
}
|
|
|
|
mask = mask >> 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Calculate odd and even subset values */
|
|
|
|
|
|
|
|
if ((data_character[0] >= 0) && (data_character[0] <= 160)) {
|
|
|
|
data_group[0] = 0;
|
|
|
|
}
|
|
|
|
if ((data_character[0] >= 161) && (data_character[0] <= 960)) {
|
|
|
|
data_group[0] = 1;
|
|
|
|
}
|
|
|
|
if ((data_character[0] >= 961) && (data_character[0] <= 2014)) {
|
|
|
|
data_group[0] = 2;
|
|
|
|
}
|
|
|
|
if ((data_character[0] >= 2015) && (data_character[0] <= 2714)) {
|
|
|
|
data_group[0] = 3;
|
|
|
|
}
|
|
|
|
if ((data_character[0] >= 2715) && (data_character[0] <= 2840)) {
|
|
|
|
data_group[0] = 4;
|
|
|
|
}
|
|
|
|
if ((data_character[1] >= 0) && (data_character[1] <= 335)) {
|
|
|
|
data_group[1] = 5;
|
|
|
|
}
|
|
|
|
if ((data_character[1] >= 336) && (data_character[1] <= 1035)) {
|
|
|
|
data_group[1] = 6;
|
|
|
|
}
|
|
|
|
if ((data_character[1] >= 1036) && (data_character[1] <= 1515)) {
|
|
|
|
data_group[1] = 7;
|
|
|
|
}
|
|
|
|
if ((data_character[1] >= 1516) && (data_character[1] <= 1596)) {
|
|
|
|
data_group[1] = 8;
|
|
|
|
}
|
|
|
|
if ((data_character[3] >= 0) && (data_character[3] <= 335)) {
|
|
|
|
data_group[3] = 5;
|
|
|
|
}
|
|
|
|
if ((data_character[3] >= 336) && (data_character[3] <= 1035)) {
|
|
|
|
data_group[3] = 6;
|
|
|
|
}
|
|
|
|
if ((data_character[3] >= 1036) && (data_character[3] <= 1515)) {
|
|
|
|
data_group[3] = 7;
|
|
|
|
}
|
|
|
|
if ((data_character[3] >= 1516) && (data_character[3] <= 1596)) {
|
|
|
|
data_group[3] = 8;
|
|
|
|
}
|
|
|
|
if ((data_character[2] >= 0) && (data_character[2] <= 160)) {
|
|
|
|
data_group[2] = 0;
|
|
|
|
}
|
|
|
|
if ((data_character[2] >= 161) && (data_character[2] <= 960)) {
|
|
|
|
data_group[2] = 1;
|
|
|
|
}
|
|
|
|
if ((data_character[2] >= 961) && (data_character[2] <= 2014)) {
|
|
|
|
data_group[2] = 2;
|
|
|
|
}
|
|
|
|
if ((data_character[2] >= 2015) && (data_character[2] <= 2714)) {
|
|
|
|
data_group[2] = 3;
|
|
|
|
}
|
|
|
|
if ((data_character[2] >= 2715) && (data_character[2] <= 2840)) {
|
|
|
|
data_group[2] = 4;
|
|
|
|
}
|
|
|
|
|
|
|
|
v_odd[0] = (data_character[0] - g_sum_table[data_group[0]]) / t_table[data_group[0]];
|
|
|
|
v_even[0] = (data_character[0] - g_sum_table[data_group[0]]) % t_table[data_group[0]];
|
|
|
|
v_odd[1] = (data_character[1] - g_sum_table[data_group[1]]) % t_table[data_group[1]];
|
|
|
|
v_even[1] = (data_character[1] - g_sum_table[data_group[1]]) / t_table[data_group[1]];
|
|
|
|
v_odd[3] = (data_character[3] - g_sum_table[data_group[3]]) % t_table[data_group[3]];
|
|
|
|
v_even[3] = (data_character[3] - g_sum_table[data_group[3]]) / t_table[data_group[3]];
|
|
|
|
v_odd[2] = (data_character[2] - g_sum_table[data_group[2]]) / t_table[data_group[2]];
|
|
|
|
v_even[2] = (data_character[2] - g_sum_table[data_group[2]]) % t_table[data_group[2]];
|
|
|
|
|
|
|
|
|
|
|
|
/* Use RSS subset width algorithm */
|
|
|
|
for (i = 0; i < 4; i++) {
|
|
|
|
if ((i == 0) || (i == 2)) {
|
|
|
|
getRSSwidths(v_odd[i], modules_odd[data_group[i]], 4, widest_odd[data_group[i]], 1);
|
|
|
|
data_widths[0][i] = widths[0];
|
|
|
|
data_widths[2][i] = widths[1];
|
|
|
|
data_widths[4][i] = widths[2];
|
|
|
|
data_widths[6][i] = widths[3];
|
|
|
|
getRSSwidths(v_even[i], modules_even[data_group[i]], 4, widest_even[data_group[i]], 0);
|
|
|
|
data_widths[1][i] = widths[0];
|
|
|
|
data_widths[3][i] = widths[1];
|
|
|
|
data_widths[5][i] = widths[2];
|
|
|
|
data_widths[7][i] = widths[3];
|
|
|
|
} else {
|
|
|
|
getRSSwidths(v_odd[i], modules_odd[data_group[i]], 4, widest_odd[data_group[i]], 0);
|
|
|
|
data_widths[0][i] = widths[0];
|
|
|
|
data_widths[2][i] = widths[1];
|
|
|
|
data_widths[4][i] = widths[2];
|
|
|
|
data_widths[6][i] = widths[3];
|
|
|
|
getRSSwidths(v_even[i], modules_even[data_group[i]], 4, widest_even[data_group[i]], 1);
|
|
|
|
data_widths[1][i] = widths[0];
|
|
|
|
data_widths[3][i] = widths[1];
|
|
|
|
data_widths[5][i] = widths[2];
|
|
|
|
data_widths[7][i] = widths[3];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
checksum = 0;
|
|
|
|
/* Calculate the checksum */
|
|
|
|
for (i = 0; i < 8; i++) {
|
|
|
|
checksum += checksum_weight[i] * data_widths[i][0];
|
|
|
|
checksum += checksum_weight[i + 8] * data_widths[i][1];
|
|
|
|
checksum += checksum_weight[i + 16] * data_widths[i][2];
|
|
|
|
checksum += checksum_weight[i + 24] * data_widths[i][3];
|
|
|
|
}
|
|
|
|
checksum %= 79;
|
|
|
|
|
|
|
|
/* Calculate the two check characters */
|
|
|
|
if (checksum >= 8) {
|
|
|
|
checksum++;
|
|
|
|
}
|
|
|
|
if (checksum >= 72) {
|
|
|
|
checksum++;
|
|
|
|
}
|
|
|
|
c_left = checksum / 9;
|
|
|
|
c_right = checksum % 9;
|
|
|
|
|
|
|
|
/* Put element widths together */
|
|
|
|
total_widths[0] = 1;
|
|
|
|
total_widths[1] = 1;
|
|
|
|
total_widths[44] = 1;
|
|
|
|
total_widths[45] = 1;
|
|
|
|
for (i = 0; i < 8; i++) {
|
|
|
|
total_widths[i + 2] = data_widths[i][0];
|
|
|
|
total_widths[i + 15] = data_widths[7 - i][1];
|
|
|
|
total_widths[i + 23] = data_widths[i][3];
|
|
|
|
total_widths[i + 36] = data_widths[7 - i][2];
|
|
|
|
}
|
|
|
|
for (i = 0; i < 5; i++) {
|
|
|
|
total_widths[i + 10] = finder_pattern[i + (5 * c_left)];
|
|
|
|
total_widths[i + 31] = finder_pattern[(4 - i) + (5 * c_right)];
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Put this data into the symbol */
|
|
|
|
if ((symbol->symbology == BARCODE_RSS14) || (symbol->symbology == BARCODE_RSS14_CC)) {
|
2017-10-24 08:34:31 +13:00
|
|
|
int count;
|
|
|
|
int check_digit;
|
|
|
|
char hrt[15];
|
2016-02-21 00:29:19 +13:00
|
|
|
writer = 0;
|
|
|
|
latch = '0';
|
|
|
|
for (i = 0; i < 46; i++) {
|
|
|
|
for (j = 0; j < total_widths[i]; j++) {
|
|
|
|
if (latch == '1') {
|
|
|
|
set_module(symbol, symbol->rows, writer);
|
|
|
|
}
|
|
|
|
writer++;
|
|
|
|
}
|
|
|
|
if (latch == '1') {
|
|
|
|
latch = '0';
|
|
|
|
} else {
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (symbol->width < writer) {
|
|
|
|
symbol->width = writer;
|
|
|
|
}
|
|
|
|
if (symbol->symbology == BARCODE_RSS14_CC) {
|
|
|
|
/* separator pattern for composite symbol */
|
|
|
|
for (i = 4; i < 92; i++) {
|
|
|
|
if (!(module_is_set(symbol, separator_row + 1, i))) {
|
|
|
|
set_module(symbol, separator_row, i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
latch = '1';
|
|
|
|
for (i = 16; i < 32; i++) {
|
|
|
|
if (!(module_is_set(symbol, separator_row + 1, i))) {
|
|
|
|
if (latch == '1') {
|
|
|
|
set_module(symbol, separator_row, i);
|
|
|
|
latch = '0';
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, separator_row, i);
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, separator_row, i);
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
latch = '1';
|
|
|
|
for (i = 63; i < 78; i++) {
|
|
|
|
if (!(module_is_set(symbol, separator_row + 1, i))) {
|
|
|
|
if (latch == '1') {
|
|
|
|
set_module(symbol, separator_row, i);
|
|
|
|
latch = '0';
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, separator_row, i);
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, separator_row, i);
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
symbol->rows = symbol->rows + 1;
|
|
|
|
|
2017-10-17 06:26:54 +13:00
|
|
|
count = 0;
|
|
|
|
check_digit = 0;
|
2016-02-21 00:29:19 +13:00
|
|
|
|
|
|
|
/* Calculate check digit from Annex A and place human readable text */
|
|
|
|
ustrcpy(symbol->text, (unsigned char*) "(01)");
|
|
|
|
for (i = 0; i < 14; i++) {
|
|
|
|
hrt[i] = '0';
|
|
|
|
}
|
|
|
|
for (i = 0; i < src_len; i++) {
|
|
|
|
hrt[12 - i] = source[src_len - i - 1];
|
|
|
|
}
|
|
|
|
hrt[14] = '\0';
|
|
|
|
|
|
|
|
for (i = 0; i < 13; i++) {
|
|
|
|
count += ctoi(hrt[i]);
|
|
|
|
|
|
|
|
if (!(i & 1)) {
|
|
|
|
count += 2 * (ctoi(hrt[i]));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
check_digit = 10 - (count % 10);
|
|
|
|
if (check_digit == 10) {
|
|
|
|
check_digit = 0;
|
|
|
|
}
|
|
|
|
hrt[13] = itoc(check_digit);
|
|
|
|
|
2016-03-03 10:12:38 +13:00
|
|
|
strcat((char*) symbol->text, hrt);
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2016-10-15 06:56:49 +13:00
|
|
|
set_minimum_height(symbol, 14); // Minimum height is 14X for truncated symbol
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
|
|
|
|
|
|
|
if ((symbol->symbology == BARCODE_RSS14STACK) || (symbol->symbology == BARCODE_RSS14STACK_CC)) {
|
|
|
|
/* top row */
|
|
|
|
writer = 0;
|
|
|
|
latch = '0';
|
|
|
|
for (i = 0; i < 23; i++) {
|
|
|
|
for (j = 0; j < total_widths[i]; j++) {
|
|
|
|
if (latch == '1') {
|
|
|
|
set_module(symbol, symbol->rows, writer);
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, symbol->rows, writer);
|
|
|
|
}
|
|
|
|
writer++;
|
|
|
|
}
|
|
|
|
if (latch == '1') {
|
|
|
|
latch = '0';
|
|
|
|
} else {
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set_module(symbol, symbol->rows, writer);
|
|
|
|
unset_module(symbol, symbol->rows, writer + 1);
|
|
|
|
symbol->row_height[symbol->rows] = 5;
|
|
|
|
/* bottom row */
|
|
|
|
symbol->rows = symbol->rows + 2;
|
|
|
|
set_module(symbol, symbol->rows, 0);
|
|
|
|
unset_module(symbol, symbol->rows, 1);
|
|
|
|
writer = 0;
|
|
|
|
latch = '1';
|
|
|
|
for (i = 23; i < 46; i++) {
|
|
|
|
for (j = 0; j < total_widths[i]; j++) {
|
|
|
|
if (latch == '1') {
|
|
|
|
set_module(symbol, symbol->rows, writer + 2);
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, symbol->rows, writer + 2);
|
|
|
|
}
|
|
|
|
writer++;
|
|
|
|
}
|
|
|
|
if (latch == '1') {
|
|
|
|
latch = '0';
|
|
|
|
} else {
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
symbol->row_height[symbol->rows] = 7;
|
|
|
|
/* separator pattern */
|
2020-03-29 05:09:24 +13:00
|
|
|
for (i = 1; i < 46; i++) {
|
2016-02-21 00:29:19 +13:00
|
|
|
if (module_is_set(symbol, symbol->rows - 2, i) == module_is_set(symbol, symbol->rows, i)) {
|
|
|
|
if (!(module_is_set(symbol, symbol->rows - 2, i))) {
|
|
|
|
set_module(symbol, symbol->rows - 1, i);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (!(module_is_set(symbol, symbol->rows - 1, i - 1))) {
|
|
|
|
set_module(symbol, symbol->rows - 1, i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2020-03-29 05:09:24 +13:00
|
|
|
unset_module(symbol, symbol->rows - 1, 1);
|
|
|
|
unset_module(symbol, symbol->rows - 1, 2);
|
|
|
|
unset_module(symbol, symbol->rows - 1, 3);
|
2016-02-21 00:29:19 +13:00
|
|
|
symbol->row_height[symbol->rows - 1] = 1;
|
|
|
|
if (symbol->symbology == BARCODE_RSS14STACK_CC) {
|
|
|
|
/* separator pattern for composite symbol */
|
|
|
|
for (i = 4; i < 46; i++) {
|
|
|
|
if (!(module_is_set(symbol, separator_row + 1, i))) {
|
|
|
|
set_module(symbol, separator_row, i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
latch = '1';
|
|
|
|
for (i = 16; i < 32; i++) {
|
|
|
|
if (!(module_is_set(symbol, separator_row + 1, i))) {
|
|
|
|
if (latch == '1') {
|
|
|
|
set_module(symbol, separator_row, i);
|
|
|
|
latch = '0';
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, separator_row, i);
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, separator_row, i);
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
symbol->rows = symbol->rows + 1;
|
|
|
|
if (symbol->width < 50) {
|
|
|
|
symbol->width = 50;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((symbol->symbology == BARCODE_RSS14STACK_OMNI) || (symbol->symbology == BARCODE_RSS14_OMNI_CC)) {
|
|
|
|
/* top row */
|
|
|
|
writer = 0;
|
|
|
|
latch = '0';
|
|
|
|
for (i = 0; i < 23; i++) {
|
|
|
|
for (j = 0; j < total_widths[i]; j++) {
|
|
|
|
if (latch == '1') {
|
|
|
|
set_module(symbol, symbol->rows, writer);
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, symbol->rows, writer);
|
|
|
|
}
|
|
|
|
writer++;
|
|
|
|
}
|
|
|
|
latch = (latch == '1' ? '0' : '1');
|
|
|
|
}
|
|
|
|
set_module(symbol, symbol->rows, writer);
|
|
|
|
unset_module(symbol, symbol->rows, writer + 1);
|
|
|
|
/* bottom row */
|
|
|
|
symbol->rows = symbol->rows + 4;
|
|
|
|
set_module(symbol, symbol->rows, 0);
|
|
|
|
unset_module(symbol, symbol->rows, 1);
|
|
|
|
writer = 0;
|
|
|
|
latch = '1';
|
|
|
|
for (i = 23; i < 46; i++) {
|
|
|
|
for (j = 0; j < total_widths[i]; j++) {
|
|
|
|
if (latch == '1') {
|
|
|
|
set_module(symbol, symbol->rows, writer + 2);
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, symbol->rows, writer + 2);
|
|
|
|
}
|
|
|
|
writer++;
|
|
|
|
}
|
|
|
|
if (latch == '1') {
|
|
|
|
latch = '0';
|
|
|
|
} else {
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* middle separator */
|
|
|
|
for (i = 5; i < 46; i += 2) {
|
|
|
|
set_module(symbol, symbol->rows - 2, i);
|
|
|
|
}
|
|
|
|
symbol->row_height[symbol->rows - 2] = 1;
|
|
|
|
/* top separator */
|
|
|
|
for (i = 4; i < 46; i++) {
|
|
|
|
if (!(module_is_set(symbol, symbol->rows - 4, i))) {
|
|
|
|
set_module(symbol, symbol->rows - 3, i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
latch = '1';
|
|
|
|
for (i = 17; i < 33; i++) {
|
|
|
|
if (!(module_is_set(symbol, symbol->rows - 4, i))) {
|
|
|
|
if (latch == '1') {
|
|
|
|
set_module(symbol, symbol->rows - 3, i);
|
|
|
|
latch = '0';
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, symbol->rows - 3, i);
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, symbol->rows - 3, i);
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
symbol->row_height[symbol->rows - 3] = 1;
|
|
|
|
/* bottom separator */
|
|
|
|
for (i = 4; i < 46; i++) {
|
|
|
|
if (!(module_is_set(symbol, symbol->rows, i))) {
|
|
|
|
set_module(symbol, symbol->rows - 1, i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
latch = '1';
|
|
|
|
for (i = 16; i < 32; i++) {
|
|
|
|
if (!(module_is_set(symbol, symbol->rows, i))) {
|
|
|
|
if (latch == '1') {
|
|
|
|
set_module(symbol, symbol->rows - 1, i);
|
|
|
|
latch = '0';
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, symbol->rows - 1, i);
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, symbol->rows - 1, i);
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
symbol->row_height[symbol->rows - 1] = 1;
|
|
|
|
if (symbol->width < 50) {
|
|
|
|
symbol->width = 50;
|
|
|
|
}
|
|
|
|
if (symbol->symbology == BARCODE_RSS14_OMNI_CC) {
|
|
|
|
/* separator pattern for composite symbol */
|
|
|
|
for (i = 4; i < 46; i++) {
|
|
|
|
if (!(module_is_set(symbol, separator_row + 1, i))) {
|
|
|
|
set_module(symbol, separator_row, i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
latch = '1';
|
|
|
|
for (i = 16; i < 32; i++) {
|
|
|
|
if (!(module_is_set(symbol, separator_row + 1, i))) {
|
|
|
|
if (latch == '1') {
|
|
|
|
set_module(symbol, separator_row, i);
|
|
|
|
latch = '0';
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, separator_row, i);
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, separator_row, i);
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
symbol->rows = symbol->rows + 1;
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2016-10-15 06:56:49 +13:00
|
|
|
set_minimum_height(symbol, 33);
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return error_number;
|
2008-07-14 09:15:55 +12:00
|
|
|
}
|
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
/* GS1 DataBar Limited */
|
2019-12-19 13:37:55 +13:00
|
|
|
INTERNAL int rsslimited(struct zint_symbol *symbol, unsigned char source[], int src_len) {
|
2016-02-21 00:29:19 +13:00
|
|
|
int error_number = 0, i, mask;
|
|
|
|
short int accum[112], left_reg[112], right_reg[112], x_reg[112], y_reg[112];
|
|
|
|
int left_group, right_group, left_odd, left_even, right_odd, right_even;
|
|
|
|
int left_character, right_character, left_widths[14], right_widths[14];
|
|
|
|
int checksum, check_elements[14], total_widths[46], writer, j, check_digit, count;
|
|
|
|
char latch, hrt[15], temp[32];
|
|
|
|
int separator_row;
|
2008-07-14 09:15:55 +12:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
separator_row = 0;
|
|
|
|
|
|
|
|
if (src_len > 13) {
|
2017-07-28 03:01:53 +12:00
|
|
|
strcpy(symbol->errtxt, "382: Input too long");
|
2016-02-21 00:29:19 +13:00
|
|
|
return ZINT_ERROR_TOO_LONG;
|
|
|
|
}
|
|
|
|
error_number = is_sane(NEON, source, src_len);
|
|
|
|
if (error_number == ZINT_ERROR_INVALID_DATA) {
|
2017-07-28 03:01:53 +12:00
|
|
|
strcpy(symbol->errtxt, "383: Invalid characters in data");
|
2016-02-21 00:29:19 +13:00
|
|
|
return error_number;
|
|
|
|
}
|
|
|
|
if (src_len == 13) {
|
|
|
|
if ((source[0] != '0') && (source[0] != '1')) {
|
2017-07-28 03:01:53 +12:00
|
|
|
strcpy(symbol->errtxt, "384: Input out of range");
|
2016-02-21 00:29:19 +13:00
|
|
|
return ZINT_ERROR_INVALID_DATA;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* make some room for a separator row for composite symbols */
|
|
|
|
if (symbol->symbology == BARCODE_RSS_LTD_CC) {
|
|
|
|
separator_row = symbol->rows;
|
|
|
|
symbol->row_height[separator_row] = 1;
|
|
|
|
symbol->rows += 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < 112; i++) {
|
|
|
|
accum[i] = 0;
|
|
|
|
x_reg[i] = 0;
|
|
|
|
y_reg[i] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
binary_load(accum, (char*) source, src_len);
|
|
|
|
if (symbol->option_1 == 2) {
|
|
|
|
/* Add symbol linkage flag */
|
|
|
|
strcpy(temp, "2015133531096");
|
|
|
|
binary_load(y_reg, temp, strlen(temp));
|
|
|
|
binary_add(accum, y_reg);
|
|
|
|
for (i = 0; i < 112; i++) {
|
|
|
|
y_reg[i] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Calculate left and right pair values */
|
|
|
|
strcpy(temp, "2013571");
|
|
|
|
binary_load(x_reg, temp, strlen(temp));
|
|
|
|
|
|
|
|
for (i = 0; i < 24; i++) {
|
|
|
|
shiftup(x_reg);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 24; i >= 0; i--) {
|
2019-09-02 07:23:15 +12:00
|
|
|
y_reg[i] = !islarger(x_reg, accum);
|
2016-02-21 00:29:19 +13:00
|
|
|
if (y_reg[i] == 1) {
|
|
|
|
binary_subtract(accum, x_reg);
|
|
|
|
}
|
|
|
|
shiftdown(x_reg);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < 112; i++) {
|
|
|
|
left_reg[i] = y_reg[i];
|
|
|
|
right_reg[i] = accum[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
left_group = 0;
|
|
|
|
strcpy(temp, "183063");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
if (islarger(left_reg, accum)) {
|
|
|
|
left_group = 1;
|
|
|
|
}
|
|
|
|
strcpy(temp, "820063");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
if (islarger(left_reg, accum)) {
|
|
|
|
left_group = 2;
|
|
|
|
}
|
|
|
|
strcpy(temp, "1000775");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
if (islarger(left_reg, accum)) {
|
|
|
|
left_group = 3;
|
|
|
|
}
|
|
|
|
strcpy(temp, "1491020");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
if (islarger(left_reg, accum)) {
|
|
|
|
left_group = 4;
|
|
|
|
}
|
|
|
|
strcpy(temp, "1979844");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
if (islarger(left_reg, accum)) {
|
|
|
|
left_group = 5;
|
|
|
|
}
|
|
|
|
strcpy(temp, "1996938");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
if (islarger(left_reg, accum)) {
|
|
|
|
left_group = 6;
|
|
|
|
}
|
|
|
|
right_group = 0;
|
|
|
|
strcpy(temp, "183063");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
if (islarger(right_reg, accum)) {
|
|
|
|
right_group = 1;
|
|
|
|
}
|
|
|
|
strcpy(temp, "820063");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
if (islarger(right_reg, accum)) {
|
|
|
|
right_group = 2;
|
|
|
|
}
|
|
|
|
strcpy(temp, "1000775");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
if (islarger(right_reg, accum)) {
|
|
|
|
right_group = 3;
|
|
|
|
}
|
|
|
|
strcpy(temp, "1491020");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
if (islarger(right_reg, accum)) {
|
|
|
|
right_group = 4;
|
|
|
|
}
|
|
|
|
strcpy(temp, "1979844");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
if (islarger(right_reg, accum)) {
|
|
|
|
right_group = 5;
|
|
|
|
}
|
|
|
|
strcpy(temp, "1996938");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
if (islarger(right_reg, accum)) {
|
|
|
|
right_group = 6;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (left_group) {
|
|
|
|
case 1: strcpy(temp, "183064");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
binary_subtract(left_reg, accum);
|
|
|
|
break;
|
|
|
|
case 2: strcpy(temp, "820064");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
binary_subtract(left_reg, accum);
|
|
|
|
break;
|
|
|
|
case 3: strcpy(temp, "1000776");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
binary_subtract(left_reg, accum);
|
|
|
|
break;
|
|
|
|
case 4: strcpy(temp, "1491021");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
binary_subtract(left_reg, accum);
|
|
|
|
break;
|
|
|
|
case 5: strcpy(temp, "1979845");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
binary_subtract(left_reg, accum);
|
|
|
|
break;
|
|
|
|
case 6: strcpy(temp, "1996939");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
binary_subtract(left_reg, accum);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (right_group) {
|
|
|
|
case 1: strcpy(temp, "183064");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
binary_subtract(right_reg, accum);
|
|
|
|
break;
|
|
|
|
case 2: strcpy(temp, "820064");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
binary_subtract(right_reg, accum);
|
|
|
|
break;
|
|
|
|
case 3: strcpy(temp, "1000776");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
binary_subtract(right_reg, accum);
|
|
|
|
break;
|
|
|
|
case 4: strcpy(temp, "1491021");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
binary_subtract(right_reg, accum);
|
|
|
|
break;
|
|
|
|
case 5: strcpy(temp, "1979845");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
binary_subtract(right_reg, accum);
|
|
|
|
break;
|
|
|
|
case 6: strcpy(temp, "1996939");
|
|
|
|
binary_load(accum, temp, strlen(temp));
|
|
|
|
binary_subtract(right_reg, accum);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
left_character = 0;
|
|
|
|
right_character = 0;
|
|
|
|
mask = 0x800000;
|
|
|
|
for (i = 23; i >= 0; i--) {
|
|
|
|
if (left_reg[i] == 1) {
|
|
|
|
left_character += mask;
|
|
|
|
}
|
|
|
|
if (right_reg[i] == 1) {
|
|
|
|
right_character += mask;
|
|
|
|
}
|
|
|
|
mask = mask >> 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
left_odd = left_character / t_even_ltd[left_group];
|
|
|
|
left_even = left_character % t_even_ltd[left_group];
|
|
|
|
right_odd = right_character / t_even_ltd[right_group];
|
|
|
|
right_even = right_character % t_even_ltd[right_group];
|
|
|
|
|
|
|
|
getRSSwidths(left_odd, modules_odd_ltd[left_group], 7, widest_odd_ltd[left_group], 1);
|
|
|
|
left_widths[0] = widths[0];
|
|
|
|
left_widths[2] = widths[1];
|
|
|
|
left_widths[4] = widths[2];
|
|
|
|
left_widths[6] = widths[3];
|
|
|
|
left_widths[8] = widths[4];
|
|
|
|
left_widths[10] = widths[5];
|
|
|
|
left_widths[12] = widths[6];
|
|
|
|
getRSSwidths(left_even, modules_even_ltd[left_group], 7, widest_even_ltd[left_group], 0);
|
|
|
|
left_widths[1] = widths[0];
|
|
|
|
left_widths[3] = widths[1];
|
|
|
|
left_widths[5] = widths[2];
|
|
|
|
left_widths[7] = widths[3];
|
|
|
|
left_widths[9] = widths[4];
|
|
|
|
left_widths[11] = widths[5];
|
|
|
|
left_widths[13] = widths[6];
|
|
|
|
getRSSwidths(right_odd, modules_odd_ltd[right_group], 7, widest_odd_ltd[right_group], 1);
|
|
|
|
right_widths[0] = widths[0];
|
|
|
|
right_widths[2] = widths[1];
|
|
|
|
right_widths[4] = widths[2];
|
|
|
|
right_widths[6] = widths[3];
|
|
|
|
right_widths[8] = widths[4];
|
|
|
|
right_widths[10] = widths[5];
|
|
|
|
right_widths[12] = widths[6];
|
|
|
|
getRSSwidths(right_even, modules_even_ltd[right_group], 7, widest_even_ltd[right_group], 0);
|
|
|
|
right_widths[1] = widths[0];
|
|
|
|
right_widths[3] = widths[1];
|
|
|
|
right_widths[5] = widths[2];
|
|
|
|
right_widths[7] = widths[3];
|
|
|
|
right_widths[9] = widths[4];
|
|
|
|
right_widths[11] = widths[5];
|
|
|
|
right_widths[13] = widths[6];
|
|
|
|
|
|
|
|
checksum = 0;
|
|
|
|
/* Calculate the checksum */
|
|
|
|
for (i = 0; i < 14; i++) {
|
|
|
|
checksum += checksum_weight_ltd[i] * left_widths[i];
|
|
|
|
checksum += checksum_weight_ltd[i + 14] * right_widths[i];
|
|
|
|
}
|
|
|
|
checksum %= 89;
|
|
|
|
|
|
|
|
for (i = 0; i < 14; i++) {
|
|
|
|
check_elements[i] = finder_pattern_ltd[i + (checksum * 14)];
|
|
|
|
}
|
|
|
|
|
|
|
|
total_widths[0] = 1;
|
|
|
|
total_widths[1] = 1;
|
|
|
|
total_widths[44] = 1;
|
|
|
|
total_widths[45] = 1;
|
|
|
|
for (i = 0; i < 14; i++) {
|
|
|
|
total_widths[i + 2] = left_widths[i];
|
|
|
|
total_widths[i + 16] = check_elements[i];
|
|
|
|
total_widths[i + 30] = right_widths[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
writer = 0;
|
|
|
|
latch = '0';
|
|
|
|
for (i = 0; i < 46; i++) {
|
|
|
|
for (j = 0; j < total_widths[i]; j++) {
|
|
|
|
if (latch == '1') {
|
|
|
|
set_module(symbol, symbol->rows, writer);
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, symbol->rows, writer);
|
|
|
|
}
|
|
|
|
writer++;
|
|
|
|
}
|
|
|
|
latch = (latch == '1' ? '0' : '1');
|
|
|
|
}
|
|
|
|
if (symbol->width < writer) {
|
|
|
|
symbol->width = writer;
|
|
|
|
}
|
|
|
|
symbol->rows = symbol->rows + 1;
|
|
|
|
|
|
|
|
/* add separator pattern if composite symbol */
|
|
|
|
if (symbol->symbology == BARCODE_RSS_LTD_CC) {
|
|
|
|
for (i = 4; i < 70; i++) {
|
|
|
|
if (!(module_is_set(symbol, separator_row + 1, i))) {
|
|
|
|
set_module(symbol, separator_row, i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Calculate check digit from Annex A and place human readable text */
|
|
|
|
|
|
|
|
check_digit = 0;
|
|
|
|
count = 0;
|
|
|
|
|
|
|
|
ustrcpy(symbol->text, (unsigned char*) "(01)");
|
|
|
|
for (i = 0; i < 14; i++) {
|
|
|
|
hrt[i] = '0';
|
|
|
|
}
|
|
|
|
for (i = 0; i < src_len; i++) {
|
|
|
|
hrt[12 - i] = source[src_len - i - 1];
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < 13; i++) {
|
|
|
|
count += ctoi(hrt[i]);
|
|
|
|
|
|
|
|
if (!(i & 1)) {
|
|
|
|
count += 2 * (ctoi(hrt[i]));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
check_digit = 10 - (count % 10);
|
|
|
|
if (check_digit == 10) {
|
|
|
|
check_digit = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
hrt[13] = itoc(check_digit);
|
|
|
|
hrt[14] = '\0';
|
|
|
|
|
2016-03-03 10:12:38 +13:00
|
|
|
strcat((char*) symbol->text, hrt);
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2016-10-15 06:56:49 +13:00
|
|
|
set_minimum_height(symbol, 10);
|
2016-02-21 00:29:19 +13:00
|
|
|
|
|
|
|
return error_number;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Handles all data encodation from section 7.2.5 of ISO/IEC 24724 */
|
2019-12-19 13:37:55 +13:00
|
|
|
static int rss_binary_string(struct zint_symbol *symbol, char source[], char binary_string[]) {
|
2019-10-31 15:01:42 +13:00
|
|
|
int encoding_method, i, j, read_posn, last_digit, debug = symbol->debug, mode = NUMERIC;
|
2016-10-10 02:10:39 +13:00
|
|
|
int symbol_characters, characters_per_row;
|
2009-06-03 08:23:38 +12:00
|
|
|
#ifndef _MSC_VER
|
2019-10-31 15:01:42 +13:00
|
|
|
char general_field[strlen(source) + 1];
|
2009-06-03 08:23:38 +12:00
|
|
|
#else
|
2016-03-01 09:54:20 +13:00
|
|
|
char* general_field = (char*) _alloca(strlen(source) + 1);
|
2009-06-03 08:23:38 +12:00
|
|
|
#endif
|
2017-05-14 19:15:08 +12:00
|
|
|
int remainder, d1, d2;
|
2016-02-21 00:29:19 +13:00
|
|
|
char padstring[40];
|
2008-10-03 21:31:53 +13:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
read_posn = 0;
|
2008-10-03 21:31:53 +13:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
/* Decide whether a compressed data field is required and if so what
|
|
|
|
method to use - method 2 = no compressed data field */
|
|
|
|
|
|
|
|
if ((strlen(source) >= 16) && ((source[0] == '0') && (source[1] == '1'))) {
|
|
|
|
/* (01) and other AIs */
|
|
|
|
encoding_method = 1;
|
|
|
|
if (debug) printf("Choosing Method 1\n");
|
|
|
|
} else {
|
|
|
|
/* any AIs */
|
|
|
|
encoding_method = 2;
|
2018-04-19 07:24:21 +12:00
|
|
|
if (debug) printf("Choosing Method 2\n");
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
|
|
|
|
|
|
|
if (((strlen(source) >= 20) && (encoding_method == 1)) && ((source[2] == '9') && (source[16] == '3'))) {
|
|
|
|
/* Possibly encoding method > 2 */
|
|
|
|
if (debug) printf("Checking for other methods\n");
|
|
|
|
|
|
|
|
if ((strlen(source) >= 26) && (source[17] == '1')) {
|
|
|
|
/* Methods 3, 7, 9, 11 and 13 */
|
|
|
|
|
|
|
|
if (source[18] == '0') {
|
|
|
|
/* (01) and (310x) */
|
|
|
|
char weight_str[7];
|
|
|
|
|
|
|
|
for (i = 0; i < 6; i++) {
|
|
|
|
weight_str[i] = source[20 + i];
|
|
|
|
}
|
|
|
|
weight_str[6] = '\0';
|
|
|
|
|
|
|
|
if (weight_str[0] == '0') { /* Maximum weight = 99999 */
|
|
|
|
|
|
|
|
if ((source[19] == '3') && (strlen(source) == 26)) {
|
|
|
|
/* (01) and (3103) */
|
2017-09-11 03:03:09 +12:00
|
|
|
float weight; /* In kilos */
|
2016-02-21 00:29:19 +13:00
|
|
|
weight = atof(weight_str) / 1000.0;
|
|
|
|
|
|
|
|
if (weight <= 32.767) {
|
|
|
|
encoding_method = 3;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (strlen(source) == 34) {
|
|
|
|
if ((source[26] == '1') && (source[27] == '1')) {
|
|
|
|
/* (01), (310x) and (11) - metric weight and production date */
|
|
|
|
encoding_method = 7;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((source[26] == '1') && (source[27] == '3')) {
|
|
|
|
/* (01), (310x) and (13) - metric weight and packaging date */
|
|
|
|
encoding_method = 9;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((source[26] == '1') && (source[27] == '5')) {
|
|
|
|
/* (01), (310x) and (15) - metric weight and "best before" date */
|
|
|
|
encoding_method = 11;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((source[26] == '1') && (source[27] == '7')) {
|
|
|
|
/* (01), (310x) and (17) - metric weight and expiration date */
|
|
|
|
encoding_method = 13;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (debug) printf("Now using method %d\n", encoding_method);
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((strlen(source) >= 26) && (source[17] == '2')) {
|
|
|
|
/* Methods 4, 8, 10, 12 and 14 */
|
|
|
|
|
|
|
|
if (source[18] == '0') {
|
|
|
|
/* (01) and (320x) */
|
|
|
|
char weight_str[7];
|
|
|
|
|
|
|
|
for (i = 0; i < 6; i++) {
|
|
|
|
weight_str[i] = source[20 + i];
|
|
|
|
}
|
|
|
|
weight_str[6] = '\0';
|
|
|
|
|
|
|
|
if (weight_str[0] == '0') { /* Maximum weight = 99999 */
|
|
|
|
|
|
|
|
if (((source[19] == '2') || (source[19] == '3')) && (strlen(source) == 26)) {
|
|
|
|
/* (01) and (3202)/(3203) */
|
2017-09-11 03:03:09 +12:00
|
|
|
float weight; /* In pounds */
|
2016-02-21 00:29:19 +13:00
|
|
|
|
|
|
|
if (source[19] == '3') {
|
2016-03-03 10:12:38 +13:00
|
|
|
weight = (float) (atof(weight_str) / 1000.0F);
|
2016-02-21 00:29:19 +13:00
|
|
|
if (weight <= 22.767) {
|
|
|
|
encoding_method = 4;
|
|
|
|
}
|
|
|
|
} else {
|
2016-03-03 10:12:38 +13:00
|
|
|
weight = (float) (atof(weight_str) / 100.0F);
|
2016-02-21 00:29:19 +13:00
|
|
|
if (weight <= 99.99) {
|
|
|
|
encoding_method = 4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
if (strlen(source) == 34) {
|
|
|
|
if ((source[26] == '1') && (source[27] == '1')) {
|
|
|
|
/* (01), (320x) and (11) - English weight and production date */
|
|
|
|
encoding_method = 8;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((source[26] == '1') && (source[27] == '3')) {
|
|
|
|
/* (01), (320x) and (13) - English weight and packaging date */
|
|
|
|
encoding_method = 10;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((source[26] == '1') && (source[27] == '5')) {
|
|
|
|
/* (01), (320x) and (15) - English weight and "best before" date */
|
|
|
|
encoding_method = 12;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((source[26] == '1') && (source[27] == '7')) {
|
|
|
|
/* (01), (320x) and (17) - English weight and expiration date */
|
|
|
|
encoding_method = 14;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (debug) printf("Now using method %d\n", encoding_method);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
if (source[17] == '9') {
|
|
|
|
/* Methods 5 and 6 */
|
|
|
|
if ((source[18] == '2') && ((source[19] >= '0') && (source[19] <= '3'))) {
|
|
|
|
/* (01) and (392x) */
|
|
|
|
encoding_method = 5;
|
|
|
|
}
|
|
|
|
if ((source[18] == '3') && ((source[19] >= '0') && (source[19] <= '3'))) {
|
|
|
|
/* (01) and (393x) */
|
|
|
|
encoding_method = 6;
|
|
|
|
}
|
|
|
|
if (debug) printf("Now using method %d\n", encoding_method);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (encoding_method) { /* Encoding method - Table 10 */
|
2016-03-03 10:12:38 +13:00
|
|
|
case 1: strcat(binary_string, "1XX");
|
2016-02-21 00:29:19 +13:00
|
|
|
read_posn = 16;
|
|
|
|
break;
|
2016-03-03 10:12:38 +13:00
|
|
|
case 2: strcat(binary_string, "00XX");
|
2016-02-21 00:29:19 +13:00
|
|
|
read_posn = 0;
|
|
|
|
break;
|
2017-05-14 19:15:08 +12:00
|
|
|
case 3: // 0100
|
|
|
|
case 4: // 0101
|
|
|
|
bin_append(4 + (encoding_method - 3), 4, binary_string);
|
2016-02-21 00:29:19 +13:00
|
|
|
read_posn = strlen(source);
|
|
|
|
break;
|
2016-03-03 10:12:38 +13:00
|
|
|
case 5: strcat(binary_string, "01100XX");
|
2016-02-21 00:29:19 +13:00
|
|
|
read_posn = 20;
|
|
|
|
break;
|
2016-03-03 10:12:38 +13:00
|
|
|
case 6: strcat(binary_string, "01101XX");
|
2016-02-21 00:29:19 +13:00
|
|
|
read_posn = 23;
|
|
|
|
break;
|
2017-05-14 19:15:08 +12:00
|
|
|
default: /* modes 7 to 14 */
|
|
|
|
bin_append(56 + (encoding_method - 7), 7, binary_string);
|
2016-02-21 00:29:19 +13:00
|
|
|
read_posn = strlen(source);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (debug) printf("Setting binary = %s\n", binary_string);
|
|
|
|
|
|
|
|
/* Variable length symbol bit field is just given a place holder (XX)
|
|
|
|
for the time being */
|
|
|
|
|
|
|
|
/* Verify that the data to be placed in the compressed data field is all
|
|
|
|
numeric data before carrying out compression */
|
|
|
|
for (i = 0; i < read_posn; i++) {
|
|
|
|
if ((source[i] < '0') || (source[i] > '9')) {
|
|
|
|
if ((source[i] != '[') && (source[i] != ']')) {
|
|
|
|
/* Something is wrong */
|
2017-07-28 03:01:53 +12:00
|
|
|
strcpy(symbol->errtxt, "385: Invalid characters in input data");
|
2016-02-21 00:29:19 +13:00
|
|
|
return ZINT_ERROR_INVALID_DATA;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Now encode the compressed data field */
|
|
|
|
|
|
|
|
if (debug) printf("Proceeding to encode data\n");
|
|
|
|
if (encoding_method == 1) {
|
|
|
|
/* Encoding method field "1" - general item identification data */
|
|
|
|
char group[4];
|
|
|
|
|
|
|
|
group[0] = source[2];
|
|
|
|
group[1] = '\0';
|
|
|
|
|
2017-05-14 19:15:08 +12:00
|
|
|
bin_append(atoi(group), 4, binary_string);
|
2016-02-21 00:29:19 +13:00
|
|
|
|
|
|
|
for (i = 1; i < 5; i++) {
|
|
|
|
group[0] = source[(i * 3)];
|
|
|
|
group[1] = source[(i * 3) + 1];
|
|
|
|
group[2] = source[(i * 3) + 2];
|
|
|
|
group[3] = '\0';
|
|
|
|
|
2017-05-14 19:15:08 +12:00
|
|
|
bin_append(atoi(group), 10, binary_string);
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-05-14 19:15:08 +12:00
|
|
|
if ((encoding_method == 3) || (encoding_method == 4)) {
|
2016-02-21 00:29:19 +13:00
|
|
|
/* Encoding method field "0100" - variable weight item
|
|
|
|
(0,001 kilogram icrements) */
|
2017-05-14 19:15:08 +12:00
|
|
|
/* Encoding method field "0101" - variable weight item (0,01 or
|
|
|
|
0,001 pound increment) */
|
2016-02-21 00:29:19 +13:00
|
|
|
char group[4];
|
|
|
|
char weight_str[7];
|
|
|
|
|
|
|
|
for (i = 1; i < 5; i++) {
|
|
|
|
group[0] = source[(i * 3)];
|
|
|
|
group[1] = source[(i * 3) + 1];
|
|
|
|
group[2] = source[(i * 3) + 2];
|
|
|
|
group[3] = '\0';
|
|
|
|
|
2017-05-14 19:15:08 +12:00
|
|
|
bin_append(atoi(group), 10, binary_string);
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < 6; i++) {
|
|
|
|
weight_str[i] = source[20 + i];
|
|
|
|
}
|
|
|
|
weight_str[6] = '\0';
|
|
|
|
|
2017-05-14 19:15:08 +12:00
|
|
|
if ((encoding_method == 4) && (source[19] == '3')) {
|
|
|
|
bin_append(atoi(weight_str) + 10000, 15, binary_string);
|
|
|
|
} else {
|
|
|
|
bin_append(atoi(weight_str), 15, binary_string);
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
|
|
|
}
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2017-05-14 19:15:08 +12:00
|
|
|
if ((encoding_method == 5) || (encoding_method == 6)) {
|
|
|
|
/* Encoding method "01100" - variable measure item and price */
|
|
|
|
/* Encoding method "01101" - variable measure item and price with ISO 4217
|
|
|
|
Currency Code */
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
char group[4];
|
|
|
|
|
|
|
|
for (i = 1; i < 5; i++) {
|
|
|
|
group[0] = source[(i * 3)];
|
|
|
|
group[1] = source[(i * 3) + 1];
|
|
|
|
group[2] = source[(i * 3) + 2];
|
|
|
|
group[3] = '\0';
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2017-05-14 19:15:08 +12:00
|
|
|
bin_append(atoi(group), 10, binary_string);
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
|
|
|
|
2017-05-14 19:15:08 +12:00
|
|
|
bin_append(source[19] - '0', 2, binary_string);
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2017-05-14 19:15:08 +12:00
|
|
|
if (encoding_method == 6) {
|
|
|
|
char currency_str[5];
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2017-05-14 19:15:08 +12:00
|
|
|
for (i = 0; i < 3; i++) {
|
|
|
|
currency_str[i] = source[20 + i];
|
|
|
|
}
|
|
|
|
currency_str[3] = '\0';
|
2016-02-21 00:29:19 +13:00
|
|
|
|
2017-05-14 19:15:08 +12:00
|
|
|
bin_append(atoi(currency_str), 10, binary_string);
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((encoding_method >= 7) && (encoding_method <= 14)) {
|
|
|
|
/* Encoding method fields "0111000" through "0111111" - variable
|
|
|
|
weight item plus date */
|
|
|
|
char group[4];
|
|
|
|
int group_val;
|
|
|
|
char weight_str[8];
|
|
|
|
|
|
|
|
for (i = 1; i < 5; i++) {
|
|
|
|
group[0] = source[(i * 3)];
|
|
|
|
group[1] = source[(i * 3) + 1];
|
|
|
|
group[2] = source[(i * 3) + 2];
|
|
|
|
group[3] = '\0';
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2017-05-14 19:15:08 +12:00
|
|
|
bin_append(atoi(group), 10, binary_string);
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
|
|
|
|
|
|
|
weight_str[0] = source[19];
|
|
|
|
|
|
|
|
for (i = 0; i < 5; i++) {
|
|
|
|
weight_str[i + 1] = source[21 + i];
|
|
|
|
}
|
|
|
|
weight_str[6] = '\0';
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2017-05-14 19:15:08 +12:00
|
|
|
bin_append(atoi(weight_str), 20, binary_string);
|
2016-02-21 00:29:19 +13:00
|
|
|
|
|
|
|
if (strlen(source) == 34) {
|
|
|
|
/* Date information is included */
|
2017-09-11 03:03:09 +12:00
|
|
|
char date_str[4];
|
2016-02-21 00:29:19 +13:00
|
|
|
date_str[0] = source[28];
|
|
|
|
date_str[1] = source[29];
|
|
|
|
date_str[2] = '\0';
|
|
|
|
group_val = atoi(date_str) * 384;
|
|
|
|
|
|
|
|
date_str[0] = source[30];
|
|
|
|
date_str[1] = source[31];
|
|
|
|
group_val += (atoi(date_str) - 1) * 32;
|
|
|
|
|
|
|
|
date_str[0] = source[32];
|
|
|
|
date_str[1] = source[33];
|
|
|
|
group_val += atoi(date_str);
|
|
|
|
} else {
|
|
|
|
group_val = 38400;
|
|
|
|
}
|
|
|
|
|
2017-05-14 19:15:08 +12:00
|
|
|
bin_append(group_val, 16, binary_string);
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
|
|
|
|
|
|
|
/* The compressed data field has been processed if appropriate - the
|
|
|
|
rest of the data (if any) goes into a general-purpose data compaction field */
|
|
|
|
|
|
|
|
j = 0;
|
2020-03-29 11:50:55 +13:00
|
|
|
for (i = read_posn; i < (int) strlen(source); i++) {
|
2016-02-21 00:29:19 +13:00
|
|
|
general_field[j] = source[i];
|
|
|
|
j++;
|
|
|
|
}
|
|
|
|
general_field[j] = '\0';
|
|
|
|
if (debug) printf("General field data = %s\n", general_field);
|
|
|
|
|
2019-10-31 15:01:42 +13:00
|
|
|
if (!general_field_encode(general_field, &mode, &last_digit, binary_string)) {
|
2016-02-21 00:29:19 +13:00
|
|
|
/* Invalid characters in input data */
|
2017-07-28 03:01:53 +12:00
|
|
|
strcpy(symbol->errtxt, "386: Invalid characters in input data");
|
2016-02-21 00:29:19 +13:00
|
|
|
return ZINT_ERROR_INVALID_DATA;
|
|
|
|
}
|
|
|
|
if (debug) printf("Resultant binary = %s\n", binary_string);
|
|
|
|
if (debug) printf("\tLength: %d\n", (int) strlen(binary_string));
|
|
|
|
|
|
|
|
remainder = 12 - (strlen(binary_string) % 12);
|
|
|
|
if (remainder == 12) {
|
|
|
|
remainder = 0;
|
|
|
|
}
|
2016-10-10 02:10:39 +13:00
|
|
|
symbol_characters = ((strlen(binary_string) + remainder) / 12) + 1;
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2016-10-10 02:10:39 +13:00
|
|
|
if ((symbol->symbology == BARCODE_RSS_EXPSTACK) || (symbol->symbology == BARCODE_RSS_EXPSTACK_CC)) {
|
|
|
|
characters_per_row = symbol->option_2 * 2;
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2016-10-10 02:10:39 +13:00
|
|
|
if ((characters_per_row < 2) || (characters_per_row > 20)) {
|
|
|
|
characters_per_row = 4;
|
|
|
|
}
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2016-10-10 02:10:39 +13:00
|
|
|
if ((symbol_characters % characters_per_row) == 1) {
|
|
|
|
symbol_characters++;
|
|
|
|
}
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2019-10-31 15:01:42 +13:00
|
|
|
if (symbol_characters < 4) {
|
|
|
|
symbol_characters = 4;
|
2016-10-10 02:10:39 +13:00
|
|
|
}
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2016-10-10 02:10:39 +13:00
|
|
|
remainder = (12 * (symbol_characters - 1)) - strlen(binary_string);
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2019-10-31 15:01:42 +13:00
|
|
|
if (last_digit) {
|
2016-02-21 00:29:19 +13:00
|
|
|
/* There is still one more numeric digit to encode */
|
|
|
|
if (debug) printf("Adding extra (odd) numeric digit\n");
|
|
|
|
|
2019-10-31 15:31:55 +13:00
|
|
|
if ((remainder >= 4) && (remainder <= 6)) {
|
|
|
|
bin_append(ctoi(last_digit) + 1, 4, binary_string);
|
2016-02-21 00:29:19 +13:00
|
|
|
} else {
|
2019-10-31 15:31:55 +13:00
|
|
|
d1 = ctoi(last_digit);
|
|
|
|
d2 = 10;
|
|
|
|
|
|
|
|
bin_append((11 * d1) + d2 + 8, 7, binary_string);
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
|
|
|
|
|
|
|
remainder = 12 - (strlen(binary_string) % 12);
|
|
|
|
if (remainder == 12) {
|
|
|
|
remainder = 0;
|
|
|
|
}
|
2016-10-10 02:10:39 +13:00
|
|
|
symbol_characters = ((strlen(binary_string) + remainder) / 12) + 1;
|
|
|
|
|
|
|
|
if ((symbol->symbology == BARCODE_RSS_EXPSTACK) || (symbol->symbology == BARCODE_RSS_EXPSTACK_CC)) {
|
|
|
|
characters_per_row = symbol->option_2 * 2;
|
|
|
|
|
|
|
|
if ((characters_per_row < 2) || (characters_per_row > 20)) {
|
|
|
|
characters_per_row = 4;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((symbol_characters % characters_per_row) == 1) {
|
|
|
|
symbol_characters++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-10-31 15:01:42 +13:00
|
|
|
if (symbol_characters < 4) {
|
|
|
|
symbol_characters = 4;
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
2016-10-10 02:10:39 +13:00
|
|
|
|
|
|
|
remainder = (12 * (symbol_characters - 1)) - strlen(binary_string);
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
if (debug) printf("Resultant binary = %s\n", binary_string);
|
|
|
|
if (debug) printf("\tLength: %d\n", (int) strlen(binary_string));
|
|
|
|
}
|
|
|
|
|
2019-11-06 03:16:48 +13:00
|
|
|
if (strlen(binary_string) > 252) { /* 252 = (21 * 12) */
|
2017-07-28 03:01:53 +12:00
|
|
|
strcpy(symbol->errtxt, "387: Input too long");
|
2016-02-21 00:29:19 +13:00
|
|
|
return ZINT_ERROR_TOO_LONG;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Now add padding to binary string (7.2.5.5.4) */
|
|
|
|
i = remainder;
|
2019-10-31 15:01:42 +13:00
|
|
|
if (mode == NUMERIC) {
|
2016-02-21 00:29:19 +13:00
|
|
|
strcpy(padstring, "0000");
|
|
|
|
i -= 4;
|
|
|
|
} else {
|
|
|
|
strcpy(padstring, "");
|
|
|
|
}
|
|
|
|
for (; i > 0; i -= 5) {
|
2016-03-03 10:12:38 +13:00
|
|
|
strcat(padstring, "00100");
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
|
|
|
|
|
|
|
padstring[remainder] = '\0';
|
2016-03-03 10:12:38 +13:00
|
|
|
strcat(binary_string, padstring);
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
/* Patch variable length symbol bit field */
|
2016-10-10 02:10:39 +13:00
|
|
|
d1 = symbol_characters & 1;
|
|
|
|
|
|
|
|
if (symbol_characters <= 14) {
|
2016-02-21 00:29:19 +13:00
|
|
|
d2 = 0;
|
|
|
|
} else {
|
|
|
|
d2 = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (encoding_method == 1) {
|
|
|
|
binary_string[2] = d1 ? '1' : '0';
|
|
|
|
binary_string[3] = d2 ? '1' : '0';
|
|
|
|
}
|
|
|
|
if (encoding_method == 2) {
|
|
|
|
binary_string[3] = d1 ? '1' : '0';
|
|
|
|
binary_string[4] = d2 ? '1' : '0';
|
|
|
|
}
|
|
|
|
if ((encoding_method == 5) || (encoding_method == 6)) {
|
|
|
|
binary_string[6] = d1 ? '1' : '0';
|
|
|
|
binary_string[7] = d2 ? '1' : '0';
|
|
|
|
}
|
|
|
|
if (debug) printf("Resultant binary = %s\n", binary_string);
|
|
|
|
if (debug) printf("\tLength: %d\n", (int) strlen(binary_string));
|
|
|
|
return 0;
|
2008-07-14 09:15:55 +12:00
|
|
|
}
|
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
/* GS1 DataBar Expanded */
|
2019-12-19 13:37:55 +13:00
|
|
|
INTERNAL int rssexpanded(struct zint_symbol *symbol, unsigned char source[], int src_len) {
|
2016-10-15 22:54:23 +13:00
|
|
|
int i, j, k, p, data_chars, vs[21], group[21], v_odd[21], v_even[21];
|
2016-02-21 00:29:19 +13:00
|
|
|
char substring[21][14], latch;
|
|
|
|
int char_widths[21][8], checksum, check_widths[8], c_group;
|
|
|
|
int check_char, c_odd, c_even, elements[235], pattern_width, reader, writer;
|
|
|
|
int separator_row;
|
2019-11-06 03:16:48 +13:00
|
|
|
unsigned int bin_len = 13 * src_len + 200 + 1; /* Allow for 8 bits + 5-bit latch per char + 200 bits overhead/padding */
|
2009-06-03 08:23:38 +12:00
|
|
|
#ifndef _MSC_VER
|
2019-11-06 03:16:48 +13:00
|
|
|
char reduced[src_len + 1], binary_string[bin_len];
|
2009-06-03 08:23:38 +12:00
|
|
|
#else
|
2019-10-17 22:06:21 +13:00
|
|
|
char* reduced = (char*) _alloca(src_len + 1);
|
2019-11-06 03:16:48 +13:00
|
|
|
char* binary_string = (char*) _alloca(bin_len);
|
2009-06-03 08:23:38 +12:00
|
|
|
#endif
|
2008-07-14 09:15:55 +12:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
separator_row = 0;
|
|
|
|
reader = 0;
|
|
|
|
|
2019-10-17 22:06:21 +13:00
|
|
|
i = gs1_verify(symbol, source, src_len, reduced);
|
|
|
|
if (i != 0) {
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
if ((symbol->symbology == BARCODE_RSS_EXP_CC) || (symbol->symbology == BARCODE_RSS_EXPSTACK_CC)) {
|
|
|
|
/* make space for a composite separator pattern */
|
|
|
|
separator_row = symbol->rows;
|
|
|
|
symbol->row_height[separator_row] = 1;
|
|
|
|
symbol->rows += 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
strcpy(binary_string, "");
|
|
|
|
|
|
|
|
if (symbol->option_1 == 2) {
|
2016-03-03 10:12:38 +13:00
|
|
|
strcat(binary_string, "1");
|
2016-02-21 00:29:19 +13:00
|
|
|
} else {
|
2016-03-03 10:12:38 +13:00
|
|
|
strcat(binary_string, "0");
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
|
|
|
|
2019-10-17 22:06:21 +13:00
|
|
|
i = rss_binary_string(symbol, reduced, binary_string);
|
2016-02-21 00:29:19 +13:00
|
|
|
if (i != 0) {
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
data_chars = strlen(binary_string) / 12;
|
|
|
|
|
|
|
|
for (i = 0; i < data_chars; i++) {
|
|
|
|
for (j = 0; j < 12; j++) {
|
|
|
|
substring[i][j] = binary_string[(i * 12) + j];
|
|
|
|
}
|
|
|
|
substring[i][12] = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < data_chars; i++) {
|
|
|
|
vs[i] = 0;
|
2016-02-24 20:42:15 +13:00
|
|
|
for (p = 0; p < 12; p++) {
|
2016-02-21 00:29:19 +13:00
|
|
|
if (substring[i][p] == '1') {
|
|
|
|
vs[i] += (0x800 >> p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < data_chars; i++) {
|
|
|
|
if (vs[i] <= 347) {
|
|
|
|
group[i] = 1;
|
|
|
|
}
|
|
|
|
if ((vs[i] >= 348) && (vs[i] <= 1387)) {
|
|
|
|
group[i] = 2;
|
|
|
|
}
|
|
|
|
if ((vs[i] >= 1388) && (vs[i] <= 2947)) {
|
|
|
|
group[i] = 3;
|
|
|
|
}
|
|
|
|
if ((vs[i] >= 2948) && (vs[i] <= 3987)) {
|
|
|
|
group[i] = 4;
|
|
|
|
}
|
|
|
|
if (vs[i] >= 3988) {
|
|
|
|
group[i] = 5;
|
|
|
|
}
|
|
|
|
v_odd[i] = (vs[i] - g_sum_exp[group[i] - 1]) / t_even_exp[group[i] - 1];
|
|
|
|
v_even[i] = (vs[i] - g_sum_exp[group[i] - 1]) % t_even_exp[group[i] - 1];
|
|
|
|
|
|
|
|
getRSSwidths(v_odd[i], modules_odd_exp[group[i] - 1], 4, widest_odd_exp[group[i] - 1], 0);
|
|
|
|
char_widths[i][0] = widths[0];
|
|
|
|
char_widths[i][2] = widths[1];
|
|
|
|
char_widths[i][4] = widths[2];
|
|
|
|
char_widths[i][6] = widths[3];
|
|
|
|
getRSSwidths(v_even[i], modules_even_exp[group[i] - 1], 4, widest_even_exp[group[i] - 1], 1);
|
|
|
|
char_widths[i][1] = widths[0];
|
|
|
|
char_widths[i][3] = widths[1];
|
|
|
|
char_widths[i][5] = widths[2];
|
|
|
|
char_widths[i][7] = widths[3];
|
|
|
|
}
|
|
|
|
|
|
|
|
/* 7.2.6 Check character */
|
|
|
|
/* The checksum value is equal to the mod 211 residue of the weighted sum of the widths of the
|
|
|
|
elements in the data characters. */
|
|
|
|
checksum = 0;
|
|
|
|
for (i = 0; i < data_chars; i++) {
|
2017-09-11 03:03:09 +12:00
|
|
|
int row = weight_rows[(((data_chars - 2) / 2) * 21) + i];
|
2016-02-21 00:29:19 +13:00
|
|
|
for (j = 0; j < 8; j++) {
|
|
|
|
checksum += (char_widths[i][j] * checksum_weight_exp[(row * 8) + j]);
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
check_char = (211 * ((data_chars + 1) - 4)) + (checksum % 211);
|
|
|
|
|
|
|
|
if (check_char <= 347) {
|
|
|
|
c_group = 1;
|
|
|
|
}
|
|
|
|
if ((check_char >= 348) && (check_char <= 1387)) {
|
|
|
|
c_group = 2;
|
|
|
|
}
|
|
|
|
if ((check_char >= 1388) && (check_char <= 2947)) {
|
|
|
|
c_group = 3;
|
|
|
|
}
|
|
|
|
if ((check_char >= 2948) && (check_char <= 3987)) {
|
|
|
|
c_group = 4;
|
|
|
|
}
|
|
|
|
if (check_char >= 3988) {
|
|
|
|
c_group = 5;
|
|
|
|
}
|
|
|
|
|
|
|
|
c_odd = (check_char - g_sum_exp[c_group - 1]) / t_even_exp[c_group - 1];
|
|
|
|
c_even = (check_char - g_sum_exp[c_group - 1]) % t_even_exp[c_group - 1];
|
|
|
|
|
|
|
|
getRSSwidths(c_odd, modules_odd_exp[c_group - 1], 4, widest_odd_exp[c_group - 1], 0);
|
|
|
|
check_widths[0] = widths[0];
|
|
|
|
check_widths[2] = widths[1];
|
|
|
|
check_widths[4] = widths[2];
|
|
|
|
check_widths[6] = widths[3];
|
|
|
|
getRSSwidths(c_even, modules_even_exp[c_group - 1], 4, widest_even_exp[c_group - 1], 1);
|
|
|
|
check_widths[1] = widths[0];
|
|
|
|
check_widths[3] = widths[1];
|
|
|
|
check_widths[5] = widths[2];
|
|
|
|
check_widths[7] = widths[3];
|
|
|
|
|
|
|
|
/* Initialise element array */
|
|
|
|
pattern_width = ((((data_chars + 1) / 2) + ((data_chars + 1) & 1)) * 5) + ((data_chars + 1) * 8) + 4;
|
|
|
|
for (i = 0; i < pattern_width; i++) {
|
|
|
|
elements[i] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Put finder patterns in element array */
|
|
|
|
for (i = 0; i < (((data_chars + 1) / 2) + ((data_chars + 1) & 1)); i++) {
|
|
|
|
k = ((((((data_chars + 1) - 2) / 2) + ((data_chars + 1) & 1)) - 1) * 11) + i;
|
|
|
|
for (j = 0; j < 5; j++) {
|
|
|
|
elements[(21 * i) + j + 10] = finder_pattern_exp[((finder_sequence[k] - 1) * 5) + j];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Put check character in element array */
|
|
|
|
for (i = 0; i < 8; i++) {
|
|
|
|
elements[i + 2] = check_widths[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Put forward reading data characters in element array */
|
|
|
|
for (i = 1; i < data_chars; i += 2) {
|
|
|
|
for (j = 0; j < 8; j++) {
|
|
|
|
elements[(((i - 1) / 2) * 21) + 23 + j] = char_widths[i][j];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Put reversed data characters in element array */
|
|
|
|
for (i = 0; i < data_chars; i += 2) {
|
|
|
|
for (j = 0; j < 8; j++) {
|
|
|
|
elements[((i / 2) * 21) + 15 + j] = char_widths[i][7 - j];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((symbol->symbology == BARCODE_RSS_EXP) || (symbol->symbology == BARCODE_RSS_EXP_CC)) {
|
|
|
|
/* Copy elements into symbol */
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2016-10-15 22:54:23 +13:00
|
|
|
elements[0] = 1; // left guard
|
|
|
|
elements[1] = 1;
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2016-10-15 22:54:23 +13:00
|
|
|
elements[pattern_width - 2] = 1; // right guard
|
|
|
|
elements[pattern_width - 1] = 1;
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
writer = 0;
|
|
|
|
latch = '0';
|
|
|
|
for (i = 0; i < pattern_width; i++) {
|
|
|
|
for (j = 0; j < elements[i]; j++) {
|
|
|
|
if (latch == '1') {
|
|
|
|
set_module(symbol, symbol->rows, writer);
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, symbol->rows, writer);
|
|
|
|
}
|
|
|
|
writer++;
|
|
|
|
}
|
|
|
|
if (latch == '1') {
|
|
|
|
latch = '0';
|
|
|
|
} else {
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (symbol->width < writer) {
|
|
|
|
symbol->width = writer;
|
|
|
|
}
|
|
|
|
symbol->rows = symbol->rows + 1;
|
|
|
|
if (symbol->symbology == BARCODE_RSS_EXP_CC) {
|
|
|
|
for (j = 4; j < (symbol->width - 4); j++) {
|
|
|
|
if (module_is_set(symbol, separator_row + 1, j)) {
|
|
|
|
unset_module(symbol, separator_row, j);
|
|
|
|
} else {
|
|
|
|
set_module(symbol, separator_row, j);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* finder bar adjustment */
|
|
|
|
for (j = 0; j < (writer / 49); j++) {
|
|
|
|
k = (49 * j) + 18;
|
|
|
|
for (i = 0; i < 15; i++) {
|
|
|
|
if ((!(module_is_set(symbol, separator_row + 1, i + k - 1))) &&
|
|
|
|
(!(module_is_set(symbol, separator_row + 1, i + k))) &&
|
|
|
|
module_is_set(symbol, separator_row, i + k - 1)) {
|
|
|
|
unset_module(symbol, separator_row, i + k);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Add human readable text */
|
|
|
|
for (i = 0; i <= src_len; i++) {
|
|
|
|
if ((source[i] != '[') && (source[i] != ']')) {
|
|
|
|
symbol->text[i] = source[i];
|
|
|
|
} else {
|
|
|
|
if (source[i] == '[') {
|
|
|
|
symbol->text[i] = '(';
|
|
|
|
}
|
|
|
|
if (source[i] == ']') {
|
|
|
|
symbol->text[i] = ')';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
} else {
|
2017-10-24 08:34:31 +13:00
|
|
|
int stack_rows;
|
|
|
|
int current_row, current_block, left_to_right;
|
2016-02-21 00:29:19 +13:00
|
|
|
/* RSS Expanded Stacked */
|
|
|
|
|
|
|
|
/* Bug corrected: Character missing for message
|
|
|
|
* [01]90614141999996[10]1234222222222221
|
|
|
|
* Patch by Daniel Frede
|
|
|
|
*/
|
2017-09-11 03:03:09 +12:00
|
|
|
int codeblocks = (data_chars + 1) / 2 + ((data_chars + 1) % 2);
|
2016-02-21 00:29:19 +13:00
|
|
|
|
2016-10-10 02:10:39 +13:00
|
|
|
|
2016-02-21 00:29:19 +13:00
|
|
|
if ((symbol->option_2 < 1) || (symbol->option_2 > 10)) {
|
|
|
|
symbol->option_2 = 2;
|
|
|
|
}
|
|
|
|
if ((symbol->option_1 == 2) && (symbol->option_2 == 1)) {
|
|
|
|
/* "There shall be a minimum of four symbol characters in the
|
|
|
|
first row of an RSS Expanded Stacked symbol when it is the linear
|
|
|
|
component of an EAN.UCC Composite symbol." */
|
|
|
|
symbol->option_2 = 2;
|
|
|
|
}
|
|
|
|
|
2017-10-17 06:26:54 +13:00
|
|
|
stack_rows = codeblocks / symbol->option_2;
|
2016-02-21 00:29:19 +13:00
|
|
|
if (codeblocks % symbol->option_2 > 0) {
|
|
|
|
stack_rows++;
|
|
|
|
}
|
|
|
|
|
2017-10-17 06:26:54 +13:00
|
|
|
current_block = 0;
|
2016-02-21 00:29:19 +13:00
|
|
|
for (current_row = 1; current_row <= stack_rows; current_row++) {
|
2017-10-24 08:34:31 +13:00
|
|
|
int special_case_row = 0;
|
|
|
|
int elements_in_sub;
|
2017-09-11 03:03:09 +12:00
|
|
|
int sub_elements[235];
|
2016-02-21 00:29:19 +13:00
|
|
|
for (i = 0; i < 235; i++) {
|
|
|
|
sub_elements[i] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Row Start */
|
2016-10-15 22:54:23 +13:00
|
|
|
sub_elements[0] = 1; // left guard
|
2016-02-21 00:29:19 +13:00
|
|
|
sub_elements[1] = 1;
|
2017-10-17 06:26:54 +13:00
|
|
|
elements_in_sub = 2;
|
2016-02-21 00:29:19 +13:00
|
|
|
|
|
|
|
/* Row Data */
|
|
|
|
reader = 0;
|
|
|
|
do {
|
|
|
|
if (((symbol->option_2 & 1) || (current_row & 1)) ||
|
|
|
|
((current_row == stack_rows) && (codeblocks != (current_row * symbol->option_2)) &&
|
|
|
|
(((current_row * symbol->option_2) - codeblocks) & 1))) {
|
|
|
|
/* left to right */
|
2017-09-11 03:03:09 +12:00
|
|
|
left_to_right = 1;
|
2016-02-21 00:29:19 +13:00
|
|
|
i = 2 + (current_block * 21);
|
|
|
|
for (j = 0; j < 21; j++) {
|
|
|
|
if ((i + j) < pattern_width) {
|
2016-10-15 22:54:23 +13:00
|
|
|
sub_elements[j + (reader * 21) + 2] = elements[i + j];
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
2016-10-15 22:54:23 +13:00
|
|
|
elements_in_sub++;
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
2017-10-24 08:37:52 +13:00
|
|
|
} else {
|
2016-02-21 00:29:19 +13:00
|
|
|
/* right to left */
|
|
|
|
left_to_right = 0;
|
2016-10-15 22:54:23 +13:00
|
|
|
i = 2 + (((current_row * symbol->option_2) - reader - 1) * 21);
|
|
|
|
for (j = 0; j < 21; j++) {
|
|
|
|
if ((i + j) < pattern_width) {
|
2016-02-21 00:29:19 +13:00
|
|
|
sub_elements[(20 - j) + (reader * 21) + 2] = elements[i + j];
|
|
|
|
}
|
2016-10-15 22:54:23 +13:00
|
|
|
elements_in_sub++;
|
2016-02-21 00:29:19 +13:00
|
|
|
}
|
|
|
|
}
|
|
|
|
reader++;
|
|
|
|
current_block++;
|
|
|
|
} while ((reader < symbol->option_2) && (current_block < codeblocks));
|
|
|
|
|
|
|
|
/* Row Stop */
|
2016-10-15 22:54:23 +13:00
|
|
|
sub_elements[elements_in_sub] = 1; // right guard
|
2016-02-21 00:29:19 +13:00
|
|
|
sub_elements[elements_in_sub + 1] = 1;
|
|
|
|
elements_in_sub += 2;
|
|
|
|
|
2017-09-11 03:03:09 +12:00
|
|
|
latch = (current_row & 1) ? '0' : '1';
|
2016-02-21 00:29:19 +13:00
|
|
|
|
|
|
|
if ((current_row == stack_rows) && (codeblocks != (current_row * symbol->option_2)) &&
|
2016-10-10 02:10:39 +13:00
|
|
|
((current_row & 1) == 0) && ((symbol->option_2 & 1) == 0)) {
|
2016-02-21 00:29:19 +13:00
|
|
|
/* Special case bottom row */
|
|
|
|
special_case_row = 1;
|
|
|
|
sub_elements[0] = 2;
|
|
|
|
latch = '0';
|
|
|
|
}
|
|
|
|
|
|
|
|
writer = 0;
|
|
|
|
for (i = 0; i < elements_in_sub; i++) {
|
|
|
|
for (j = 0; j < sub_elements[i]; j++) {
|
|
|
|
if (latch == '1') {
|
|
|
|
set_module(symbol, symbol->rows, writer);
|
|
|
|
} else {
|
|
|
|
unset_module(symbol, symbol->rows, writer);
|
|
|
|
}
|
|
|
|
writer++;
|
|
|
|
}
|
|
|
|
if (latch == '1') {
|
|
|
|
latch = '0';
|
|
|
|
} else {
|
|
|
|
latch = '1';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (symbol->width < writer) {
|
|
|
|
symbol->width = writer;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (current_row != 1) {
|
|
|
|
/* middle separator pattern (above current row) */
|
|
|
|
for (j = 5; j < (49 * symbol->option_2); j += 2) {
|
|
|
|
set_module(symbol, symbol->rows - 2, j);
|
|
|
|
}
|
|
|
|
symbol->row_height[symbol->rows - 2] = 1;
|
|
|
|
/* bottom separator pattern (above current row) */
|
2019-10-31 15:01:42 +13:00
|
|
|
for (j = 4 + special_case_row; j < (writer - 4); j++) {
|
2016-02-21 00:29:19 +13:00
|
|
|
if (module_is_set(symbol, symbol->rows, j)) {
|
|
|
|
unset_module(symbol, symbol->rows - 1, j);
|
|
|
|
} else {
|
|
|
|
set_module(symbol, symbol->rows - 1, j);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
symbol->row_height[symbol->rows - 1] = 1;
|
|
|
|
/* finder bar adjustment */
|
|
|
|
for (j = 0; j < reader; j++) {
|
2016-10-15 22:54:23 +13:00
|
|
|
k = (49 * j) + 18 + special_case_row;
|
2016-02-21 00:29:19 +13:00
|
|
|
if (left_to_right) {
|
|
|
|
for (i = 0; i < 15; i++) {
|
|
|
|
if ((!(module_is_set(symbol, symbol->rows, i + k - 1))) &&
|
|
|
|
(!(module_is_set(symbol, symbol->rows, i + k))) &&
|
|
|
|
module_is_set(symbol, symbol->rows - 1, i + k - 1)) {
|
|
|
|
unset_module(symbol, symbol->rows - 1, i + k);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
2016-10-15 22:54:23 +13:00
|
|
|
if ((current_row == stack_rows) && (data_chars % 2 == 0)) {
|
|
|
|
k -= 18;
|
|
|
|
}
|
2016-02-21 00:29:19 +13:00
|
|
|
for (i = 14; i >= 0; i--) {
|
|
|
|
if ((!(module_is_set(symbol, symbol->rows, i + k + 1))) &&
|
|
|
|
(!(module_is_set(symbol, symbol->rows, i + k))) &&
|
|
|
|
module_is_set(symbol, symbol->rows - 1, i + k + 1)) {
|
|
|
|
unset_module(symbol, symbol->rows - 1, i + k);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (current_row != stack_rows) {
|
|
|
|
/* top separator pattern (below current row) */
|
|
|
|
for (j = 4; j < (writer - 4); j++) {
|
|
|
|
if (module_is_set(symbol, symbol->rows, j)) {
|
|
|
|
unset_module(symbol, symbol->rows + 1, j);
|
|
|
|
} else {
|
|
|
|
set_module(symbol, symbol->rows + 1, j);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
symbol->row_height[symbol->rows + 1] = 1;
|
|
|
|
/* finder bar adjustment */
|
|
|
|
for (j = 0; j < reader; j++) {
|
|
|
|
k = (49 * j) + 18;
|
|
|
|
if (left_to_right) {
|
|
|
|
for (i = 0; i < 15; i++) {
|
|
|
|
if ((!(module_is_set(symbol, symbol->rows, i + k - 1))) &&
|
|
|
|
(!(module_is_set(symbol, symbol->rows, i + k))) &&
|
|
|
|
module_is_set(symbol, symbol->rows + 1, i + k - 1)) {
|
|
|
|
unset_module(symbol, symbol->rows + 1, i + k);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
for (i = 14; i >= 0; i--) {
|
|
|
|
if ((!(module_is_set(symbol, symbol->rows, i + k + 1))) &&
|
|
|
|
(!(module_is_set(symbol, symbol->rows, i + k))) &&
|
|
|
|
module_is_set(symbol, symbol->rows + 1, i + k + 1)) {
|
|
|
|
unset_module(symbol, symbol->rows + 1, i + k);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
symbol->rows = symbol->rows + 4;
|
|
|
|
}
|
|
|
|
symbol->rows = symbol->rows - 3;
|
|
|
|
if (symbol->symbology == BARCODE_RSS_EXPSTACK_CC) {
|
|
|
|
for (j = 4; j < (symbol->width - 4); j++) {
|
|
|
|
if (module_is_set(symbol, separator_row + 1, j)) {
|
|
|
|
unset_module(symbol, separator_row, j);
|
|
|
|
} else {
|
|
|
|
set_module(symbol, separator_row, j);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* finder bar adjustment */
|
|
|
|
for (j = 0; j < reader; j++) {
|
|
|
|
k = (49 * j) + 18;
|
|
|
|
for (i = 0; i < 15; i++) {
|
|
|
|
if ((!(module_is_set(symbol, separator_row + 1, i + k - 1))) &&
|
|
|
|
(!(module_is_set(symbol, separator_row + 1, i + k))) &&
|
|
|
|
module_is_set(symbol, separator_row, i + k - 1)) {
|
|
|
|
unset_module(symbol, separator_row, i + k);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
2017-10-24 08:37:52 +13:00
|
|
|
|
2016-10-15 06:56:49 +13:00
|
|
|
for (i = 0; i < symbol->rows; i++) {
|
|
|
|
if (symbol->row_height[i] == 0) {
|
|
|
|
symbol->row_height[i] = 34;
|
|
|
|
}
|
|
|
|
}
|
2016-02-21 00:29:19 +13:00
|
|
|
|
|
|
|
return 0;
|
2008-07-14 09:15:55 +12:00
|
|
|
}
|