Files
harbour-core/harbour/contrib/libct/bitnum.c
Przemyslaw Czerpak 71acb177c3 2007-01-24 10:25 UTC+0100 Przemyslaw Czerpak (druzus/at/priv.onet.pl)
* harbour/config/w32/bcc32.cf
  * harbour/include/hbexprb.c
  * harbour/include/hbpcode.h
  * harbour/include/hbxvm.h
  * harbour/source/compiler/genc.c
  * harbour/source/compiler/gencc.c
  * harbour/source/compiler/hbdead.c
  * harbour/source/compiler/hbfix.c
  * harbour/source/compiler/hblbl.c
  * harbour/source/compiler/hbpcode.c
  * harbour/source/compiler/hbstripl.c
  * harbour/source/rtl/set.c
  * harbour/source/rtl/gtsln/gtsln.c
  * harbour/source/vm/hvm.c
    * recent fixes from Beta1

  * harbour/contrib/libct/Makefile
  - harbour/contrib/libct/bit1.c
  - harbour/contrib/libct/bit2.c
  - harbour/contrib/libct/bit3.c
  + harbour/contrib/libct/bitnum.c
    ! rewritten bit functions

  * harbour/contrib/libct/addascii.c
    * cleanup

  * harbour/contrib/odbc/Makefile
  * harbour/contrib/odbc/odbc.c
  * harbour/contrib/odbc/sql.ch
  - harbour/contrib/odbc/sql.h
  - harbour/contrib/odbc/sqlext.h
  - harbour/contrib/odbc/sqltypes.h
  * harbour/contrib/odbc/todbc.prg
    ! synced with xHarbour

  * harbour/contrib/rdd_ads/ads1.c
    ! fixed typo in DBI_GETHEADERSIZE

  * harbour/contrib/rdd_ads/adsfunc.c
    + added ADSDDREMOVEINDEXFILE - borrowed from xHarbour

  * harbour/source/rtl/alert.prg
    * minor cleanup

  * harbour/source/rtl/gtfunc.c
    * use HB_ERR_ARGS_BASEPARAMS in error messages

  * harbour/source/rtl/transfrm.c
    * casting
2007-01-24 09:27:02 +00:00

283 lines
6.4 KiB
C

/*
* $Id$
*/
/*
* Harbour Project source code:
* CT3 Number and bit manipulation functions:
* NUMAND(), NUMOR(), NUMXOR(), NUMNOT(), NUMHIGH(), NUMLOW()
* NUMROL(), NUMMIRR(), CLEARBIT(), SETBIT(), ISBIT()
*
* Copyright 2007 Przemyslaw Czerpak <druzus / at / priv.onet.pl>
* www - http://www.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 "hbapi.h"
static BOOL __numParam( int iParam, HB_LONG * plNum )
{
char * szHex = hb_parc( iParam );
if( szHex )
{
*plNum = 0;
while( *szHex == ' ' )
szHex++;
while( *szHex )
{
char c = *szHex++;
if( c >= '0' && c <= '9' )
c -= '0';
else if( c >= 'A' && c <= 'F' )
c -= 'A' - 10;
else if( c >= 'a' && c <= 'f' )
c -= 'a' - 10;
else
break;
*plNum = ( *plNum << 4 ) | c;
iParam = 0;
}
if( !iParam )
return TRUE;
}
else if( ISNUM( iParam ) )
{
*plNum = hb_parnint( iParam );
return TRUE;
}
*plNum = -1;
return FALSE;
}
HB_FUNC( NUMAND )
{
int iPCount = hb_pcount(), i = 1;
HB_LONG lValue = -1, lNext = 0;
if( iPCount && __numParam( 1, &lValue ) )
{
while( --iPCount && __numParam( ++i, &lNext ) )
lValue &= lNext;
if( iPCount )
lValue = -1;
}
hb_retnint( lValue );
}
HB_FUNC( NUMOR )
{
int iPCount = hb_pcount(), i = 1;
HB_LONG lValue = -1, lNext = 0;
if( iPCount && __numParam( 1, &lValue ) )
{
while( --iPCount && __numParam( ++i, &lNext ) )
lValue |= lNext;
if( iPCount )
lValue = -1;
}
hb_retnint( lValue );
}
HB_FUNC( NUMXOR )
{
int iPCount = hb_pcount(), i = 1;
HB_LONG lValue = -1, lNext = 0;
if( iPCount && __numParam( 1, &lValue ) )
{
while( --iPCount && __numParam( ++i, &lNext ) )
lValue ^= lNext;
if( iPCount )
lValue = -1;
}
hb_retnint( lValue );
}
HB_FUNC( NUMNOT )
{
HB_LONG lValue;
if( __numParam( 1, &lValue ) )
lValue = ( ~lValue ) & 0xffff;
hb_retnint( lValue );
}
HB_FUNC( NUMLOW )
{
HB_LONG lValue;
if( __numParam( 1, &lValue ) )
lValue &= 0xff;
hb_retnint( lValue );
}
HB_FUNC( NUMHIGH )
{
HB_LONG lValue;
if( __numParam( 1, &lValue ) /* && lValue == lValue & 0xffff */ )
lValue = ( lValue >> 8 ) & 0xff;
hb_retnint( lValue );
}
HB_FUNC( NUMROL )
{
HB_LONG lValue, lShift;
if( __numParam( 1, &lValue ) && lValue == ( lValue & 0xffff ) &&
__numParam( 2, &lShift ) && lShift == ( lShift & 0xffff ) )
{
if( ISLOG( 3 ) && hb_parl( 3 ) )
{
USHORT us = ( USHORT ) ( lValue & 0xff ) << ( lShift & 0x07 );
lValue = ( lValue & 0xff00 ) | ( us & 0xff ) | ( us >> 8 );
}
else
{
lValue <<= ( lShift & 0x0f );
lValue = ( lValue & 0xffff ) | ( lValue >> 16 );
}
}
else
lValue = -1;
hb_retnint( lValue );
}
HB_FUNC( NUMMIRR )
{
HB_LONG lValue;
if( __numParam( 1, &lValue ) && lValue == ( lValue & 0xffff ) )
{
USHORT usBits = ISLOG( 2 ) && hb_parl( 2 ) ? 8 : 16;
USHORT usResult = ( USHORT ) ( lValue >> usBits );
do
{
usResult <<= 1;
if( lValue && 1 )
usResult |=1;
lValue >>= 1;
}
while( --usBits );
lValue = usResult;
}
else
lValue = -1;
hb_retnint( lValue );
}
HB_FUNC( CLEARBIT )
{
int iPCount = hb_pcount(), iBit, i = 1;
HB_LONG lValue;
if( __numParam( 1, &lValue ) )
{
while( --iPCount )
{
iBit = hb_parni( ++i );
if( iBit < 1 || iBit > 64 )
break;
lValue &= ~( ( ( HB_LONG ) 1 ) << ( iBit - 1 ) );
}
if( iPCount )
lValue = -1;
}
hb_retnint( lValue );
}
HB_FUNC( SETBIT )
{
int iPCount = hb_pcount(), iBit, i = 1;
HB_LONG lValue;
if( __numParam( 1, &lValue ) )
{
while( --iPCount )
{
iBit = hb_parni( ++i );
if( iBit < 1 || iBit > 64 )
break;
lValue |= ( ( HB_LONG ) 1 ) << ( iBit - 1 );
}
if( iPCount )
lValue = -1;
}
hb_retnint( lValue );
}
HB_FUNC( ISBIT )
{
HB_LONG lValue;
if( __numParam( 1, &lValue ) )
{
int iBit = hb_parni( 2 );
if( iBit )
--iBit;
lValue &= ( ( HB_LONG ) 1 ) << iBit;
}
else
lValue = 0;
hb_retl( lValue != 0 );
}