Files
harbour-core/harbour/contrib/hbct/charop.c
Viktor Szakats 31adc89c13 2012-07-20 07:22 UTC+0200 Viktor Szakats (harbour syenar.net)
* examples/gfspell/spellc.c
    * uncrustified

  * contrib/xhb/hbxml.c
    * some formatting

  * contrib/hbct/atadjust.c
  * contrib/hbct/atnum.c
  * contrib/hbct/atrepl.c
  * contrib/hbct/charone.c
  * contrib/hbct/charonly.c
  * contrib/hbct/charop.c
  * contrib/hbct/charswap.c
  * contrib/hbct/count.c
  * contrib/hbct/ctwin.c
  * contrib/hbct/justify.c
  * contrib/hbct/numat.c
  * contrib/hbct/pos1.c
  * contrib/hbct/token1.c
  * contrib/hbgd/gdwrp.c
  * contrib/rddads/adsx.c
  * examples/hbapollo/get.c
  * examples/hbapollo/put.c
  * include/hbdefs.h
  * include/hbstack.h
  * src/rdd/dbffpt/dbffpt1.c
  * src/rtl/gtdos/gtdos.c
  * src/rtl/gtos2/gtos2.c
  * src/rtl/gtpca/gtpca.c
  * src/rtl/gtstd/gtstd.c
    * minor formatting errors (whitespace)
2012-07-20 05:24:17 +00:00

396 lines
12 KiB
C

/*
* $Id$
*/
/*
* Harbour Project source code:
* CT3 string functions
* - CHARADD()
* - CHARAND()
* - CHARNOT()
* - CHAROR()
* - CHARXOR()
*
* Copyright 2001 IntTec GmbH, Neunlindenstr 32, 79106 Freiburg, Germany
* Author: Martin Vogel <vogel@inttec.de>
*
* 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. 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 "ct.h"
/* helper function */
void ct_charop( int iMode )
{
/* suppressing return value ? */
int iNoRet = ct_getref() && HB_ISBYREF( 1 );
if( HB_ISCHAR( 1 ) )
{
HB_SIZE sStrLen = hb_parclen( 1 );
HB_SIZE sPos;
const unsigned char * pucString = ( const unsigned char * ) hb_parc( 1 );
unsigned char * pucResult;
if( sStrLen == 0 )
{
if( iNoRet )
hb_ret();
else
hb_retc_null();
return;
}
pucResult = ( unsigned char * ) hb_xgrab( sStrLen + 1 );
switch( iMode )
{
/* NOT */
case CT_CHAROP_CHARNOT:
for( sPos = 0; sPos < sStrLen; ++sPos )
pucResult[ sPos ] = ~pucString[ sPos ];
break;
/* SHL */
case CT_CHAROP_CHARSHL:
{
int iSHL = hb_parni( 2 ) % 8; /* defaults to 0 */
if( iSHL == 0 )
hb_xmemcpy( pucResult, pucString, sStrLen );
else
for( sPos = 0; sPos < sStrLen; ++sPos )
pucResult[ sPos ] = pucString[ sPos ] << iSHL;
break;
}
/* SHR */
case CT_CHAROP_CHARSHR:
{
int iSHR = hb_parni( 2 ) % 8; /* defaults to 0 */
if( iSHR == 0 )
hb_xmemcpy( pucResult, pucString, sStrLen );
else
for( sPos = 0; sPos < sStrLen; ++sPos )
pucResult[ sPos ] = pucString[ sPos ] >> iSHR;
break;
}
/* RLL */
case CT_CHAROP_CHARRLL:
{
int iRLL = hb_parni( 2 ) % 8; /* defaults to 0 */
hb_xmemcpy( pucResult, pucString, sStrLen );
if( iRLL != 0 )
for( sPos = 0; sPos < sStrLen; ++sPos )
{
int iRLLCnt;
for( iRLLCnt = 0; iRLLCnt < iRLL; iRLLCnt++ )
if( pucResult[ sPos ] & 0x80 ) /* most left bit set -> roll over */
{
pucResult[ sPos ] <<= 1;
pucResult[ sPos ] |= 0x01;
}
else
{
pucResult[ sPos ] <<= 1;
}
}
break;
}
/* RLR */
case CT_CHAROP_CHARRLR:
{
int iRLR = hb_parni( 2 ) % 8; /* defaults to 0 */
hb_xmemcpy( pucResult, pucString, sStrLen );
if( iRLR != 0 )
{
for( sPos = 0; sPos < sStrLen; ++sPos )
{
int iRLRCnt;
for( iRLRCnt = 0; iRLRCnt < iRLR; iRLRCnt++ )
{
if( pucResult[ sPos ] & 0x01 ) /* most right bit set -> roll over */
{
pucResult[ sPos ] >>= 1;
pucResult[ sPos ] |= 0x80;
}
else
pucResult[ sPos ] >>= 1;
}
}
}
break;
}
/* ADD */
case CT_CHAROP_CHARADD:
{
if( HB_ISCHAR( 2 ) )
{
const char * pucString2 = hb_parc( 2 );
HB_SIZE sStrLen2 = hb_parclen( 2 );
for( sPos = 0; sPos < sStrLen; ++sPos )
pucResult[ sPos ] = ( char ) ( pucString[ sPos ] + pucString2[ sStrLen2 ? ( sPos % sStrLen2 ) : 0 ] );
}
else
{
int iArgErrorMode = ct_getargerrormode();
if( iArgErrorMode != CT_ARGERR_IGNORE )
{
ct_error( ( HB_USHORT ) iArgErrorMode, EG_ARG, CT_ERROR_CHARADD,
NULL, HB_ERR_FUNCNAME, 0,
EF_CANDEFAULT, HB_ERR_ARGS_BASEPARAMS );
}
hb_xmemcpy( pucResult, pucString, sStrLen );
}
break;
}
/* SUB */
case CT_CHAROP_CHARSUB:
{
if( HB_ISCHAR( 2 ) )
{
const char * pucString2 = hb_parc( 2 );
HB_SIZE sStrLen2 = hb_parclen( 2 );
for( sPos = 0; sPos < sStrLen; ++sPos )
pucResult[ sPos ] = ( char ) ( pucString[ sPos ] - pucString2[ sStrLen2 ? ( sPos % sStrLen2 ) : 0 ] );
}
else
{
int iArgErrorMode = ct_getargerrormode();
if( iArgErrorMode != CT_ARGERR_IGNORE )
{
ct_error( ( HB_USHORT ) iArgErrorMode, EG_ARG, CT_ERROR_CHARSUB,
NULL, HB_ERR_FUNCNAME, 0,
EF_CANDEFAULT, HB_ERR_ARGS_BASEPARAMS );
}
hb_xmemcpy( pucResult, pucString, sStrLen );
}
break;
}
/* AND */
case CT_CHAROP_CHARAND:
{
if( HB_ISCHAR( 2 ) )
{
const char * pucString2 = hb_parc( 2 );
HB_SIZE sStrLen2 = hb_parclen( 2 );
for( sPos = 0; sPos < sStrLen; ++sPos )
pucResult[ sPos ] = ( char ) ( pucString[ sPos ] & pucString2[ sStrLen2 ? ( sPos % sStrLen2 ) : 0 ] );
}
else
{
int iArgErrorMode = ct_getargerrormode();
if( iArgErrorMode != CT_ARGERR_IGNORE )
{
ct_error( ( HB_USHORT ) iArgErrorMode, EG_ARG, CT_ERROR_CHARAND, NULL, HB_ERR_FUNCNAME, 0,
EF_CANDEFAULT, HB_ERR_ARGS_BASEPARAMS );
}
hb_xmemcpy( pucResult, pucString, sStrLen );
}
break;
}
/* OR */
case CT_CHAROP_CHAROR:
{
if( HB_ISCHAR( 2 ) )
{
const char * pucString2 = hb_parc( 2 );
HB_SIZE sStrLen2 = hb_parclen( 2 );
for( sPos = 0; sPos < sStrLen; ++sPos )
pucResult[ sPos ] = ( char ) ( pucString[ sPos ] | pucString2[ sStrLen2 ? ( sPos % sStrLen2 ) : 0 ] );
}
else
{
int iArgErrorMode = ct_getargerrormode();
if( iArgErrorMode != CT_ARGERR_IGNORE )
{
ct_error( ( HB_USHORT ) iArgErrorMode, EG_ARG, CT_ERROR_CHAROR, NULL, HB_ERR_FUNCNAME, 0,
EF_CANDEFAULT, HB_ERR_ARGS_BASEPARAMS );
}
hb_xmemcpy( pucResult, pucString, sStrLen );
}
break;
}
/* XOR */
case CT_CHAROP_CHARXOR:
{
if( HB_ISCHAR( 2 ) )
{
const char * pucString2 = hb_parc( 2 );
HB_SIZE sStrLen2 = hb_parclen( 2 );
for( sPos = 0; sPos < sStrLen; ++sPos )
pucResult[ sPos ] = ( char ) ( pucString[ sPos ] ^ pucString2[ sStrLen2 ? ( sPos % sStrLen2 ) : 0 ] );
}
else
{
int iArgErrorMode = ct_getargerrormode();
if( iArgErrorMode != CT_ARGERR_IGNORE )
{
ct_error( ( HB_USHORT ) iArgErrorMode, EG_ARG, CT_ERROR_CHARXOR, NULL, HB_ERR_FUNCNAME, 0,
EF_CANDEFAULT, HB_ERR_ARGS_BASEPARAMS );
}
hb_xmemcpy( pucResult, pucString, sStrLen );
}
break;
}
} /* endswitch( iMode ) */
if( HB_ISBYREF( 1 ) )
hb_storclen( ( char * ) pucResult, sStrLen, 1 );
if( iNoRet )
hb_xfree( pucResult );
else
hb_retclen_buffer( ( char * ) pucResult, sStrLen );
}
else /* if( HB_ISCHAR( 1 ) ) */
{
PHB_ITEM pSubst = NULL;
int iArgErrorMode = ct_getargerrormode();
int iError = 0;
if( iArgErrorMode != CT_ARGERR_IGNORE )
{
switch( iMode )
{
case CT_CHAROP_CHARADD:
iError = CT_ERROR_CHARADD;
break;
case CT_CHAROP_CHARSUB:
iError = CT_ERROR_CHARSUB;
break;
case CT_CHAROP_CHARAND:
iError = CT_ERROR_CHARAND;
break;
case CT_CHAROP_CHARNOT:
iError = CT_ERROR_CHARNOT;
break;
case CT_CHAROP_CHAROR:
iError = CT_ERROR_CHAROR;
break;
case CT_CHAROP_CHARXOR:
iError = CT_ERROR_CHARXOR;
break;
case CT_CHAROP_CHARSHL:
iError = CT_ERROR_CHARSHL;
break;
case CT_CHAROP_CHARSHR:
iError = CT_ERROR_CHARSHR;
break;
case CT_CHAROP_CHARRLL:
iError = CT_ERROR_CHARRLL;
break;
case CT_CHAROP_CHARRLR:
iError = CT_ERROR_CHARRLR;
break;
}
pSubst = ct_error_subst( ( HB_USHORT ) iArgErrorMode, EG_ARG, iError,
NULL, HB_ERR_FUNCNAME, 0, EF_CANSUBSTITUTE,
HB_ERR_ARGS_BASEPARAMS );
}
if( pSubst != NULL )
hb_itemReturnRelease( pSubst );
else
hb_ret();
}
}
HB_FUNC( CHARADD )
{
ct_charop( CT_CHAROP_CHARADD );
}
HB_FUNC( CHARAND )
{
ct_charop( CT_CHAROP_CHARAND );
}
HB_FUNC( CHARNOT )
{
ct_charop( CT_CHAROP_CHARNOT );
}
HB_FUNC( CHAROR )
{
ct_charop( CT_CHAROP_CHAROR );
}
HB_FUNC( CHARXOR )
{
ct_charop( CT_CHAROP_CHARXOR );
}