* (all files)
* stripped svn header
* minor cleanups
; use following command to find out the history of files:
git log
git log --follow
git blame
git annotate
155 lines
5.3 KiB
C
155 lines
5.3 KiB
C
/*
|
|
* Harbour Project source code:
|
|
* Zebra barcode library
|
|
*
|
|
* Copyright 2010 Mindaugas Kavaliauskas <dbtopas at dbtopas.lt>
|
|
* www - http://harbour-project.org
|
|
*
|
|
* 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 2, 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 software; see the file COPYING.txt. If not, write to
|
|
* the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
|
|
* Boston, MA 02111-1307 USA (or visit the web site http://www.gnu.org/).
|
|
*
|
|
* As a special exception, the Harbour Project gives permission for
|
|
* additional uses of the text contained in its release of Harbour.
|
|
*
|
|
* The exception is that, if you link the Harbour libraries with other
|
|
* files to produce an executable, this does not by itself cause the
|
|
* resulting executable to be covered by the GNU General Public License.
|
|
* Your use of that executable is in no way restricted on account of
|
|
* linking the Harbour library code into it.
|
|
*
|
|
* This exception does not however invalidate any other reasons why
|
|
* the executable file might be covered by the GNU General Public License.
|
|
*
|
|
* This exception applies only to the code released by the Harbour
|
|
* Project under the name Harbour. If you copy code from other
|
|
* Harbour Project or Free Software Foundation releases into a copy of
|
|
* Harbour, as the General Public License permits, the exception does
|
|
* not apply to the code that you add in this way. To avoid misleading
|
|
* anyone as to the status of such modified files, you must delete
|
|
* this exception notice from them.
|
|
*
|
|
* If you write modifications of your own for Harbour, it is your choice
|
|
* whether to permit this exception to apply to your modifications.
|
|
* If you do not wish that, delete this exception notice.
|
|
*
|
|
*/
|
|
|
|
#include "hbzebra.h"
|
|
#include "hbapiitm.h"
|
|
#include "hbapierr.h"
|
|
|
|
|
|
static const char s_code[] = { 0x0C, 0x11, 0x12, 0x03, 0x14, 0x05, 0x06, 0x18, 0x09, 0x0A };
|
|
|
|
static char _itf_checksum( const char * szCode )
|
|
{
|
|
int i, sum = 0;
|
|
|
|
for( i = 0; szCode[ i ]; i++ )
|
|
sum += ( szCode[ i ] - '0' ) * ( i & 1 ? 1 : 3 );
|
|
return '0' + ( 100000 - sum ) % 10;
|
|
}
|
|
|
|
PHB_ZEBRA hb_zebra_create_itf( const char * szCode, HB_SIZE nLen, int iFlags )
|
|
{
|
|
PHB_ZEBRA pZebra;
|
|
int i, iN, iW, iLen = ( int ) nLen;
|
|
char csum;
|
|
|
|
pZebra = hb_zebra_create();
|
|
pZebra->iType = HB_ZEBRA_TYPE_ITF;
|
|
|
|
for( i = 0; i < iLen; i++ )
|
|
{
|
|
if( szCode[ i ] < '0' || szCode[ i ] > '9' )
|
|
{
|
|
pZebra->iError = HB_ZEBRA_ERROR_INVALIDCODE;
|
|
return pZebra;
|
|
}
|
|
}
|
|
if( ( iLen + ( iFlags & HB_ZEBRA_FLAG_CHECKSUM ? 1 : 0 ) ) & 1 )
|
|
{
|
|
pZebra->szCode = ( char * ) hb_xgrab( iLen + 2 );
|
|
pZebra->szCode[ 0 ] = '0';
|
|
hb_xmemcpy( pZebra->szCode + 1, szCode, iLen );
|
|
pZebra->szCode[ iLen + 1 ] = '\0';
|
|
}
|
|
else
|
|
{
|
|
pZebra->szCode = ( char * ) hb_xgrab( iLen + 1 );
|
|
hb_xmemcpy( pZebra->szCode, szCode, iLen );
|
|
pZebra->szCode[ iLen ] = '\0';
|
|
}
|
|
|
|
szCode = pZebra->szCode;
|
|
if( iFlags & HB_ZEBRA_FLAG_CHECKSUM )
|
|
csum = _itf_checksum( pZebra->szCode );
|
|
else
|
|
csum = 0;
|
|
|
|
if( iFlags & HB_ZEBRA_FLAG_WIDE2_5 )
|
|
{
|
|
iN = 2;
|
|
iW = 5;
|
|
}
|
|
else if( iFlags & HB_ZEBRA_FLAG_WIDE3 )
|
|
{
|
|
iN = 1;
|
|
iW = 3;
|
|
}
|
|
else
|
|
{
|
|
iN = 1;
|
|
iW = 2;
|
|
}
|
|
|
|
pZebra->pBits = hb_bitbuffer_create();
|
|
|
|
/* start */
|
|
hb_bitbuffer_cat_int( pZebra->pBits, 3, iN );
|
|
hb_bitbuffer_cat_int( pZebra->pBits, 0, iN );
|
|
hb_bitbuffer_cat_int( pZebra->pBits, 3, iN );
|
|
hb_bitbuffer_cat_int( pZebra->pBits, 0, iN );
|
|
|
|
for( i = 0; szCode[ i ]; i += 2 )
|
|
{
|
|
char c1 = s_code[ szCode[ i ] - '0' ], c2 = szCode[ i + 1 ] ? s_code[ szCode[ i + 1 ] - '0' ] : csum;
|
|
hb_bitbuffer_cat_int( pZebra->pBits, 31, c1 & 1 ? iW : iN ); hb_bitbuffer_cat_int( pZebra->pBits, 0, c2 & 1 ? iW : iN ); c1 >>= 1; c2 >>= 1;
|
|
hb_bitbuffer_cat_int( pZebra->pBits, 31, c1 & 1 ? iW : iN ); hb_bitbuffer_cat_int( pZebra->pBits, 0, c2 & 1 ? iW : iN ); c1 >>= 1; c2 >>= 1;
|
|
hb_bitbuffer_cat_int( pZebra->pBits, 31, c1 & 1 ? iW : iN ); hb_bitbuffer_cat_int( pZebra->pBits, 0, c2 & 1 ? iW : iN ); c1 >>= 1; c2 >>= 1;
|
|
hb_bitbuffer_cat_int( pZebra->pBits, 31, c1 & 1 ? iW : iN ); hb_bitbuffer_cat_int( pZebra->pBits, 0, c2 & 1 ? iW : iN ); c1 >>= 1; c2 >>= 1;
|
|
hb_bitbuffer_cat_int( pZebra->pBits, 31, c1 & 1 ? iW : iN ); hb_bitbuffer_cat_int( pZebra->pBits, 0, c2 & 1 ? iW : iN );
|
|
if( ! szCode[ i + 1 ] )
|
|
break;
|
|
}
|
|
|
|
/* stop */
|
|
hb_bitbuffer_cat_int( pZebra->pBits, 31, iW );
|
|
hb_bitbuffer_cat_int( pZebra->pBits, 0, iN );
|
|
hb_bitbuffer_cat_int( pZebra->pBits, 3, iN );
|
|
return pZebra;
|
|
}
|
|
|
|
|
|
HB_FUNC( HB_ZEBRA_CREATE_ITF )
|
|
{
|
|
PHB_ITEM pItem = hb_param( 1, HB_IT_STRING );
|
|
|
|
if( pItem )
|
|
hb_zebra_ret( hb_zebra_create_itf( hb_itemGetCPtr( pItem ), hb_itemGetCLen( pItem ), hb_parni( 2 ) ) );
|
|
else
|
|
hb_errRT_BASE( EG_ARG, 3012, NULL, HB_ERR_FUNCNAME, HB_ERR_ARGS_BASEPARAMS );
|
|
}
|