* harbour/bin/hb-func.sh
! restored default optimization flag (-O3) in hb* scripts
* harbour/harbour.spec
! fixed recent modification
* harbour/contrib/rddads/ads1.c
* harbour/contrib/rddads/adsfunc.c
* harbour/contrib/hbmisc/strfmt.c
* harbour/contrib/hbcrypt/sha1.c
! fixed wrongly used C reference operator
* harbour/contrib/hbwin/win_prn2.c
* harbour/contrib/hbwin/wapi_commctrl.c
* harbour/source/vm/maindllp.c
! fixes for unicode builds
* harbour/include/std.ch
+ added SET TIME FORMAT [TO] <f>
* harbour/include/set.ch
* harbour/include/hbset.h
* harbour/source/vm/set.c
+ added _SET_TIMEFORMAT
The folowing modifiers are supported:
hh - hours
mm - minutes
ss - seconds
fff - fraction part of seconds
p - 1-st letter from PM / AM signature. When used time is shown
in 12 hour format otherwise 24 hour format is used
ex: Set( __SET_TIMEFORMAT, "hh:mm pm" )
default _SET_TIMEFORMAT value is "hh:mm:ss:fff"
+ added C function: char * hb_setGetTimeFormat( void );
* harbour/include/hbpp.h
* harbour/source/pp/ppcore.c
+ added support for timestamp constant values in the form:
t"YYYY-MM-DD HH:MM:SS.fff"
The exact accepted timestamp pattern is is:
YYYY-MM-DD [H[H][:M[M][:S[S][.f[f[f[f]]]]]]] [PM|AM]
i.e.:
tValue := t"2009-03-21 5:31:45.437 PM"
or:
YYYY-MM-DDT[H[H][:M[M][:S[S][.f[f[f[f]]]]]]] [PM|AM]
with literal "T" as date and time part delimiters (XML timestamp
format), i.e.:
tValue := t"2009-03-21T17:31:45.437"
The folowing characters can be used as date delimiters: "-", "/", "."
if PM or AM is used HH is in range < 1 : 12 > otherwise
in range < 0 : 23 >
* harbour/source/compiler/complex.c
* harbour/source/compiler/harbour.y
* harbour/source/compiler/harbour.yyc
* harbour/source/compiler/harbour.yyh
+ added support for t"YYYY-MM-DD HH:MM:SS.fff" time stamp constant
to compiler
+ added support for VFP datetime constant values:
{ ^ [ YYYY-MM-DD [,] ] [ HH[:MM[:SS][.FFF]] [AM|PM] ] }
The following characters can be used as date delimiters: "-", "/".
Dot "." as date delimiter is not supported.
There is no limit on number of characters in YYYY, MM, DD, HH, MM,
SS, FFF parts. Important is only their value. This is the format
in semi PP notation:
{ ^ <YEAR> <sep:/-> <MONTH> <sep:/-> <DAY> [[<sep2:,>]
[ <HOUR> [ : <MIN> [ : <SEC> [ . <FRAQ> ] ] ] [AM|PP] ] }
In practice it allows to also parse xHarbour datetime constant
values with compatible conditions though xHarbour support onlu "/"
as date delimiter.
NOTE: there is one important difference to VFP and xHarbour in
decoding above format. In VFP and xHarbour when date part is
missing then it's set by default to: 1899-12-30 so this code:
{ ^ 12:00 }
gived the same results as:
{ ^ 1899/12/30 12:00 }
Harbour does not set any default date value when timestamp
constant value contains only time part.
If you want we can change it for strict VFP compatiblity.
Now this extension is enabled by default for testing. In the future
it will be probably covered by HB_COMPAT_FOXPRO macro.
* harbour/source/macro/macro.yyc
* harbour/source/macro/macro.y
* harbour/source/macro/macro.yyh
* harbour/source/macro/macrolex.c
+ added support for t"YYYY-MM-DD HH:MM:SS.fff" time stamp constant
to macro compiler
* harbour/include/hbmacro.h
* harbour/source/vm/macro.c
+ added new function:
void hb_macroGenPushTimeStamp( LONG lDate, LONG lTime, HB_COMP_DECL );
* harbour/include/hberrors.h
* harbour/source/compiler/hbgenerr.c
+ added new compile time error: "Invalid timestamp constant '%s'"
* harbour/source/compiler/cmdcheck.c
* use Harbour API timestamp functions instead of calling system
functions
* harbour/include/hbpcode.h
* harbour/source/compiler/hbfix.c
* harbour/source/compiler/hbpcode.c
* harbour/source/compiler/hbdead.c
* harbour/source/compiler/genc.c
* harbour/source/compiler/gencc.c
* harbour/source/compiler/hblbl.c
* harbour/source/compiler/hbstripl.c
* harbour/source/compiler/hbopt.c
+ added new PCODE HB_P_PUSHTIMESTAMP (replaced one unused PCODE value)
to store timestamp constant values in the PCODE
* harbour/include/hbcomp.h
* harbour/source/compiler/hbmain.c
+ added new function:
void hb_compGenPushTimeStamp( LONG lDate, LONG lTime, HB_COMP_DECL );
* harbour/include/hbexprop.h
* harbour/source/common/expropt1.c
+ added new C functions:
HB_EXPR_PTR hb_compExprNewTimeStamp( LONG, LONG, HB_COMP_DECL );
* harbour/include/hbexprb.c
* harbour/include/hbcompdf.h
* harbour/source/common/expropt2.c
+ added timestamp expressions support
+ added compile time optimization for timestamp expressions
* updated function optimization for timestamp expressions
* harbour/include/hbdate.h
* harbour/source/common/hbdate.c
* changed hb_dateMilliSeconds() to return UTC julian timestamp in
milliseconds
* changed existing seconds, time and timestamp functions to operate
on common OS specific functions to eliminate possible problems
with different OS time counters
+ added new functions to operates on time and timestamp values.
See source code for details.
+ harbour/source/rtl/cputime.c
* moved double hb_secondsCPU( int n ) function to separate file
* harbour/source/rtl/seconds.c
- removed old version of date/seconds functions
* harbour/source/vm/hashes.c
* harbour/source/vm/arrays.c
+ added support for timestamp values as hash item indexes
* harbour/source/vm/hashfunc.c
+ added support for find timestamp values in hash and array items
by simple date value in AScan(), hb_HScan(), hb_AScan() and hb_RAScan()
functions when exact comparison is not used.
* harbour/source/vm/asort.c
+ added support for sorting timestamp values
* harbour/source/vm/classes.c
+ added support for timestamp scallar classes
+ added support for timestamp typed instance variables
* harbour/source/vm/memvars.c
+ added support for timestamp values in .mem files
* harbour/source/vm/estack.c
+ show timestamp values in stack dump
* harbour/include/hbapi.h
* harbour/source/vm/arrays.c
+ added new C functions:
double hb_arrayGetTD( PHB_ITEM pArray, ULONG ulIndex );
BOOL hb_arraySetTD( PHB_ITEM pArray, ULONG ulIndex, double dTimeStamp )
BOOL hb_arrayGetTDT( PHB_ITEM pArray, ULONG ulIndex,
LONG * plJulian, LONG * plMilliSec );
BOOL hb_arraySetTDT( PHB_ITEM pArray, ULONG ulIndex,
LONG lJulian, LONG lMilliSec );
* harbour/include/hbapi.h
* harbour/source/vm/extend.c
+ accept timestamp items in date functions - use only date part of
timestamp value
+ added new C functions:
double hb_partd( int iParam, ... );
BOOL hb_partdt( LONG * plJulian, LONG * plMilliSec , int iParam, ... );
void hb_rettd( double dTimeStamp );
void hb_rettdt( LONG lJulian, LONG lMilliSec );
int hb_stortd( double dTimeStamp, int iParam, ... );
int hb_stortdt( LONG lJulian, LONG lMilliSec, int iParam, ... );
* harbour/include/hbapiitm.h
* harbour/source/vm/itemapi.c
+ accept timestamp items in date functions - use only date part of
timestamp value
+ added new C functions:
char * hb_itemGetTS( PHB_ITEM pItem, char * szDateTime );
PHB_ITEM hb_itemPutTS( PHB_ITEM pItem, const char * szDateTime );
double hb_itemGetTD( PHB_ITEM pItem );
PHB_ITEM hb_itemPutTD( PHB_ITEM pItem, double dTimeStamp )
BOOL hb_itemGetTDT( PHB_ITEM pItem, LONG * plJulian, LONG * plMilliSec );
PHB_ITEM hb_itemPutTDT( PHB_ITEM pItem, LONG lJulian, LONG lMilliSec );
+ support for timestamp items in hb_itemString(), hb_itemPadConv() and
hb_itemTypeStr() functions
* harbour/include/hbvm.h
* harbour/include/hbxvm.h
* harbour/include/hbapi.h
* harbour/source/vm/hvm.c
+ added HB_IT_TIMESTAMP items
* modified HB_IT_DATE internal item structure to use common structure
with HB_IT_TIMESTAMP - it simplifies HVM code and eliminates additional
RT conditions.
+ added HB_IS_TIMESTAMP() and ISTIMESTAMP() macros
+ added HB_IS_DATETIME() and ISDATETIME() macros - they return true
if item/parameter is DATE or TIMESTAMP type.
+ added void hb_vmPushTimeStamp( long lJulian, long lMilliSec );
and xhb_vmPushTimeStamp()
+ added support for timestamp values in relational operators:
<, <=, >, >=, =, ==
When two timestamp values are compared then VM compares date and
time parts in both values.
When date and timestamp values are used in <, <=, >, >=, = operations
then VM compares only date part in both values.
When date and timestamp values are used in == operation then VM
compares date part in both values and then check if time part
of timestamp value is 0.
+ added support for timestamp values in + and - math operations.
The following rules are used in timestamp arithmetic:
<t> + <t> => <t>
<t> - <t> => <n>
<t> + <n> => <t>
<n> + <t> => <t>
<t> - <n> => <t>
<d> + <t> => <t>
<t> + <d> => <t>
<d> - <t> => <n>
<t> - <d> => <n>
When number is result or argument of timestamp operation then the
its integer part is a number of day and fractional part is the time.
* harbour/source/rtl/dateshb.c
+ added new .prg functions to mange date and timestamp values:
HB_DATETIME() -> <tTimeStamp>
HB_CTOD( <cDate> [, <cDateFormat> ] ) -> <dDate>
HB_DTOC( <dDate> [, <cDateFormat> ] ) -> <cDate>
HB_NTOT( <nValue> ) -> <tTimeStamp>
HB_TTON( <tTimeStamp> ) -> <nValue>
HB_TTOC( <tTimeStamp>, [ <cDateFormat> ] [, <cTimeFormat> ] ) ->
<cTimeStamp>
HB_CTOT( <cTimeStamp>, [ <cDateFormat> ] [, <cTimeFormat> ] ) ->
<tTimeStamp>
HB_TTOS( <tTimeStamp> ) -> <cYYYYMMDDHHMMSSFFF>
HB_STOT( <cDateTime> ) -> <tTimeStamp>
<cDateTime> should be in one of the above form:
- "YYYYMMDDHHMMSSFFF"
- "YYYYMMDDHHMMSSFF"
- "YYYYMMDDHHMMSSF"
- "YYYYMMDDHHMMSS"
- "YYYYMMDDHHMM"
- "YYYYMMDDHH"
- "YYYYMMDD"
- "HHMMSSFFF"
- "HHMMSSF"
- "HHMMSS"
- "HHMM"
- "HH"
Important is number of digits.
HB_TSTOSTR( <tTimeStamp> ) -> <cTimeStamp> // YYYY-MM-DD HH:MM:SS.fff
HB_STRTOTS( <cTimeStamp> ) -> <tTimeStamp>
<cTimeStamp> should be in one of the above form:
YYYY-MM-DD [H[H][:M[M][:S[S][.f[f[f[f]]]]]]] [PM|AM]
YYYY-MM-DDT[H[H][:M[M][:S[S][.f[f[f[f]]]]]]] [PM|AM]
The folowing characters can be used as date delimiters: "-", "/", "."
T - is literal "T" - it's for XML timestamp format
if PM or AM is used HH is in range < 1 : 12 > otherwise
in range < 0 : 23 >
HB_HOUR( <tTimeStamp> ) -> <nHour>
HB_MINUTE( <tTimeStamp> ) -> <nMinute>
HB_SEC( <tTimeStamp> ) -> <nSeconds> // with milliseconds
* harbour/source/rtl/datec.c
+ accept timestamp parameters in CMONTH() and CDOW() functions
* harbour/source/rtl/empty.c
+ added support for timestamp items
* harbour/source/rtl/itemseri.c
+ added support for timestamp items serialization
* harbour/source/rtl/minmax.c
+ added support for timestamp values to MIN() and MAX() functions.
when only one of given parameters is timestamp value and other
is date value and date parts are equal then always date item
is returned as both MIN() or MAX() value.
* harbour/source/rtl/dates.c
+ added new C functions: hb_timeFormat(), hb_timeUnformat(),
hb_timeStampFormat(), hb_timeStampUnformat()
* harbour/source/rtl/valtype.c
+ added .prg functions: HB_ISDATETIME(), HB_ISTIMESTAMP()
* harbour/source/rtl/transfrm.c
+ added support for timestamp items formatting.
+ added new function modifier @T.
When @T is used without @D then only time part of timestamp value
is formatted and return.
When @D is used without @T then only date part of timestamp value
is formatted and return.
* harbour/source/rtl/tbrowse.prg
+ display timestamp values
* harbour/source/rtl/philes.c
+ accept timestamp value as second parameter of HB_FSETDATETIME()
function
+ store file data and time in second parameter of HB_FGETDATETIME()
as timestamp value.
Old parameters (2-dDate, 3-cTime) are still supported but please think
about removing them - they are redundant.
* harbour/source/rtl/filesys.c
* updated function names
* harbour/source/rdd/dbf1.c
+ added native support for time and timestamp fields
* harbour/include/hbrddcdx.h
* harbour/include/hbrddnsx.h
* harbour/source/rdd/dbfntx/dbfntx1.c
* harbour/source/rdd/dbfcdx/dbfcdx1.c
* harbour/source/rdd/dbfnsx/dbfnsx1.c
* harbour/source/rdd/dbffpt/dbffpt1.c
+ added support for indexing timestamp fields
+ added support for using DATE values with timestamp fields
which replicate HVM behavior.
SEEK and SEEKLAST with date value when active index is on
timestamp positions to 1-st or last record where date part
of indexed timesamp value is equal.
Settings scopes to date values when active index is on timestamp
value reduce the visible record range to these ones which have
date part of timestamp value in the range of dates values used
for scopes. It possible to mix date and timestamp values in scope
and set one scope to date value and the second to timesamp.
* harbour/source/rdd/sdf1.c
* harbour/source/rdd/delim1.c
+ added support for exporting timestamp fields
* harbour/source/rdd/dbsql.c
! fixed typo in logical value export
+ export timestamp fields.
Please update the format to given SQL syntax.
* harbour/contrib/hbct/files.c
+ changed SETFDATI() to optionally accept timestamp parameter
instead of two parameters dDate and cTime
* harbour/contrib/hbct/misc1.c
+ added timestamp support to XTOC() function
* harbour/contrib/hbct/misc2.c
+ added timestamp support to COMPLEMENT() function
* harbour/contrib/hbct/dattime2.c
+ accept timestamp values in ADDMONTH(), DOY(), ISLEAP(), QUARTER()
LASTDAYOM(), WEEK() functions
* harbour/contrib/hbmzip/hbmzip.c
+ updated HB_ZipFileCreate( hZip, cZipName, tDateTime, cTime, ... )
functions to optionaly accept timestamp value in 3-rd parameter
instead od dDate, and cTime in 3-rd and 4-th parameters.
+ updated HB_UnzipFileInfo( hUnzip, @cZipName, @tDateTime, @cTime, ... )
to return timestamp value in 3-rd parameter instead of date value.
TODO: Please think about removing 4-th parameter from:
HB_ZipFileCreate( hZip, cZipName, tDateTime, cTime, ... )
HB_UnzipFileInfo( hUnzip, @cZipName, @tDateTime, @cTime, ... )
Now it's redundant.
* harbour/contrib/hbmzip/readme.txt
* updated parameters description for above functions
* harbour/contrib/hbnf/descendn.c
+ added timestamp support to FT_DESCEND() function
* harbour/contrib/hbclipsm/date.c
+ accept timestamp values in DATEASAGE(), DATEASARRAY() and DATEISLEAP()
functions
* harbour/contrib/hbmisc/dates2.c
+ accept timestamp values in ISLEAPYEAR(), DAYSINMONTH(), EOM(), BOM(),
WOM(), WOY(), EOY() and BOY() functions
The following contrib files should be updated but I'm leaving it to
other developers who want to keep this code alive:
contrib/hbtip/utils.c
contrib/hbvpdf/hbvpdf.prg
contrib/hbvpdf/hbvpdft.prg
contrib/hbwin/win_dll.c
some minor cleanups if necessary and authors will find
timestamp values usable
contrib/hbole/ole2.c
contrib/hbwin/win_ole.c
add support for timestamp values in OLE
contrib/rddado/adordd.prg
contrib/rddads/ads1.c
contrib/rddads/adsx.c
contrib/rddsql/...
add support for timestamp values in RDDs
Warning: this implementation is not xHarbour compatible. There are many
important differences. Mostly on C level and used API. Please be careful
in porting xHarbour source code to Harbour.
1288 lines
31 KiB
C
1288 lines
31 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.
|
|
*
|
|
*/
|
|
|
|
#define HB_STACK_PRELOAD
|
|
|
|
#define INCL_DOSPROCESS
|
|
|
|
|
|
#include "hbvmopt.h"
|
|
#include "hbapi.h"
|
|
#include "hbapicls.h"
|
|
#include "hbstack.h"
|
|
#include "hbapiitm.h"
|
|
#include "hbapierr.h"
|
|
#include "hbapirdd.h"
|
|
#include "hbdate.h"
|
|
|
|
/* ------------------------------- */
|
|
|
|
#if !defined( STACK_INITHB_ITEMS )
|
|
#define STACK_INITHB_ITEMS 200
|
|
#endif
|
|
#if !defined( STACK_EXPANDHB_ITEMS )
|
|
#define STACK_EXPANDHB_ITEMS 20
|
|
#endif
|
|
|
|
|
|
/* ------------------------------- */
|
|
|
|
#if defined( HB_MT_VM )
|
|
|
|
# include "hbthread.h"
|
|
|
|
static HB_CRITICAL_NEW( TSD_counter );
|
|
static int s_iTSDCounter = 0;
|
|
|
|
# ifdef HB_USE_TLS
|
|
|
|
/* compiler has native support for TLS */
|
|
# if defined( HB_STACK_MACROS )
|
|
# if defined( __BORLANDC__ )
|
|
PHB_STACK HB_TLS_ATTR hb_stack_ptr = NULL;
|
|
# else
|
|
HB_TLS_ATTR PHB_STACK hb_stack_ptr = NULL;
|
|
# endif
|
|
# else
|
|
static HB_TLS_ATTR PHB_STACK hb_stack_ptr = NULL;
|
|
# endif
|
|
|
|
# define hb_stack_alloc() do { hb_stack_ptr = ( PHB_STACK ) \
|
|
hb_xgrab( sizeof( HB_STACK ) ); } while ( 0 )
|
|
# define hb_stack_dealloc() do { hb_xfree( hb_stack_ptr ); \
|
|
hb_stack_ptr = NULL; } while ( 0 )
|
|
# define hb_stack_ready() (hb_stack_ptr != NULL)
|
|
|
|
#else
|
|
|
|
/* compiler has no native TLS support, we have to implement it ourselves */
|
|
# if defined( HB_STACK_MACROS )
|
|
HB_TLS_KEY hb_stack_key;
|
|
# else
|
|
static HB_TLS_KEY hb_stack_key;
|
|
# define hb_stack_ptr ( ( PHB_STACK ) hb_tls_get( hb_stack_key ) )
|
|
# endif
|
|
static volatile BOOL s_fInited = FALSE;
|
|
# define hb_stack_alloc() do { if( !s_fInited ) { \
|
|
hb_tls_init( hb_stack_key ); \
|
|
s_fInited = TRUE; } \
|
|
hb_tls_set( hb_stack_key, \
|
|
hb_xgrab( sizeof( HB_STACK ) ) ); \
|
|
} while ( 0 )
|
|
# define hb_stack_dealloc() do { hb_xfree( ( void * ) hb_tls_get( hb_stack_key ) ); \
|
|
hb_tls_set( hb_stack_key, NULL ); } \
|
|
while ( 0 )
|
|
# define hb_stack_ready() ( s_fInited && hb_tls_get( hb_stack_key ) )
|
|
|
|
#endif /* HB_USE_TLS */
|
|
|
|
# if !defined( HB_STACK_PRELOAD )
|
|
# undef hb_stack
|
|
# define hb_stack ( * hb_stack_ptr )
|
|
# endif
|
|
|
|
#else
|
|
|
|
/* no MT mode */
|
|
# if defined( HB_STACK_MACROS )
|
|
HB_STACK hb_stack;
|
|
# else
|
|
static HB_STACK hb_stack;
|
|
# endif
|
|
|
|
# define hb_stack_alloc()
|
|
# define hb_stack_dealloc()
|
|
# define hb_stack_ready() (TRUE)
|
|
|
|
#endif /* HB_MT_VM */
|
|
|
|
/* ------------------------------- */
|
|
|
|
static BYTE s_byDirBuffer[ _POSIX_PATH_MAX + 1 ];
|
|
static HB_IOERRORS s_IOErrors;
|
|
|
|
/* ------------------------------- */
|
|
|
|
static HB_SYMB s_initSymbol = { "hb_stackInit", { HB_FS_STATIC }, { NULL }, NULL };
|
|
|
|
/* ------------------------------- */
|
|
|
|
static void hb_stack_init( PHB_STACK pStack )
|
|
{
|
|
LONG i;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stack_init(%p)", pStack));
|
|
|
|
memset( pStack, 0, sizeof( HB_STACK ) );
|
|
|
|
pStack->pItems = ( PHB_ITEM * ) hb_xgrab( sizeof( PHB_ITEM ) * STACK_INITHB_ITEMS );
|
|
pStack->pBase = pStack->pItems;
|
|
pStack->pPos = pStack->pItems; /* points to the first stack item */
|
|
pStack->wItems = STACK_INITHB_ITEMS;
|
|
pStack->pEnd = pStack->pItems + pStack->wItems;
|
|
|
|
for( i = 0; i < pStack->wItems; ++i )
|
|
{
|
|
pStack->pItems[ i ] = ( PHB_ITEM ) hb_xgrab( sizeof( HB_ITEM ) );
|
|
pStack->pItems[ i ]->type = HB_IT_NIL;
|
|
}
|
|
|
|
pStack->pPos++;
|
|
hb_itemPutSymbol( * pStack->pItems, &s_initSymbol );
|
|
( * pStack->pItems )->item.asSymbol.stackstate = &pStack->state;
|
|
|
|
pStack->rdd.uiCurrArea = 1;
|
|
pStack->iKeyPoll = 1;
|
|
}
|
|
|
|
static void hb_stack_destroy_TSD( PHB_STACK pStack )
|
|
{
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stack_destroy_TSD(%p)", pStack));
|
|
|
|
while( pStack->iTSD )
|
|
{
|
|
if( pStack->pTSD[pStack->iTSD].pTSD )
|
|
{
|
|
if( pStack->pTSD[pStack->iTSD].pTSD->pCleanFunc )
|
|
pStack->pTSD[pStack->iTSD].pTSD->pCleanFunc(
|
|
pStack->pTSD[pStack->iTSD].value );
|
|
hb_xfree( pStack->pTSD[pStack->iTSD].value );
|
|
#if !defined( HB_MT_VM )
|
|
pStack->pTSD[pStack->iTSD].pTSD->iHandle = 0;
|
|
#endif
|
|
}
|
|
if( --pStack->iTSD == 0 )
|
|
{
|
|
hb_xfree( pStack->pTSD );
|
|
pStack->pTSD = NULL;
|
|
}
|
|
}
|
|
}
|
|
|
|
static void hb_stack_free( PHB_STACK pStack )
|
|
{
|
|
LONG i;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stack_free(%p)", pStack));
|
|
|
|
hb_stack_destroy_TSD( pStack );
|
|
|
|
if( pStack->privates.stack )
|
|
{
|
|
hb_xfree( pStack->privates.stack );
|
|
pStack->privates.stack = NULL;
|
|
pStack->privates.size = pStack->privates.count =
|
|
pStack->privates.base = 0;
|
|
}
|
|
i = pStack->wItems - 1;
|
|
while( i >= 0 )
|
|
hb_xfree( pStack->pItems[ i-- ] );
|
|
hb_xfree( pStack->pItems );
|
|
pStack->pItems = pStack->pPos = pStack->pBase = NULL;
|
|
#if defined( HB_MT_VM )
|
|
if( pStack->byDirBuffer )
|
|
{
|
|
hb_xfree( pStack->byDirBuffer );
|
|
pStack->byDirBuffer = NULL;
|
|
}
|
|
if( pStack->iDynH )
|
|
{
|
|
hb_xfree( pStack->pDynH );
|
|
pStack->pDynH = NULL;
|
|
pStack->iDynH = 0;
|
|
}
|
|
#endif
|
|
}
|
|
|
|
void hb_stackDestroyTSD( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackDestroyTSD()"));
|
|
|
|
hb_stack_destroy_TSD( &hb_stack );
|
|
}
|
|
|
|
void * hb_stackGetTSD( PHB_TSD pTSD )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackGetTSD(%p)", pTSD));
|
|
|
|
#if defined( HB_MT_VM )
|
|
if( pTSD->iHandle == 0 || pTSD->iHandle > hb_stack.iTSD ||
|
|
hb_stack.pTSD[pTSD->iHandle].pTSD == NULL )
|
|
{
|
|
if( pTSD->iHandle == 0 )
|
|
{
|
|
hb_threadEnterCriticalSection( &TSD_counter );
|
|
/* repeated test protected by mutex to avoid race condition */
|
|
if( pTSD->iHandle == 0 )
|
|
pTSD->iHandle = ++s_iTSDCounter;
|
|
hb_threadLeaveCriticalSection( &TSD_counter );
|
|
}
|
|
|
|
if( pTSD->iHandle > hb_stack.iTSD )
|
|
{
|
|
hb_stack.pTSD = ( PHB_TSD_HOLDER )
|
|
hb_xrealloc( hb_stack.pTSD, ( pTSD->iHandle + 1 ) *
|
|
sizeof( HB_TSD_HOLDER ) );
|
|
memset( &hb_stack.pTSD[hb_stack.iTSD + 1], 0,
|
|
( pTSD->iHandle - hb_stack.iTSD ) * sizeof( HB_TSD_HOLDER ) );
|
|
hb_stack.iTSD = pTSD->iHandle;
|
|
}
|
|
#else
|
|
if( pTSD->iHandle == 0 )
|
|
{
|
|
ULONG ulSize = ( hb_stack.iTSD + 2 ) * sizeof( HB_TSD_HOLDER );
|
|
if( hb_stack.iTSD == 0 )
|
|
{
|
|
hb_stack.pTSD = ( PHB_TSD_HOLDER ) hb_xgrab( ulSize );
|
|
memset( hb_stack.pTSD, 0, ulSize );
|
|
}
|
|
else
|
|
{
|
|
hb_stack.pTSD = ( PHB_TSD_HOLDER ) hb_xrealloc( hb_stack.pTSD, ulSize );
|
|
}
|
|
pTSD->iHandle = ++hb_stack.iTSD;
|
|
#endif
|
|
|
|
hb_stack.pTSD[pTSD->iHandle].pTSD = pTSD;
|
|
hb_stack.pTSD[pTSD->iHandle].value = hb_xgrab( pTSD->iSize );
|
|
memset( hb_stack.pTSD[pTSD->iHandle].value, 0, pTSD->iSize );
|
|
if( pTSD->pInitFunc )
|
|
pTSD->pInitFunc( hb_stack.pTSD[pTSD->iHandle].value );
|
|
}
|
|
return hb_stack.pTSD[pTSD->iHandle].value;
|
|
}
|
|
|
|
void * hb_stackTestTSD( PHB_TSD pTSD )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackTestTSD(%p)", pTSD));
|
|
|
|
#if defined( HB_MT_VM )
|
|
return ( pTSD->iHandle && pTSD->iHandle <= hb_stack.iTSD ) ?
|
|
hb_stack.pTSD[pTSD->iHandle].value : NULL;
|
|
#else
|
|
return pTSD->iHandle ? hb_stack.pTSD[pTSD->iHandle].value : NULL;
|
|
#endif
|
|
}
|
|
|
|
void hb_stackReleaseTSD( PHB_TSD pTSD )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackReleaseTSD(%p)", pTSD));
|
|
|
|
if( pTSD->iHandle && pTSD->iHandle <= hb_stack.iTSD &&
|
|
hb_stack.pTSD[pTSD->iHandle].value )
|
|
{
|
|
if( pTSD->pCleanFunc )
|
|
pTSD->pCleanFunc( hb_stack.pTSD[pTSD->iHandle].value );
|
|
hb_xfree( hb_stack.pTSD[pTSD->iHandle].value );
|
|
hb_stack.pTSD[pTSD->iHandle].value = NULL;
|
|
hb_stack.pTSD[pTSD->iHandle].pTSD = NULL;
|
|
pTSD->iHandle = 0;
|
|
/* TODO: add recovery system to not lose TSD handles and
|
|
* make this functionality more general and public
|
|
* for 3-rd party developers
|
|
*/
|
|
}
|
|
}
|
|
|
|
void hb_stackInit( void )
|
|
{
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackInit()"));
|
|
|
|
#if defined( HB_MT_VM )
|
|
hb_stack_alloc();
|
|
#endif
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
hb_stack_init( &hb_stack );
|
|
}
|
|
}
|
|
|
|
void hb_stackFree( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackFree()"));
|
|
|
|
hb_stack_free( &hb_stack );
|
|
|
|
#if defined( HB_MT_VM )
|
|
hb_stack_dealloc();
|
|
#endif
|
|
}
|
|
|
|
#if defined( HB_MT_VM )
|
|
|
|
#undef hb_stackList
|
|
void * hb_stackList( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackList()"));
|
|
|
|
return hb_stack.pStackLst;
|
|
}
|
|
|
|
#undef hb_stackListSet
|
|
void hb_stackListSet( void * pStackLst )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackListSet(%p)", pStackLst));
|
|
|
|
hb_stack.pStackLst = pStackLst;
|
|
}
|
|
|
|
#undef hb_stackIdSetActionRequest
|
|
void hb_stackIdSetActionRequest( void * pStackId, USHORT uiAction )
|
|
{
|
|
( ( PHB_STACK ) pStackId )->uiActionRequest = uiAction;
|
|
}
|
|
|
|
#undef hb_stackDynHandlesCount
|
|
int hb_stackDynHandlesCount( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackDynHandlesCount()"));
|
|
|
|
return hb_stack.iDynH;
|
|
}
|
|
|
|
PHB_DYN_HANDLES hb_stackGetDynHandle( PHB_DYNS pDynSym )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
int iDynSym;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackGetDynHandle()"));
|
|
|
|
iDynSym = pDynSym->uiSymNum;
|
|
if( iDynSym > hb_stack.iDynH )
|
|
{
|
|
hb_stack.pDynH = ( PHB_DYN_HANDLES ) hb_xrealloc( hb_stack.pDynH,
|
|
iDynSym * sizeof( HB_DYN_HANDLES ) );
|
|
memset( &hb_stack.pDynH[ hb_stack.iDynH ], 0,
|
|
( iDynSym - hb_stack.iDynH ) * sizeof( HB_DYN_HANDLES ) );
|
|
hb_stack.iDynH = iDynSym;
|
|
}
|
|
|
|
return &hb_stack.pDynH[ iDynSym - 1 ];
|
|
}
|
|
|
|
void hb_stackClearMemvars( int iExcept )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
int iDynSym;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackClearMemvars(%d)", iExcept));
|
|
|
|
iDynSym = hb_stack.iDynH;
|
|
while( --iDynSym >= 0 )
|
|
{
|
|
if( hb_stack.pDynH[ iDynSym ].pMemvar && iDynSym != iExcept )
|
|
{
|
|
PHB_ITEM pMemvar = ( PHB_ITEM ) hb_stack.pDynH[ iDynSym ].pMemvar;
|
|
hb_stack.pDynH[ iDynSym ].pMemvar = NULL;
|
|
hb_memvarValueDecRef( pMemvar );
|
|
}
|
|
}
|
|
}
|
|
|
|
#undef hb_stackQuitState
|
|
BOOL hb_stackQuitState( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return hb_stack.uiQuitState != 0;
|
|
}
|
|
|
|
#undef hb_stackSetQuitState
|
|
void hb_stackSetQuitState( USHORT uiState )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
hb_stack.uiQuitState = uiState;
|
|
}
|
|
|
|
#undef hb_stackUnlock
|
|
int hb_stackUnlock( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return ++hb_stack.iUnlocked;
|
|
}
|
|
|
|
#undef hb_stackLock
|
|
int hb_stackLock( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return --hb_stack.iUnlocked;
|
|
}
|
|
#endif
|
|
|
|
#undef hb_stackKeyPolls
|
|
int * hb_stackKeyPolls( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackKeyPolls()"));
|
|
|
|
return &hb_stack.iKeyPoll;
|
|
}
|
|
|
|
#undef hb_stackDebugRequest
|
|
BOOL * hb_stackDebugRequest( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackDebugRequest()"));
|
|
|
|
return &hb_stack.fDebugRequest;
|
|
}
|
|
|
|
#undef hb_stackDebugInfo
|
|
void ** hb_stackDebugInfo( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackDebugInfo()"));
|
|
|
|
return &hb_stack.pDebugInfo;
|
|
}
|
|
|
|
#undef hb_stackGetPrivateStack
|
|
PHB_PRIVATE_STACK hb_stackGetPrivateStack( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackGetPrivateStack()"));
|
|
|
|
return &hb_stack.privates;
|
|
}
|
|
|
|
#undef hb_stackSetStruct
|
|
PHB_SET_STRUCT hb_stackSetStruct( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackSetStruct()"));
|
|
|
|
return &hb_stack.set;
|
|
}
|
|
|
|
#undef hb_stackId
|
|
void * hb_stackId( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackId()"));
|
|
|
|
return ( void * ) &hb_stack;
|
|
}
|
|
|
|
#undef hb_stackPop
|
|
void hb_stackPop( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackPop()"));
|
|
|
|
if( --hb_stack.pPos <= hb_stack.pBase )
|
|
hb_errInternal( HB_EI_STACKUFLOW, NULL, NULL, NULL );
|
|
|
|
if( HB_IS_COMPLEX( * hb_stack.pPos ) )
|
|
hb_itemClear( * hb_stack.pPos );
|
|
}
|
|
|
|
#undef hb_stackPopReturn
|
|
void hb_stackPopReturn( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackPopReturn()"));
|
|
|
|
if( HB_IS_COMPLEX( &hb_stack.Return ) )
|
|
hb_itemClear( &hb_stack.Return );
|
|
|
|
if( --hb_stack.pPos <= hb_stack.pBase )
|
|
hb_errInternal( HB_EI_STACKUFLOW, NULL, NULL, NULL );
|
|
|
|
hb_itemRawMove( &hb_stack.Return, * hb_stack.pPos );
|
|
}
|
|
|
|
#undef hb_stackDec
|
|
void hb_stackDec( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackDec()"));
|
|
|
|
if( --hb_stack.pPos <= hb_stack.pBase )
|
|
hb_errInternal( HB_EI_STACKUFLOW, NULL, NULL, NULL );
|
|
}
|
|
|
|
#undef hb_stackDecrease
|
|
void hb_stackDecrease( ULONG ulItems )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackDecrease()"));
|
|
|
|
if( ( hb_stack.pPos -= ulItems ) <= hb_stack.pBase )
|
|
hb_errInternal( HB_EI_STACKUFLOW, NULL, NULL, NULL );
|
|
}
|
|
|
|
#undef hb_stackPush
|
|
void hb_stackPush( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackPush()"));
|
|
|
|
/* enough room for another item ? */
|
|
if( ++hb_stack.pPos == hb_stack.pEnd )
|
|
hb_stackIncrease();
|
|
}
|
|
|
|
#undef hb_stackAllocItem
|
|
HB_ITEM_PTR hb_stackAllocItem( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackAllocItem()"));
|
|
|
|
if( ++hb_stack.pPos == hb_stack.pEnd )
|
|
hb_stackIncrease();
|
|
|
|
return * ( hb_stack.pPos - 1 );
|
|
}
|
|
|
|
#undef hb_stackPushReturn
|
|
void hb_stackPushReturn( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackPushReturn()"));
|
|
|
|
hb_itemRawMove( * hb_stack.pPos, &hb_stack.Return );
|
|
|
|
/* enough room for another item ? */
|
|
if( ++hb_stack.pPos == hb_stack.pEnd )
|
|
hb_stackIncrease();
|
|
}
|
|
|
|
void hb_stackIncrease( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
LONG BaseIndex; /* index of stack base */
|
|
LONG CurrIndex; /* index of current top item */
|
|
LONG EndIndex; /* index of current top item */
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackIncrease()"));
|
|
|
|
BaseIndex = hb_stack.pBase - hb_stack.pItems;
|
|
CurrIndex = hb_stack.pPos - hb_stack.pItems;
|
|
EndIndex = hb_stack.pEnd - hb_stack.pItems;
|
|
|
|
/* no, make more headroom: */
|
|
hb_stack.pItems = ( PHB_ITEM * ) hb_xrealloc( ( void * ) hb_stack.pItems,
|
|
sizeof( PHB_ITEM ) * ( hb_stack.wItems + STACK_EXPANDHB_ITEMS ) );
|
|
|
|
/* fix possibly modified by realloc pointers: */
|
|
hb_stack.pPos = hb_stack.pItems + CurrIndex;
|
|
hb_stack.pBase = hb_stack.pItems + BaseIndex;
|
|
hb_stack.wItems += STACK_EXPANDHB_ITEMS;
|
|
hb_stack.pEnd = hb_stack.pItems + hb_stack.wItems;
|
|
|
|
do
|
|
{
|
|
hb_stack.pItems[ EndIndex ] = ( PHB_ITEM ) hb_xgrab( sizeof( HB_ITEM ) );
|
|
hb_stack.pItems[ EndIndex ]->type = HB_IT_NIL;
|
|
}
|
|
while( ++EndIndex < hb_stack.wItems );
|
|
}
|
|
|
|
void hb_stackRemove( LONG lUntilPos )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
HB_ITEM_PTR * pEnd = hb_stack.pItems + lUntilPos;
|
|
|
|
while( hb_stack.pPos > pEnd )
|
|
{
|
|
--hb_stack.pPos;
|
|
if( HB_IS_COMPLEX( * hb_stack.pPos ) )
|
|
hb_itemClear( * hb_stack.pPos );
|
|
}
|
|
}
|
|
|
|
HB_ITEM_PTR hb_stackNewFrame( PHB_STACK_STATE pFrame, USHORT uiParams )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
HB_ITEM_PTR * pBase, pItem;
|
|
|
|
pBase = hb_stack.pPos - uiParams - 2;
|
|
pItem = * pBase; /* procedure symbol */
|
|
|
|
if( ! HB_IS_SYMBOL( pItem ) )
|
|
{
|
|
hb_stackDispLocal();
|
|
hb_errInternal( HB_EI_VMNOTSYMBOL, NULL, "hb_vmDo()", NULL );
|
|
}
|
|
|
|
pFrame->lBaseItem = hb_stack.pBase - hb_stack.pItems;
|
|
pFrame->pStatics = hb_stack.pStatics;
|
|
/* as some type of protection we can set hb_stack.pStatics to NULL here */
|
|
pFrame->ulPrivateBase = hb_memvarGetPrivatesBase();
|
|
pFrame->uiClass = pFrame->uiMethod = pFrame->uiLineNo = 0;
|
|
pFrame->fDebugging = FALSE;
|
|
|
|
pItem->item.asSymbol.stackstate = pFrame;
|
|
pItem->item.asSymbol.paramcnt = uiParams;
|
|
/* set default value of 'paramdeclcnt' - it will be updated
|
|
* in hb_vm[V]Frame only
|
|
*/
|
|
pItem->item.asSymbol.paramdeclcnt = uiParams;
|
|
hb_stack.pBase = pBase;
|
|
|
|
return pItem;
|
|
}
|
|
|
|
void hb_stackOldFrame( PHB_STACK_STATE pFrame )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
if( hb_stack.pPos <= hb_stack.pBase )
|
|
hb_errInternal( HB_EI_STACKUFLOW, NULL, NULL, NULL );
|
|
|
|
do
|
|
{
|
|
--hb_stack.pPos;
|
|
if( HB_IS_COMPLEX( * hb_stack.pPos ) )
|
|
hb_itemClear( * hb_stack.pPos );
|
|
}
|
|
while( hb_stack.pPos > hb_stack.pBase );
|
|
|
|
hb_stack.pBase = hb_stack.pItems + pFrame->lBaseItem;
|
|
hb_stack.pStatics = pFrame->pStatics;
|
|
hb_memvarSetPrivatesBase( pFrame->ulPrivateBase );
|
|
}
|
|
|
|
#undef hb_stackItem
|
|
HB_ITEM_PTR hb_stackItem( LONG iItemPos )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
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 iFromTop )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
if( iFromTop >= 0 )
|
|
hb_errInternal( HB_EI_STACKUFLOW, NULL, NULL, NULL );
|
|
|
|
return * ( hb_stack.pPos + iFromTop );
|
|
}
|
|
|
|
#undef hb_stackItemFromBase
|
|
HB_ITEM_PTR hb_stackItemFromBase( int iFromBase )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
if( iFromBase < 0 )
|
|
hb_errInternal( HB_EI_STACKUFLOW, NULL, NULL, NULL );
|
|
|
|
return * ( hb_stack.pBase + iFromBase + 1 );
|
|
}
|
|
|
|
#undef hb_stackLocalVariable
|
|
HB_ITEM_PTR hb_stackLocalVariable( int *piFromBase )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
HB_ITEM_PTR pBase = *hb_stack.pBase;
|
|
|
|
/*
|
|
if( *piFromBase <= 0 )
|
|
hb_errInternal( HB_EI_STACKUFLOW, NULL, NULL, NULL );
|
|
*/
|
|
if( pBase->item.asSymbol.paramcnt > pBase->item.asSymbol.paramdeclcnt )
|
|
{
|
|
/* function with variable number of parameters:
|
|
* FUNCTION foo( a,b,c,...)
|
|
* LOCAL x,y,z
|
|
* number of passed parameters is bigger then number of declared
|
|
* parameters - skip additional parameters only for local variables
|
|
*/
|
|
if( *piFromBase > pBase->item.asSymbol.paramdeclcnt )
|
|
*piFromBase += pBase->item.asSymbol.paramcnt - pBase->item.asSymbol.paramdeclcnt;
|
|
}
|
|
return * ( hb_stack.pBase + *piFromBase + 1 );
|
|
}
|
|
|
|
#undef hb_stackBaseItem
|
|
HB_ITEM_PTR hb_stackBaseItem( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
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 )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return * ( hb_stack.pBase + 1 );
|
|
}
|
|
|
|
#undef hb_stackReturnItem
|
|
HB_ITEM_PTR hb_stackReturnItem( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackReturnItem()"));
|
|
|
|
return &hb_stack.Return;
|
|
}
|
|
|
|
#undef hb_stackTopOffset
|
|
LONG hb_stackTopOffset( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
return hb_stack.pPos - hb_stack.pItems;
|
|
}
|
|
|
|
#undef hb_stackBaseOffset
|
|
LONG hb_stackBaseOffset( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
return hb_stack.pBase - hb_stack.pItems + 1;
|
|
}
|
|
|
|
#undef hb_stackTotalItems
|
|
LONG hb_stackTotalItems( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
return hb_stack.wItems;
|
|
}
|
|
|
|
#undef hb_stackDateBuffer
|
|
char * hb_stackDateBuffer( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
|
|
return hb_stack.szDate;
|
|
}
|
|
|
|
BYTE * hb_stackDirBuffer( void )
|
|
{
|
|
#if defined( HB_MT_VM )
|
|
if( hb_stack_ready() )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
if( !hb_stack.byDirBuffer )
|
|
hb_stack.byDirBuffer = ( BYTE * ) hb_xgrab( _POSIX_PATH_MAX + 1 );
|
|
return hb_stack.byDirBuffer;
|
|
}
|
|
#endif
|
|
return s_byDirBuffer;
|
|
}
|
|
|
|
PHB_IOERRORS hb_stackIOErrors( void )
|
|
{
|
|
#if defined( HB_MT_VM )
|
|
if( hb_stack_ready() )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return &hb_stack.IOErrors;
|
|
}
|
|
#endif
|
|
return &s_IOErrors;
|
|
}
|
|
|
|
void * hb_stackGetGT( void )
|
|
{
|
|
#if defined( HB_MT_VM )
|
|
if( hb_stack_ready() )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return hb_stack.hGT;
|
|
}
|
|
else
|
|
return NULL;
|
|
#else
|
|
HB_STACK_TLS_PRELOAD
|
|
return hb_stack.hGT;
|
|
#endif
|
|
}
|
|
|
|
void hb_stackSetGT( void * hGT )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
hb_stack.hGT = hGT;
|
|
}
|
|
|
|
|
|
PHB_STACKRDD hb_stackRDD( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return &hb_stack.rdd;
|
|
}
|
|
|
|
|
|
#undef hb_stackGetStaticsBase
|
|
void * hb_stackGetStaticsBase( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return hb_stack.pStatics;
|
|
}
|
|
|
|
#undef hb_stackSetStaticsBase
|
|
void hb_stackSetStaticsBase( void * pBase )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
hb_stack.pStatics = pBase;
|
|
}
|
|
|
|
#undef hb_stackGetRecoverBase
|
|
LONG hb_stackGetRecoverBase( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return hb_stack.lRecoverBase;
|
|
}
|
|
|
|
#undef hb_stackSetRecoverBase
|
|
void hb_stackSetRecoverBase( LONG lBase )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
hb_stack.lRecoverBase = lBase;
|
|
}
|
|
|
|
#undef hb_stackGetActionRequest
|
|
USHORT hb_stackGetActionRequest( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return hb_stack.uiActionRequest;
|
|
}
|
|
|
|
#undef hb_stackSetActionRequest
|
|
void hb_stackSetActionRequest( USHORT uiAction )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
hb_stack.uiActionRequest = uiAction;
|
|
}
|
|
|
|
#undef hb_stackWithObjectItem
|
|
PHB_ITEM hb_stackWithObjectItem( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return hb_stack.lWithObject ?
|
|
* ( hb_stack.pItems + hb_stack.lWithObject ) : NULL;
|
|
}
|
|
|
|
#undef hb_stackWithObjectOffset
|
|
LONG hb_stackWithObjectOffset( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return hb_stack.lWithObject;
|
|
}
|
|
|
|
#undef hb_stackWithObjectSetOffset
|
|
void hb_stackWithObjectSetOffset( LONG lOffset )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
hb_stack.lWithObject = lOffset;
|
|
}
|
|
|
|
#undef hb_stackGetCDP
|
|
void * hb_stackGetCDP( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return hb_stack.pCDP;
|
|
}
|
|
|
|
#undef hb_stackSetCDP
|
|
void hb_stackSetCDP( void * pCDP )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
hb_stack.pCDP = pCDP;
|
|
}
|
|
|
|
#undef hb_stackGetLang
|
|
void * hb_stackGetLang( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return hb_stack.pLang;
|
|
}
|
|
|
|
#undef hb_stackSetLang
|
|
void hb_stackSetLang( void * pLang )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
hb_stack.pLang = pLang;
|
|
}
|
|
|
|
#undef hb_stackGetI18N
|
|
void * hb_stackGetI18N( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return hb_stack.pI18N;
|
|
}
|
|
|
|
#undef hb_stackSetI18N
|
|
void hb_stackSetI18N( void * pI18N )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
hb_stack.pI18N = pI18N;
|
|
}
|
|
|
|
#undef hb_stackItemBasePtr
|
|
PHB_ITEM ** hb_stackItemBasePtr( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
return &hb_stack.pItems;
|
|
}
|
|
|
|
void hb_stackClearMemvarsBase( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
PHB_ITEM pBase;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackClearMemvarsBase()"));
|
|
|
|
pBase = * hb_stack.pBase;
|
|
|
|
while( pBase->item.asSymbol.stackstate->ulPrivateBase != 0 )
|
|
{
|
|
pBase->item.asSymbol.stackstate->ulPrivateBase = 0;
|
|
pBase = * ( hb_stack.pItems + pBase->item.asSymbol.stackstate->lBaseItem );
|
|
}
|
|
}
|
|
|
|
int hb_stackCallDepth( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
LONG lOffset = hb_stack.pBase - hb_stack.pItems;
|
|
int iLevel = 0;
|
|
|
|
while( lOffset > 0 )
|
|
{
|
|
lOffset = ( * ( hb_stack.pItems + lOffset ) )->item.asSymbol.stackstate->lBaseItem;
|
|
++iLevel;
|
|
}
|
|
|
|
return iLevel;
|
|
}
|
|
|
|
LONG hb_stackBaseProcOffset( int iLevel )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
LONG lOffset = hb_stack.pBase - hb_stack.pItems;
|
|
|
|
while( iLevel-- > 0 && lOffset > 0 )
|
|
lOffset = ( * ( hb_stack.pItems + lOffset ) )->item.asSymbol.stackstate->lBaseItem;
|
|
|
|
if( iLevel < 0 && ( lOffset > 0 || HB_IS_SYMBOL( * hb_stack.pItems ) ) )
|
|
return lOffset;
|
|
else
|
|
return -1;
|
|
}
|
|
|
|
void hb_stackBaseProcInfo( char * szProcName, USHORT * puiProcLine )
|
|
{
|
|
/*
|
|
* This function is called by FM module and has to be ready for execution
|
|
* before hb_stack initialization, [druzus]
|
|
* szProcName should be at least HB_SYMBOL_NAME_LEN + 1 bytes buffer
|
|
*/
|
|
|
|
#if defined( HB_MT_VM )
|
|
if( !hb_stack_ready() )
|
|
{
|
|
szProcName[ 0 ] = '\0';
|
|
* puiProcLine = 0;
|
|
return;
|
|
}
|
|
#endif
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
if( hb_stack.pPos > hb_stack.pBase )
|
|
{
|
|
hb_strncpy( szProcName, ( * hb_stack.pBase )->item.asSymbol.value->szName,
|
|
HB_SYMBOL_NAME_LEN );
|
|
* puiProcLine = ( * hb_stack.pBase )->item.asSymbol.stackstate->uiLineNo;
|
|
}
|
|
else
|
|
{
|
|
szProcName[ 0 ] = '\0';
|
|
* puiProcLine = 0;
|
|
}
|
|
}
|
|
}
|
|
|
|
/* NOTE: DEBUG function */
|
|
void hb_stackDispLocal( void )
|
|
{
|
|
HB_STACK_TLS_PRELOAD
|
|
PHB_ITEM * pBase;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackDispLocal()"));
|
|
|
|
printf( "%s", hb_conNewLine() );
|
|
printf( HB_I_("Virtual Machine Stack Dump at %s(%i):"),
|
|
( *hb_stack.pBase )->item.asSymbol.value->szName,
|
|
( *hb_stack.pBase )->item.asSymbol.stackstate->uiLineNo );
|
|
printf( "%s", hb_conNewLine() );
|
|
printf( "--------------------------" );
|
|
|
|
for( pBase = hb_stack.pBase; pBase <= hb_stack.pPos; pBase++ )
|
|
{
|
|
printf( "%s", 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_TIMESTAMP:
|
|
{
|
|
char szDateTime[ 24 ];
|
|
printf( HB_I_("TIMESTAMP = \"%s\" "),
|
|
hb_timeStampStr( szDateTime, ( *pBase )->item.asDateTime.julian,
|
|
( *pBase )->item.asDateTime.time ) );
|
|
}
|
|
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:
|
|
{
|
|
char szBuf[ 24 ];
|
|
printf( HB_I_("LONG = %s ") , hb_numToStr( szBuf, sizeof( szBuf ), 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 )
|
|
{
|
|
char buffer[ HB_SYMBOL_NAME_LEN + HB_SYMBOL_NAME_LEN + 5 + 10 ]; /* additional 10 bytes for line info (%hu) overhead */
|
|
char file[ _POSIX_PATH_MAX + 1 ];
|
|
USHORT uiLine;
|
|
int iLevel;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackDispCall()"));
|
|
|
|
iLevel = 0;
|
|
|
|
while( hb_procinfo( iLevel++, buffer, &uiLine, file ) )
|
|
{
|
|
int l = strlen( buffer );
|
|
hb_snprintf( buffer + l, sizeof( buffer ) - l, "(%hu)%s%s", uiLine, *file ? HB_I_(" in ") : "", file );
|
|
|
|
hb_conOutErr( "Called from ", 0 );
|
|
hb_conOutErr( buffer, 0 );
|
|
hb_conOutErr( hb_conNewLine(), 0 );
|
|
}
|
|
}
|
|
|
|
/* ------------------------------------------------------------------------ */
|
|
/* The garbage collector interface */
|
|
/* ------------------------------------------------------------------------ */
|
|
|
|
#if !defined( HB_MT_VM )
|
|
/* helper function to scan all visible memvar variables
|
|
*/
|
|
static HB_DYNS_FUNC( hb_stackMemvarScan )
|
|
{
|
|
PHB_ITEM pMemvar;
|
|
|
|
HB_SYMBOL_UNUSED( Cargo );
|
|
|
|
pMemvar = hb_dynsymGetMemvar( pDynSymbol );
|
|
if( pMemvar && HB_IS_GCITEM( pMemvar ) )
|
|
hb_gcItemRef( pMemvar );
|
|
|
|
return TRUE;
|
|
}
|
|
#endif
|
|
|
|
/* Mark all memvars (PRIVATEs and PUBLICs) */
|
|
static void hb_stackIsMemvarRef( PHB_STACK pStack )
|
|
{
|
|
/* 1. Mark all hidden memvars (PRIVATEs and PUBLICs) */
|
|
PHB_PRIVATE_STACK pPrivateStack = &pStack->privates;
|
|
ULONG ulCount = pPrivateStack->count;
|
|
|
|
while( ulCount )
|
|
{
|
|
PHB_ITEM pMemvar = pPrivateStack->stack[ --ulCount ].pPrevMemvar;
|
|
if( pMemvar && HB_IS_GCITEM( pMemvar ) )
|
|
hb_gcItemRef( pMemvar );
|
|
}
|
|
/* 2. Mark all visible memvars (PRIVATEs and PUBLICs) */
|
|
#if defined( HB_MT_VM )
|
|
{
|
|
int iDynSym = pStack->iDynH;
|
|
|
|
while( --iDynSym >= 0 )
|
|
{
|
|
PHB_ITEM pMemvar = ( PHB_ITEM ) pStack->pDynH[ iDynSym ].pMemvar;
|
|
if( pMemvar && HB_IS_GCITEM( pMemvar ) )
|
|
hb_gcItemRef( pMemvar );
|
|
}
|
|
}
|
|
#else
|
|
hb_dynsymEval( hb_stackMemvarScan, NULL );
|
|
#endif
|
|
}
|
|
|
|
/* Mark all thread static variables */
|
|
static void hb_stackIsTsdRef( PHB_STACK pStack, PHB_TSD_FUNC pCleanFunc )
|
|
{
|
|
int iTSD = pStack->iTSD;
|
|
|
|
while( iTSD )
|
|
{
|
|
if( pStack->pTSD[iTSD].pTSD &&
|
|
pStack->pTSD[iTSD].pTSD->pCleanFunc == pCleanFunc )
|
|
{
|
|
PHB_ITEM pItem = ( PHB_ITEM ) pStack->pTSD[iTSD].value;
|
|
if( HB_IS_GCITEM( pItem ) )
|
|
hb_gcItemRef( pItem );
|
|
}
|
|
--iTSD;
|
|
}
|
|
}
|
|
|
|
/* Mark all locals as used so they will not be released by the
|
|
* garbage collector
|
|
*/
|
|
void hb_stackIsStackRef( void * pStackId, PHB_TSD_FUNC pCleanFunc )
|
|
{
|
|
PHB_STACK pStack;
|
|
long lCount;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_stackIsStackRef()"));
|
|
|
|
pStack = ( PHB_STACK ) pStackId;
|
|
lCount = pStack->pPos - pStack->pItems;
|
|
while( lCount > 0 )
|
|
{
|
|
PHB_ITEM pItem = pStack->pItems[ --lCount ];
|
|
|
|
if( HB_IS_GCITEM( pItem ) )
|
|
hb_gcItemRef( pItem );
|
|
}
|
|
|
|
hb_gcItemRef( &pStack->Return );
|
|
|
|
hb_stackIsMemvarRef( pStack );
|
|
|
|
if( pCleanFunc )
|
|
hb_stackIsTsdRef( pStack, pCleanFunc );
|
|
}
|