9687850865
* (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
394 lines
10 KiB
C
394 lines
10 KiB
C
/*
|
|
* Harbour Project source code:
|
|
* CT3 serial communication functions not directly operating on
|
|
* serial devices
|
|
*
|
|
* Copyright 2010 Przemyslaw Czerpak <druzus / at / priv.onet.pl>
|
|
* 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 "hbapi.h"
|
|
#include "hbapiitm.h"
|
|
#include "hbapigt.h"
|
|
#include "hbchksum.h"
|
|
|
|
/* COM_DOSCON( <cString>, [<nLine>], [<nColumn>] ) -> <cNull>
|
|
*/
|
|
HB_FUNC( COM_DOSCON )
|
|
{
|
|
HB_SIZE nLen = hb_parclen( 1 );
|
|
|
|
if( nLen > 0 )
|
|
{
|
|
if( HB_ISNUM( 2 ) || HB_ISNUM( 3 ) )
|
|
{
|
|
int iRow, iCol;
|
|
|
|
hb_gtGetPos( &iRow, &iCol );
|
|
if( HB_ISNUM( 2 ) )
|
|
iRow = hb_parni( 1 );
|
|
if( HB_ISNUM( 3 ) )
|
|
iCol = hb_parni( 2 );
|
|
hb_gtSetPos( iRow, iCol );
|
|
}
|
|
hb_gtWriteCon( hb_parc( 1 ), nLen );
|
|
}
|
|
hb_retc_null();
|
|
}
|
|
|
|
/* COM_CRC( <cString>, [<nStart>], [<nPolynomial>] ) -> <nCRC>
|
|
*/
|
|
HB_FUNC( COM_CRC )
|
|
{
|
|
HB_MAXUINT crc = hb_parnint( 2 );
|
|
const char * szString = hb_parc( 1 );
|
|
|
|
if( szString )
|
|
{
|
|
HB_MAXUINT nPolynomial = ( HB_MAXUINT ) hb_parnint( 3 );
|
|
|
|
if( nPolynomial == 0 )
|
|
nPolynomial = 0x11021; /* CRC_16_X25 */
|
|
|
|
/* NOTE: warning this function is not bug compatible with CT3.
|
|
* It fixes few problems in original CT3 implementation
|
|
* i.e. it works correctly for 8 bit and smaller polynomials
|
|
* instead of returning 0 or supports much larger polynomials
|
|
* up to 64bits.
|
|
* For 16/17 bit polynomials it gives the same results as CT3
|
|
* so for most common usage it should be binary compatible
|
|
* with CT3. [druzus]
|
|
*/
|
|
crc = hb_crcct( crc, szString, hb_parclen( 1 ), nPolynomial );
|
|
}
|
|
hb_retnint( crc );
|
|
}
|
|
|
|
static char s_xmoblock_sum( const char * szData, HB_SIZE nLen )
|
|
{
|
|
unsigned char uc = 0;
|
|
|
|
while( nLen-- )
|
|
uc += ( unsigned char ) *szData++;
|
|
return ( char ) uc;
|
|
}
|
|
|
|
/* XMOBLOCK( <cString>, <nBlockNumber>, [<lCRC>], [<nMode>] ) -> <cXModemBlock>
|
|
*/
|
|
HB_FUNC( XMOBLOCK )
|
|
{
|
|
const char * szData;
|
|
HB_SIZE nLen, nSize;
|
|
char * pszBlock;
|
|
int iBlock;
|
|
HB_BOOL fCRC;
|
|
|
|
szData = hb_parc( 1 );
|
|
nLen = hb_parclen( 1 );
|
|
iBlock = hb_parni( 2 );
|
|
fCRC = hb_parl( 3 );
|
|
nSize = hb_parni( 4 ) == 2 ? 1024 : 128;
|
|
|
|
iBlock &= 0xFF;
|
|
if( nLen > nSize )
|
|
nLen = nSize;
|
|
pszBlock = ( char * ) hb_xgrab( nSize + ( fCRC ? 6 : 5 ) );
|
|
pszBlock[ 0 ] = nSize == 128 ? 1 : 2;
|
|
pszBlock[ 1 ] = ( char ) iBlock;
|
|
pszBlock[ 2 ] = ( char ) ( 0xFF - iBlock );
|
|
if( szData )
|
|
memcpy( pszBlock + 3, szData, nLen );
|
|
if( nLen < nSize )
|
|
memset( pszBlock + nLen + 3, 0, nSize - nLen );
|
|
if( fCRC )
|
|
{
|
|
HB_U16 crc = ( HB_U16 ) hb_crcct( 0, pszBlock + 3, nSize, 0x11021 );
|
|
HB_PUT_BE_UINT16( &pszBlock[ 3 + nSize ], crc );
|
|
nSize += 5;
|
|
}
|
|
else
|
|
{
|
|
pszBlock[ 3 + nSize ] = s_xmoblock_sum( szData, nLen );
|
|
nSize += 4;
|
|
}
|
|
hb_retclen_buffer( pszBlock, nSize );
|
|
}
|
|
|
|
/* XMOCHECK( <cString>, [<lCRC>] ) -> <nBlockNumber>|-1
|
|
*/
|
|
HB_FUNC( XMOCHECK )
|
|
{
|
|
HB_SIZE nLen = hb_parclen( 1 ), nSize;
|
|
int iResult = -1;
|
|
|
|
if( nLen >= 132 )
|
|
{
|
|
const char * szBlock = hb_parc( 1 );
|
|
HB_BOOL fCRC = hb_parl( 2 );
|
|
|
|
if( *szBlock == 0x01 )
|
|
nSize = 128;
|
|
else if( *szBlock == 0x02 )
|
|
nSize = 1024;
|
|
else
|
|
nSize = nLen;
|
|
if( nLen == nSize + ( fCRC ? 5 : 4 ) &&
|
|
( unsigned char ) szBlock[ 1 ] +
|
|
( unsigned char ) szBlock[ 2 ] == 0xFF )
|
|
{
|
|
if( fCRC ?
|
|
hb_crcct( 0, szBlock + 3, nSize + 2, 0x11021 ) == 0 :
|
|
s_xmoblock_sum( szBlock + 3, nSize ) == szBlock[ 3 + nSize ] )
|
|
iResult = ( unsigned char ) szBlock[ 1 ];
|
|
}
|
|
}
|
|
hb_retni( iResult );
|
|
}
|
|
|
|
/* ZEROINSERT( <cString> ) -> <cDataBlock>
|
|
*/
|
|
HB_FUNC( ZEROINSERT )
|
|
{
|
|
PHB_ITEM pString = hb_param( 1, HB_IT_STRING );
|
|
|
|
if( pString )
|
|
{
|
|
const char * szText;
|
|
HB_SIZE nLen, nBits, n;
|
|
unsigned int uiVal;
|
|
int i, j;
|
|
|
|
szText = hb_itemGetCPtr( pString );
|
|
nLen = hb_itemGetCLen( pString );
|
|
uiVal = 0;
|
|
nBits = 0;
|
|
/* NOTE: trailing zero accessed intentionally */
|
|
for( n = 0; n <= nLen; ++n )
|
|
{
|
|
uiVal |= ( unsigned char ) szText[ n ];
|
|
for( i = 0; i < 8; ++i )
|
|
{
|
|
if( ( uiVal & 0xF800 ) == 0xF800 )
|
|
{
|
|
uiVal &= 0xF7FF;
|
|
++nBits;
|
|
}
|
|
uiVal <<= 1;
|
|
}
|
|
}
|
|
if( nBits )
|
|
{
|
|
HB_SIZE nDest = nLen + ( ( nBits + 7 ) >> 3 );
|
|
char * pszDest = ( char * ) hb_xgrab( nDest + 1 );
|
|
unsigned char c = 0;
|
|
|
|
nBits = n = 0;
|
|
i = 1;
|
|
j = 8;
|
|
uiVal = ( unsigned char ) szText[ n ];
|
|
uiVal <<= 8;
|
|
while( nBits < nDest )
|
|
{
|
|
if( --i == 0 )
|
|
{
|
|
if( ++n < nLen )
|
|
{
|
|
uiVal |= ( unsigned char ) szText[ n ];
|
|
i = 8;
|
|
}
|
|
}
|
|
if( ( uiVal & 0xF800 ) == 0xF800 )
|
|
{
|
|
c = ( c << 1 ) | 1;
|
|
if( --j == 0 )
|
|
{
|
|
pszDest[ nBits++ ] = c;
|
|
j = 8;
|
|
}
|
|
uiVal &= 0xF7FF;
|
|
}
|
|
c <<= 1;
|
|
if( uiVal & 0x8000 )
|
|
c |= 1;
|
|
if( --j == 0 )
|
|
{
|
|
pszDest[ nBits++ ] = c;
|
|
j = 8;
|
|
}
|
|
uiVal <<= 1;
|
|
}
|
|
|
|
hb_retclen_buffer( pszDest, nDest );
|
|
}
|
|
else
|
|
hb_itemReturn( pString );
|
|
}
|
|
else
|
|
hb_retc_null();
|
|
}
|
|
|
|
/* ZEROREMOVE( <cDataBlock> ) -> cString
|
|
*/
|
|
HB_FUNC( ZEROREMOVE )
|
|
{
|
|
PHB_ITEM pString = hb_param( 1, HB_IT_STRING );
|
|
|
|
if( pString )
|
|
{
|
|
const char * szText;
|
|
HB_SIZE nLen, nDest, nBits, n;
|
|
int i, j, l;
|
|
unsigned char ucVal;
|
|
|
|
szText = hb_itemGetCPtr( pString );
|
|
nLen = hb_itemGetCLen( pString );
|
|
j = 8;
|
|
l = 0;
|
|
ucVal = 0;
|
|
|
|
for( n = nDest = nBits = 0; n < nLen; ++n )
|
|
{
|
|
unsigned char c = szText[ n ];
|
|
|
|
for( i = 0; i < 8; ++i )
|
|
{
|
|
if( l == 5 )
|
|
{
|
|
if( c & 0x80 )
|
|
{
|
|
/* wrong string encoding which does not confirm
|
|
* CCITT specification.
|
|
*/
|
|
hb_retc_null();
|
|
return;
|
|
}
|
|
l = 0;
|
|
++nBits;
|
|
}
|
|
else
|
|
{
|
|
ucVal <<= 1;
|
|
if( c & 0x80 )
|
|
{
|
|
++l;
|
|
ucVal |= 1;
|
|
}
|
|
else
|
|
l = 0;
|
|
if( --j == 0 )
|
|
{
|
|
ucVal = 0;
|
|
++nDest;
|
|
j = 8;
|
|
}
|
|
}
|
|
c <<= 1;
|
|
}
|
|
}
|
|
|
|
/* NOTE: CT3 decodes some wrong CCITT strings which does not have
|
|
* trailing 0 instead of returning empty string "", i.e.:
|
|
* ? Len( ZeroRemove( Chr( 31 ) ) )
|
|
* ? Len( ZeroRemove( Chr( 31 ) + Chr( 31 ) ) )
|
|
* this implementation fixed this bug but if you need strict
|
|
* CT3 behavior for compatibility in some broken code then
|
|
* you can disable this fix setting HB_CT3_ZEROREMOVE_BUG
|
|
* macro. [druzus]
|
|
*/
|
|
#ifdef HB_CT3_ZEROREMOVE_BUG
|
|
if( l == 5 )
|
|
{
|
|
++nLen;
|
|
++nDest;
|
|
ucVal = 0;
|
|
}
|
|
if( ucVal != 0 )
|
|
#else
|
|
if( ucVal != 0 || l == 5 )
|
|
#endif
|
|
|
|
hb_retc_null();
|
|
else if( nBits )
|
|
{
|
|
char * pszDest = ( char * ) hb_xgrab( nDest + 1 );
|
|
|
|
j = 8;
|
|
l = 0;
|
|
ucVal = 0;
|
|
for( n = nDest = 0; n < nLen; ++n )
|
|
{
|
|
unsigned char c = szText[ n ];
|
|
|
|
for( i = 0; i < 8; ++i )
|
|
{
|
|
if( l == 5 )
|
|
l = 0;
|
|
else
|
|
{
|
|
ucVal <<= 1;
|
|
if( c & 0x80 )
|
|
{
|
|
++l;
|
|
ucVal |= 1;
|
|
}
|
|
else
|
|
l = 0;
|
|
if( --j == 0 )
|
|
{
|
|
pszDest[ nDest++ ] = ucVal;
|
|
j = 8;
|
|
}
|
|
}
|
|
c <<= 1;
|
|
}
|
|
}
|
|
|
|
hb_retclen_buffer( pszDest, nDest );
|
|
}
|
|
else
|
|
hb_itemReturn( pString );
|
|
}
|
|
else
|
|
hb_retc_null();
|
|
}
|