* harbour/Makefile
+ harbour/make_bsd.sh
+ harbour/make_drw.sh
* harbour/make_tgz.sh
+ harbour/bin/hb-func.sh
* harbour/bin/pack_src.sh
+ harbour/bin/postinst.bat
+ harbour/bin/postinst.sh
* harbour/config/dir.cf
* harbour/config/bsd/gcc.cf
* harbour/config/bsd/global.cf
+ harbour/config/darwin/dir.cf
+ harbour/config/darwin/gcc.cf
+ harbour/config/darwin/global.cf
+ harbour/config/darwin/install.cf
* harbour/config/dos/dir.cf
* harbour/config/dos/global.cf
* harbour/config/dos/install.cf
* harbour/config/dos/owatcom.cf
* harbour/config/dos/watcom.cf
* harbour/config/linux/gcc.cf
* harbour/config/linux/global.cf
* harbour/contrib/Makefile
* harbour/contrib/dot/pp_harb.ch
* harbour/contrib/libct/Makefile
* harbour/contrib/libct/bit1.c
* harbour/contrib/libct/bit2.c
* harbour/contrib/libct/bit3.c
* harbour/contrib/libct/files.c
* harbour/contrib/libct/ftoc.c
- harbour/contrib/libct/invertwin.prg
+ harbour/contrib/libct/invrtwin.prg
* harbour/contrib/libct/keyset.c
* harbour/contrib/libct/makefile.bc
* harbour/contrib/libmisc/dates2.c
* harbour/contrib/rdd_ads/ads1.c
* harbour/contrib/rdd_ads/adsfunc.c
* harbour/contrib/samples/date.c
* harbour/include/dbinfo.ch
* harbour/include/hbapi.h
* harbour/include/hbapicdp.h
* harbour/include/hbapifs.h
* harbour/include/hbapigt.h
* harbour/include/hbapiitm.h
* harbour/include/hbcomp.h
* harbour/include/hbdate.h
* harbour/include/hbdbf.h
* harbour/include/hbdbferr.h
* harbour/include/hbdefs.h
* harbour/include/hbexprb.c
* harbour/include/hbexprc.c
* harbour/include/hbexprop.h
* harbour/include/hbmacro.h
* harbour/include/hbmath.h
* harbour/include/hbpcode.h
* harbour/include/hbrddcdx.h
* harbour/include/hbrdddbf.h
* harbour/include/hbrdddbt.h
* harbour/include/hbrddfpt.h
* harbour/include/hbrddntx.h
* harbour/include/hbset.h
* harbour/include/hbsetup.h
* harbour/include/set.ch
* harbour/source/common/Makefile
* harbour/source/common/expropt1.c
* harbour/source/common/expropt2.c
- harbour/source/common/hbffind.c
* harbour/source/common/hbfsapi.c
* harbour/source/common/hbstr.c
* harbour/source/common/hbver.c
+ harbour/source/common/hbverdsp.c
* harbour/source/compiler/genc.c
* harbour/source/compiler/gencli.c
* harbour/source/compiler/harbour.c
* harbour/source/compiler/harbour.l
* harbour/source/compiler/harbour.slx
* harbour/source/compiler/harbour.sly
* harbour/source/compiler/harbour.y
* harbour/source/compiler/hbfix.c
* harbour/source/compiler/hbpcode.c
* harbour/source/compiler/hbusage.c
* harbour/source/compiler/simplex.c
* harbour/source/macro/macro.l
* harbour/source/macro/macro.slx
* harbour/source/macro/macro.y
* harbour/source/pp/ppcore.c
* harbour/source/rdd/dbcmd.c
* harbour/source/rdd/dbf1.c
* harbour/source/rdd/dbfcdx/dbfcdx1.c
- harbour/source/rdd/dbfcdx/dbfcdx1.h
* harbour/source/rdd/dbffpt/dbffpt1.c
* harbour/source/rdd/dbfntx/dbfntx1.c
* harbour/source/rtl/Makefile
* harbour/source/rtl/abs.c
* harbour/source/rtl/at.c
* harbour/source/rtl/datec.c
* harbour/source/rtl/dates.c
* harbour/source/rtl/dateshb.c
* harbour/source/rtl/datesx.c
* harbour/source/rtl/empty.c
* harbour/source/rtl/errorapi.c
* harbour/source/rtl/errorint.c
* harbour/source/rtl/filesys.c
* harbour/source/rtl/fstemp.c
+ harbour/source/rtl/hbffind.c
* harbour/source/rtl/hbrandom.c
* harbour/source/rtl/idle.c
* harbour/source/rtl/inkey.c
* harbour/source/rtl/math.c
* harbour/source/rtl/minmax.c
* harbour/source/rtl/pad.c
* harbour/source/rtl/padc.c
* harbour/source/rtl/padl.c
* harbour/source/rtl/padr.c
* harbour/source/rtl/philes.c
* harbour/source/rtl/round.c
* harbour/source/rtl/soundex.c
* harbour/source/rtl/str.c
* harbour/source/rtl/strcase.c
* harbour/source/rtl/strmatch.c
* harbour/source/rtl/strtran.c
* harbour/source/rtl/strzero.c
* harbour/source/rtl/substr.c
* harbour/source/rtl/val.c
* harbour/source/rtl/gtcrs/gtcrs.c
* harbour/source/rtl/gtcrs/kbdcrs.c
* harbour/source/rtl/gtdos/gtdos.c
* harbour/source/rtl/gtsln/gtsln.c
* harbour/source/rtl/gtsln/kbsln.c
* harbour/source/rtl/gtsln/keytrans.c
* harbour/source/vm/arrays.c
* harbour/source/vm/codebloc.c
* harbour/source/vm/estack.c
* harbour/source/vm/eval.c
* harbour/source/vm/extend.c
* harbour/source/vm/hvm.c
* harbour/source/vm/itemapi.c
* harbour/source/vm/macro.c
* harbour/source/vm/memvars.c
* harbour/source/vm/runner.c
* harbour/tests/bldtest/bldtest.c
* harbour/utils/hbtest/hbtest.prg
* harbour/utils/hbtest/rt_misc.prg
* harbour/utils/hbtest/rt_str.prg
* Sorry but it's too much modification for full description
cvs diff gives file 785982 bytes length. So I only count the
main things:
! cleand the code (no more warning messages under Linux and GCC and
DOS OpenWatcom) - some of them were real bugs
! cleaned all endian dependend code I've found - now Harbour can be
compiled on LITLE and BIG endian machines - for some other like
PDP ENDIAN it's enough to define proper macros in hbdefs.h
+ added macros for to get/put values in chosen byte order:
HB_GET_LE_[U]INT{16,24,32,64}( pPtr )
HB_GET_BE_[U]INT{16,24,32,64}( pPtr )
HB_PUT_LE_[U]INT{16,24,32,64}( pPtr, nVal )
HB_PUT_BE_[U]INT{16,24,32,64}( pPtr, nVal )
+ added macro HB_CAST_BYTE_NUMBERS_OFF which disables casting in
HB_{GET|PUT}_{LE|BE}_* macros - it's necessary for some platforms
like ALPHA DEC.
! cleaned the code for 64bit machines
* changed all parameters in hb_date* functions (day, month, year, week)
from LONG to int - it doesn't change binary compatibility for 32bit
machines but can cause troubles with compiling the old source
+ changed HB_IT_LONG type to HB_LONG which is mapped to long long
by default for 32 bit machines.
+ change HB_IT_INTEGER to be real 'int' C type not 'short int'
+ added HB_IS_NUMINT() macro
+ added hb_parnll, hb_stornll, hb_retnll, hbretnlllen, hb_itemPutNLL,
hb_itemPutNLLLen, hb_itemGetNLL which operates on LONGLONG
+ added hb_parnint, hb_stornint, hb_retnint, hb_retnintlen,
hb_itemPutNInt, hb_itemPutNIntLen, hb_itemGetNInt which operates on
HB_LONG
+ added HB_PUSHLONGLONG pcode
+ changed compiler and optimizer to use HB_LONG numbers and reduce
conversion from to double which may damage the 64bit number.
+ common functions for string to number conversions for compiler, RTL
and RDD to reduce problems with differ FL values for the same number:
hb_compStrToNum(), hb_valStrnToNum(), hb_strToNum(), hb_strnToNum()
+ common function hb_numRoun() which uses exactly the same algorithms
as string to number conversion for the same reason - please keep
this functions together.
+ hack inside hb_numRound() similar to the one used by CL5.3
+ hb_numInt() which uses uses the same hack as hb_numRound()
+ rewritten number to string conversion
+ some new string manipulation functions hb_strncpy(), hb_strncat(), ...
They works differ the the C one - always set 0 at the end, the buffer
has to be n+1 bytes length, the n is total size of buffer not the
left free space.
! cleaned some code which operates on ASCIIZ string to avoid potential
buffer overflow
+ updated RDD code - it's the first part - in few days I plan to change
workarea structure in both projects - it will break any 3rd party RDDs
so they have to be updated. I want to add SUPERTABLE into workarea
to allow creating new RDD on-line.
! cleaned the bugs with negating integers - on most machines (like x86)
the integers are not 0 symmetric - it means that x = -x does not work
for {INT,LONG,LONGLONG}_MIN (hb_vmNegate, ABS())
+ cleaned error messages to be Clipper compatible.
+ updated build process for .DEB packages - now hb* scripts and shared
libs are created by standard make install
* added new .prg #defines: __PLATFORM__<cPlatfrom>,
__ARCH{16|32|64}BIT__, __LITTLE_ENDIAN__|__BIG_ENDIAN__|__PDP_ENDIAN__
!!! cPlatfrom can have lower letters (for xHarbour compatibility)
If you do not like it please change it.
* others ...
469 lines
13 KiB
C
469 lines
13 KiB
C
/*
|
|
* $Id$
|
|
*/
|
|
|
|
/*
|
|
* Harbour Project source code:
|
|
* The eval stack management functions
|
|
*
|
|
* Copyright 1999 Antonio Linares <alinares@fivetech.com>
|
|
* 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.
|
|
*
|
|
*/
|
|
|
|
#if defined(HB_INCLUDE_WINEXCHANDLER)
|
|
#define HB_OS_WIN_32_USED
|
|
#endif
|
|
|
|
#include "hbapi.h"
|
|
#include "hbdefs.h"
|
|
#include "hbstack.h"
|
|
#include "hbapiitm.h"
|
|
#include "hbapierr.h"
|
|
|
|
/* ------------------------------- */
|
|
|
|
#if !defined( STACK_INITHB_ITEMS )
|
|
#define STACK_INITHB_ITEMS 200
|
|
#endif
|
|
#if !defined( STACK_EXPANDHB_ITEMS )
|
|
#define STACK_EXPANDHB_ITEMS 20
|
|
#endif
|
|
|
|
HB_STACK hb_stack;
|
|
|
|
HB_STACK HB_EXPORT hb_GetStack( void )
|
|
{
|
|
return hb_stack;
|
|
}
|
|
|
|
/* ------------------------------- */
|
|
|
|
void hb_stackPop( void )
|
|
{
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackPop()"));
|
|
|
|
if( --hb_stack.pPos < hb_stack.pItems )
|
|
hb_errInternal( HB_EI_STACKUFLOW, NULL, NULL, NULL );
|
|
|
|
if( ( * hb_stack.pPos )->type != HB_IT_NIL )
|
|
hb_itemClear( * hb_stack.pPos );
|
|
}
|
|
|
|
void hb_stackDec( void )
|
|
{
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackDec()"));
|
|
|
|
if( --hb_stack.pPos < hb_stack.pItems )
|
|
hb_errInternal( HB_EI_STACKUFLOW, NULL, NULL, NULL );
|
|
}
|
|
|
|
void hb_stackFree( void )
|
|
{
|
|
LONG i;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackFree()"));
|
|
|
|
i = hb_stack.wItems - 1;
|
|
while( i >= 0 )
|
|
hb_xfree( hb_stack.pItems[ i-- ] );
|
|
hb_xfree( hb_stack.pItems );
|
|
}
|
|
|
|
void hb_stackPush( void )
|
|
{
|
|
LONG CurrIndex; /* index of current top item */
|
|
LONG TopIndex; /* index of the topmost possible item */
|
|
LONG i;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackPush()"));
|
|
|
|
CurrIndex = hb_stack.pPos - hb_stack.pItems;
|
|
TopIndex = hb_stack.wItems - 1;
|
|
|
|
/* enough room for another item ? */
|
|
if( !( TopIndex > CurrIndex ) )
|
|
{
|
|
LONG BaseIndex; /* index of stack base */
|
|
|
|
BaseIndex = hb_stack.pBase - hb_stack.pItems;
|
|
|
|
/* no, make more headroom: */
|
|
/* hb_stackDispLocal(); */
|
|
hb_stack.pItems = ( HB_ITEM_PTR * ) hb_xrealloc( ( void *)hb_stack.pItems, sizeof( HB_ITEM_PTR ) *
|
|
( hb_stack.wItems + STACK_EXPANDHB_ITEMS ) );
|
|
|
|
/* fix possibly invalid pointers: */
|
|
hb_stack.pPos = hb_stack.pItems + CurrIndex;
|
|
hb_stack.pBase = hb_stack.pItems + BaseIndex;
|
|
hb_stack.wItems += STACK_EXPANDHB_ITEMS;
|
|
for( i=CurrIndex + 1; i < hb_stack.wItems; ++i )
|
|
hb_stack.pItems[ i ] = (HB_ITEM *) hb_xgrab( sizeof( HB_ITEM ) );
|
|
/* hb_stackDispLocal(); */
|
|
}
|
|
|
|
/* now, push it: */
|
|
hb_stack.pPos++;
|
|
( * hb_stack.pPos )->type = HB_IT_NIL;
|
|
}
|
|
|
|
void hb_stackInit( void )
|
|
{
|
|
LONG i;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackInit()"));
|
|
|
|
hb_stack.pItems = ( HB_ITEM_PTR * ) hb_xgrab( sizeof( HB_ITEM_PTR ) * STACK_INITHB_ITEMS );
|
|
hb_stack.pBase = hb_stack.pItems;
|
|
hb_stack.pPos = hb_stack.pItems; /* points to the first stack item */
|
|
hb_stack.wItems = STACK_INITHB_ITEMS;
|
|
|
|
for( i=0; i < hb_stack.wItems; ++i )
|
|
hb_stack.pItems[ i ] = (HB_ITEM *) hb_xgrab( sizeof( HB_ITEM ) );
|
|
}
|
|
|
|
void hb_stackRemove( LONG lUntilPos )
|
|
{
|
|
HB_ITEM_PTR * pEnd = hb_stack.pItems + lUntilPos;
|
|
while( hb_stack.pPos > pEnd )
|
|
hb_stackPop();
|
|
}
|
|
|
|
HB_ITEM_PTR hb_stackNewFrame( HB_STACK_STATE * pStack, USHORT uiParams )
|
|
{
|
|
HB_ITEM_PTR pItem;
|
|
pItem = hb_stackItemFromTop( - uiParams - 2 ); /* procedure name */
|
|
|
|
if( ! HB_IS_SYMBOL( pItem ) )
|
|
{
|
|
/* QUESTION: Is this call needed ? [vszakats] */
|
|
hb_stackDispLocal();
|
|
hb_errInternal( HB_EI_VMNOTSYMBOL, NULL, "hb_vmDo()", NULL );
|
|
}
|
|
|
|
pStack->lBaseItem = hb_stack.pBase - hb_stack.pItems;
|
|
pStack->iStatics = hb_stack.iStatics;
|
|
|
|
pItem->item.asSymbol.lineno = 0;
|
|
pItem->item.asSymbol.paramcnt = uiParams;
|
|
hb_stack.pBase = hb_stack.pItems + pItem->item.asSymbol.stackbase;
|
|
pItem->item.asSymbol.stackbase = pStack->lBaseItem;
|
|
|
|
return pItem;
|
|
}
|
|
|
|
void hb_stackOldFrame( HB_STACK_STATE * pStack )
|
|
{
|
|
while( hb_stack.pPos > hb_stack.pBase )
|
|
hb_stackPop();
|
|
|
|
hb_stack.pBase = hb_stack.pItems + pStack->lBaseItem;
|
|
hb_stack.iStatics = pStack->iStatics;
|
|
}
|
|
|
|
#undef hb_stackItem
|
|
HB_ITEM_PTR hb_stackItem( LONG iItemPos )
|
|
{
|
|
if( iItemPos < 0 )
|
|
hb_errInternal( HB_EI_STACKUFLOW, NULL, NULL, NULL );
|
|
|
|
return ( * ( hb_stack.pItems + iItemPos ) );
|
|
}
|
|
|
|
#undef hb_stackItemFromTop
|
|
HB_ITEM_PTR hb_stackItemFromTop( int nFromTop )
|
|
{
|
|
if( nFromTop > 0 )
|
|
hb_errInternal( HB_EI_STACKUFLOW, NULL, NULL, NULL );
|
|
|
|
return ( * ( hb_stack.pPos + nFromTop ) );
|
|
}
|
|
|
|
#undef hb_stackItemFromBase
|
|
HB_ITEM_PTR hb_stackItemFromBase( int nFromBase )
|
|
{
|
|
if( nFromBase <= 0 )
|
|
hb_errInternal( HB_EI_STACKUFLOW, NULL, NULL, NULL );
|
|
|
|
return ( * ( hb_stack.pBase + nFromBase + 1 ) );
|
|
}
|
|
|
|
#undef hb_stackTopItem
|
|
HB_ITEM_PTR hb_stackTopItem( void )
|
|
{
|
|
return * hb_stack.pPos;
|
|
}
|
|
|
|
#undef hb_stackBaseItem
|
|
HB_ITEM_PTR hb_stackBaseItem( void )
|
|
{
|
|
return * hb_stack.pBase;
|
|
}
|
|
|
|
/* Returns SELF object, an evaluated codeblock or NIL for normal func/proc
|
|
*/
|
|
#undef hb_stackSelfItem
|
|
HB_ITEM_PTR hb_stackSelfItem( void )
|
|
{
|
|
return * ( hb_stack.pBase + 1 );
|
|
}
|
|
|
|
#undef hb_stackTopOffset
|
|
LONG hb_stackTopOffset( void )
|
|
{
|
|
return hb_stack.pPos - hb_stack.pItems;
|
|
}
|
|
|
|
#undef hb_stackBaseOffset
|
|
LONG hb_stackBaseOffset( void )
|
|
{
|
|
return hb_stack.pBase - hb_stack.pItems + 1;
|
|
}
|
|
|
|
|
|
/* NOTE: DEBUG function */
|
|
void hb_stackDispLocal( void )
|
|
{
|
|
PHB_ITEM * pBase;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackDispLocal()"));
|
|
|
|
printf( hb_conNewLine() );
|
|
printf( HB_I_("Virtual Machine Stack Dump at %s(%i):"), ( *(hb_stack.pBase) )->item.asSymbol.value->szName, ( *(hb_stack.pBase) )->item.asSymbol.lineno );
|
|
printf( hb_conNewLine() );
|
|
printf( "--------------------------" );
|
|
|
|
for( pBase = hb_stack.pBase; pBase <= hb_stack.pPos; pBase++ )
|
|
{
|
|
printf( hb_conNewLine() );
|
|
|
|
switch( hb_itemType( *pBase ) )
|
|
{
|
|
case HB_IT_NIL:
|
|
printf( HB_I_("NIL ") );
|
|
break;
|
|
|
|
case HB_IT_ARRAY:
|
|
if( hb_arrayIsObject( *pBase ) )
|
|
printf( HB_I_("OBJECT = %s "), hb_objGetClsName( *pBase ) );
|
|
else
|
|
printf( HB_I_("ARRAY ") );
|
|
break;
|
|
|
|
case HB_IT_BLOCK:
|
|
printf( HB_I_("BLOCK ") );
|
|
break;
|
|
|
|
case HB_IT_DATE:
|
|
{
|
|
char szDate[ 9 ];
|
|
printf( HB_I_("DATE = \"%s\" "), hb_itemGetDS( *pBase, szDate ) );
|
|
}
|
|
break;
|
|
|
|
case HB_IT_DOUBLE:
|
|
printf( HB_I_("DOUBLE = %f "), hb_itemGetND( *pBase ) );
|
|
break;
|
|
|
|
case HB_IT_LOGICAL:
|
|
printf( HB_I_("LOGICAL = %s "), hb_itemGetL( *pBase ) ? ".T." : ".F." );
|
|
break;
|
|
|
|
case HB_IT_LONG:
|
|
printf( HB_I_("LONG = %" PFHL "i ") , hb_itemGetNInt( *pBase ) );
|
|
break;
|
|
|
|
case HB_IT_INTEGER:
|
|
printf( HB_I_("INTEGER = %i "), hb_itemGetNI( *pBase ) );
|
|
break;
|
|
|
|
case HB_IT_STRING:
|
|
printf( HB_I_("STRING = \"%s\" "), hb_itemGetCPtr( *pBase ) );
|
|
break;
|
|
|
|
case HB_IT_SYMBOL:
|
|
printf( HB_I_("SYMBOL = %s "), ( *pBase )->item.asSymbol.value->szName );
|
|
break;
|
|
|
|
case HB_IT_POINTER:
|
|
printf( HB_I_("POINTER = %p "), ( *pBase )->item.asPointer.value );
|
|
break;
|
|
|
|
default:
|
|
printf( HB_I_("UNKNOWN = TYPE %i "), hb_itemType( *pBase ) );
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
void hb_stackDispCall( void )
|
|
{
|
|
PHB_ITEM * pBase = hb_stack.pBase;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackDispCall()"));
|
|
|
|
while( pBase != hb_stack.pItems )
|
|
{
|
|
char buffer[ HB_SYMBOL_NAME_LEN + HB_SYMBOL_NAME_LEN + 32 ];
|
|
|
|
pBase = hb_stack.pItems + ( *pBase )->item.asSymbol.stackbase;
|
|
|
|
if( ( *( pBase + 1 ) )->type == HB_IT_ARRAY )
|
|
sprintf( buffer, HB_I_("Called from %s:%s(%i)"), hb_objGetClsName( *(pBase + 1) ),
|
|
( *pBase )->item.asSymbol.value->szName,
|
|
( *pBase )->item.asSymbol.lineno );
|
|
else
|
|
sprintf( buffer, HB_I_("Called from %s(%i)"),
|
|
( *pBase )->item.asSymbol.value->szName,
|
|
( *pBase )->item.asSymbol.lineno );
|
|
|
|
hb_conOutErr( buffer, 0 );
|
|
hb_conOutErr( hb_conNewLine(), 0 );
|
|
}
|
|
}
|
|
|
|
/* ------------------------------------------------------------------------ */
|
|
/* The garbage collector interface */
|
|
/* ------------------------------------------------------------------------ */
|
|
|
|
/* Mark all locals as used so they will not be released by the
|
|
* garbage collector
|
|
*/
|
|
void hb_vmIsLocalRef( void )
|
|
{
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_vmIsLocalRef()"));
|
|
|
|
if( hb_stack.pPos > hb_stack.pItems )
|
|
{
|
|
/* the eval stack is not cleared yet */
|
|
HB_ITEM_PTR * pItem = hb_stack.pPos - 1;
|
|
while( pItem != hb_stack.pItems )
|
|
{
|
|
if( ( *pItem )->type & (HB_IT_BYREF | HB_IT_ARRAY | HB_IT_BLOCK) )
|
|
hb_gcItemRef( *pItem );
|
|
--pItem;
|
|
}
|
|
}
|
|
}
|
|
|
|
#ifdef HB_INCLUDE_WINEXCHANDLER
|
|
|
|
#if defined(HB_OS_WIN_32)
|
|
|
|
WINBASEAPI LONG WINAPI UnhandledExceptionFilter( struct _EXCEPTION_POINTERS * ExceptionInfo )
|
|
{
|
|
PHB_ITEM *pBase = hb_stack.pBase;
|
|
|
|
char msg[ ( HB_SYMBOL_NAME_LEN + HB_SYMBOL_NAME_LEN + 32 ) * 32 ];
|
|
|
|
HB_SYMBOL_UNUSED( ExceptionInfo );
|
|
|
|
msg[ 0 ] = '\0';
|
|
|
|
do
|
|
{
|
|
char buffer[ HB_SYMBOL_NAME_LEN + HB_SYMBOL_NAME_LEN + 32 ];
|
|
|
|
if( ( *( pBase + 1 ) )->type == HB_IT_ARRAY )
|
|
sprintf( buffer, HB_I_("Called from %s:%s(%i)\n"), hb_objGetClsName( *(pBase + 1) ),
|
|
( *pBase )->item.asSymbol.value->szName,
|
|
( *pBase )->item.asSymbol.lineno );
|
|
else
|
|
sprintf( buffer, HB_I_("Called from %s(%i)\n"),
|
|
( *pBase )->item.asSymbol.value->szName,
|
|
( *pBase )->item.asSymbol.lineno );
|
|
|
|
strcat( msg, buffer );
|
|
|
|
pBase = hb_stack.pItems + ( *pBase )->item.asSymbol.stackbase;
|
|
}
|
|
while( pBase != hb_stack.pItems );
|
|
|
|
MessageBox( NULL, msg, HB_I_("Harbour Exception"), MB_ICONSTOP );
|
|
|
|
return EXCEPTION_EXECUTE_HANDLER; /* EXCEPTION_CONTINUE_SEARCH; */
|
|
}
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
#if defined(HB_OS_OS2)
|
|
|
|
ULONG _System OS2TermHandler(PEXCEPTIONREPORTRECORD p1,
|
|
PEXCEPTIONREGISTRATIONRECORD p2,
|
|
PCONTEXTRECORD p3,
|
|
PVOID pv) {
|
|
|
|
PHB_ITEM *pBase = hb_stack.pBase;
|
|
|
|
HB_SYMBOL_UNUSED(p1);
|
|
HB_SYMBOL_UNUSED(p2);
|
|
HB_SYMBOL_UNUSED(p3);
|
|
HB_SYMBOL_UNUSED(pv);
|
|
|
|
/* Don't print stack trace if inside unwind, normal process termination or process killed or
|
|
during debugging */
|
|
if (p1->ExceptionNum != XCPT_UNWIND && p1->ExceptionNum < XCPT_BREAKPOINT) {
|
|
|
|
fprintf(stderr, HB_I_("\nException %lx at address %p \n"), p1->ExceptionNum, p1->ExceptionAddress);
|
|
|
|
do
|
|
{
|
|
if( ( *( pBase + 1 ) )->type == HB_IT_ARRAY )
|
|
fprintf( stderr, HB_I_("Called from %s:%s(%i)\n"), hb_objGetClsName( *(pBase + 1) ),
|
|
( *pBase )->item.asSymbol.value->szName,
|
|
( *pBase )->item.asSymbol.lineno );
|
|
else
|
|
fprintf( stderr, HB_I_("Called from %s(%i)\n"),
|
|
( *pBase )->item.asSymbol.value->szName,
|
|
( *pBase )->item.asSymbol.lineno );
|
|
|
|
pBase = hb_stack.pItems + ( *pBase )->item.asSymbol.stackbase;
|
|
}
|
|
while( pBase != hb_stack.pItems );
|
|
}
|
|
|
|
return XCPT_CONTINUE_SEARCH; /* Exception not resolved... */
|
|
}
|
|
#endif
|