* 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 ...
453 lines
14 KiB
C
453 lines
14 KiB
C
/*
|
|
* $Id$
|
|
*/
|
|
|
|
/*
|
|
* Harbour Project source code:
|
|
* The Date API (C level)
|
|
*
|
|
* 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.
|
|
*
|
|
*/
|
|
|
|
/*
|
|
* The following parts are Copyright of the individual authors.
|
|
* www - http://www.harbour-project.org
|
|
*
|
|
* Copyright 1999 Jose Lalin <dezac@corevia.com>
|
|
* hb_dateDOW()
|
|
*
|
|
* Copyright 1999 David G. Holm <dholm@jsd-llc.com>
|
|
* hb_dateFormat()
|
|
*
|
|
* Copyright 1999-2001 Viktor Szakats <viktor.szakats@syenar.hu>
|
|
* hb_dateEncStr()
|
|
* hb_dateDecStr()
|
|
* hb_dateStrPut()
|
|
* hb_dateStrGet()
|
|
*
|
|
* See doc/license.txt for licensing terms.
|
|
*
|
|
*/
|
|
|
|
#define HB_OS_WIN_32_USED
|
|
|
|
#include <ctype.h>
|
|
#include <time.h>
|
|
|
|
#include "hbapi.h"
|
|
#include "hbdate.h"
|
|
|
|
#ifdef HB_C52_STRICT
|
|
#define HB_DATE_YEAR_LIMIT 2999
|
|
#else
|
|
#define HB_DATE_YEAR_LIMIT 9999
|
|
#endif
|
|
|
|
LONG HB_EXPORT hb_dateEncode( int iYear, int iMonth, int iDay )
|
|
{
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_dateEncode(%d, %d, %d)", iYear, iMonth, iDay));
|
|
|
|
/* Perform date validation */
|
|
if( iYear >= 1 && iYear <= HB_DATE_YEAR_LIMIT &&
|
|
iMonth >= 1 && iMonth <= 12 &&
|
|
iDay >= 1 )
|
|
{
|
|
/* Month, year, and lower day limits are simple,
|
|
but upper day limit is dependent upon month and leap year */
|
|
int auiDayLimit[ 12 ] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
|
|
|
|
if( ( ( iYear % 4 == 0 && iYear % 100 != 0 ) || iYear % 400 == 0 ) )
|
|
auiDayLimit[ 1 ] = 29;
|
|
|
|
if( iDay <= auiDayLimit[ iMonth - 1 ] )
|
|
{
|
|
int iFactor = ( iMonth < 3 ) ? -1 : 0;
|
|
|
|
return ( ( LONG )( iFactor + 4800 + iYear ) * 1461 / 4 ) +
|
|
( ( LONG )( iMonth - 2 - ( iFactor * 12 ) ) * 367 ) / 12 -
|
|
( ( LONG )( ( iFactor + 4900 + iYear ) / 100 ) * 3 / 4 ) +
|
|
( LONG ) iDay - 32075;
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
void HB_EXPORT hb_dateDecode( LONG lJulian, int *piYear, int *piMonth, int *piDay )
|
|
{
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_dateDecode(%ld, %p, %p, %p)", lJulian, piYear, piMonth, piDay));
|
|
|
|
if( lJulian > 0 )
|
|
{
|
|
LONG U, V, W, X;
|
|
|
|
lJulian += 68569;
|
|
W = ( lJulian * 4 ) / 146097;
|
|
lJulian -= ( ( 146097 * W ) + 3 ) / 4;
|
|
X = 4000 * ( lJulian + 1 ) / 1461001;
|
|
lJulian -= ( ( 1461 * X ) / 4 ) - 31;
|
|
V = 80 * lJulian / 2447;
|
|
U = V / 11;
|
|
|
|
*piYear = (int) ( X + U + ( W - 49 ) * 100 );
|
|
*piMonth = (int) ( V + 2 - ( U * 12 ) );
|
|
*piDay = (int) ( lJulian - ( 2447 * V / 80 ) );
|
|
}
|
|
else
|
|
{
|
|
*piYear =
|
|
*piMonth =
|
|
*piDay = 0;
|
|
}
|
|
}
|
|
|
|
void HB_EXPORT hb_dateStrPut( char * szDate, int iYear, int iMonth, int iDay )
|
|
{
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_dateStrPut(%p, %d, %d, %d)", szDate, iYear, iMonth, iDay));
|
|
|
|
if( iYear >= 0 && iMonth && iDay )
|
|
{
|
|
szDate[ 0 ] = ( ( iYear % 10000 ) / 1000 ) + '0';
|
|
szDate[ 1 ] = ( ( iYear % 1000 ) / 100 ) + '0';
|
|
szDate[ 2 ] = ( ( iYear % 100 ) / 10 ) + '0';
|
|
szDate[ 3 ] = ( iYear % 10 ) + '0';
|
|
|
|
szDate[ 4 ] = ( iMonth / 10 ) + '0';
|
|
szDate[ 5 ] = ( iMonth % 10 ) + '0';
|
|
|
|
szDate[ 6 ] = ( iDay / 10 ) + '0';
|
|
szDate[ 7 ] = ( iDay % 10 ) + '0';
|
|
}
|
|
else if ( iYear || iMonth || iDay )
|
|
memset( szDate, '0', 8 );
|
|
else
|
|
memset( szDate, ' ', 8 );
|
|
}
|
|
|
|
void HB_EXPORT hb_dateStrGet( const char * szDate, int * piYear, int * piMonth, int * piDay )
|
|
{
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_dateStrGet(%s, %p, %p, %p)", szDate, piYear, piMonth, piDay));
|
|
|
|
if( szDate && szDate[ 8 ] == '\0' )
|
|
{
|
|
/* Date string has correct length, so attempt to convert */
|
|
*piYear = ( ( USHORT ) ( szDate[ 0 ] - '0' ) * 1000 ) +
|
|
( ( USHORT ) ( szDate[ 1 ] - '0' ) * 100 ) +
|
|
( ( USHORT ) ( szDate[ 2 ] - '0' ) * 10 ) +
|
|
( USHORT ) ( szDate[ 3 ] - '0' );
|
|
*piMonth = ( ( szDate[ 4 ] - '0' ) * 10 ) + ( szDate[ 5 ] - '0' );
|
|
*piDay = ( ( szDate[ 6 ] - '0' ) * 10 ) + ( szDate[ 7 ] - '0' );
|
|
}
|
|
else
|
|
{
|
|
/* Date string missing or bad length, so force an empty date */
|
|
*piYear =
|
|
*piMonth =
|
|
*piDay = 0;
|
|
}
|
|
}
|
|
|
|
/* This function always closes the date with a zero byte, so it needs a
|
|
9 character long buffer. */
|
|
|
|
char HB_EXPORT * hb_dateDecStr( char * szDate, LONG lJulian )
|
|
{
|
|
int iYear, iMonth, iDay;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_dateDecStr(%p, %ld)", szDate, lJulian));
|
|
|
|
hb_dateDecode( lJulian, &iYear, &iMonth, &iDay );
|
|
hb_dateStrPut( szDate, iYear, iMonth, iDay );
|
|
szDate[ 8 ] = '\0';
|
|
|
|
return szDate;
|
|
}
|
|
|
|
LONG HB_EXPORT hb_dateEncStr( char * szDate )
|
|
{
|
|
int iYear, iMonth, iDay;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_dateEncStr(%s)", szDate));
|
|
|
|
hb_dateStrGet( szDate, &iYear, &iMonth, &iDay );
|
|
|
|
return hb_dateEncode( iYear, iMonth, iDay );
|
|
}
|
|
|
|
char HB_EXPORT * hb_dateFormat( const char * szDate, char * szFormattedDate, const char * szDateFormat )
|
|
{
|
|
/*
|
|
* NOTE: szFormattedDate must point to a buffer of at least 11 bytes.
|
|
* szDateFormat must point to a buffer holding the date format to use.
|
|
*/
|
|
int format_count, digit_count, size;
|
|
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_dateFormat(%s, %p, %s)", szDate, szFormattedDate, szDateFormat));
|
|
|
|
/*
|
|
* Determine the maximum size of the formatted date string
|
|
*/
|
|
size = strlen( szDateFormat );
|
|
if( size > 10 ) size = 10;
|
|
|
|
if( szDate && szFormattedDate && strlen( szDate ) == 8 ) /* A valid date is always 8 characters */
|
|
{
|
|
const char * szPtr;
|
|
int digit;
|
|
BOOL used_d, used_m, used_y;
|
|
|
|
format_count = 0;
|
|
used_d = used_m = used_y = FALSE;
|
|
szPtr = szDateFormat;
|
|
|
|
while( format_count < size )
|
|
{
|
|
digit = toupper( *szPtr );
|
|
szPtr++;
|
|
digit_count = 1;
|
|
while( toupper( *szPtr ) == digit && format_count < size )
|
|
{
|
|
szPtr++;
|
|
if( format_count + digit_count < size ) digit_count++;
|
|
}
|
|
switch( digit )
|
|
{
|
|
case 'D':
|
|
switch( digit_count )
|
|
{
|
|
case 4:
|
|
if( ! used_d && format_count < size )
|
|
{
|
|
/* szFormattedDate[ format_count++ ] = '0'; */
|
|
szFormattedDate[ format_count++ ] = szDate[ 6 ];
|
|
digit_count--;
|
|
}
|
|
case 3:
|
|
if( ! used_d && format_count < size )
|
|
{
|
|
/* szFormattedDate[ format_count++ ] = '0'; */
|
|
szFormattedDate[ format_count++ ] = szDate[ 6 ];
|
|
digit_count--;
|
|
}
|
|
case 2:
|
|
if( ! used_d && format_count < size )
|
|
{
|
|
szFormattedDate[ format_count++ ] = szDate[ 6 ];
|
|
digit_count--;
|
|
}
|
|
default:
|
|
if( ! used_d && format_count < size )
|
|
{
|
|
szFormattedDate[ format_count++ ] = szDate[ 7 ];
|
|
digit_count--;
|
|
}
|
|
while( digit_count-- > 0 && format_count < size ) szFormattedDate[ format_count++ ] = digit;
|
|
}
|
|
used_d = TRUE;
|
|
break;
|
|
|
|
case 'M':
|
|
switch ( digit_count )
|
|
{
|
|
case 4:
|
|
if( ! used_m && format_count < size )
|
|
{
|
|
/* szFormattedDate[ format_count++ ] = '0'; */
|
|
szFormattedDate[ format_count++ ] = szDate[ 4 ];
|
|
digit_count--;
|
|
}
|
|
case 3:
|
|
if( ! used_m && format_count < size )
|
|
{
|
|
/* szFormattedDate[ format_count++ ] = '0'; */
|
|
szFormattedDate[ format_count++ ] = szDate[ 4 ];
|
|
digit_count--;
|
|
}
|
|
case 2:
|
|
if( ! used_m && format_count < size )
|
|
{
|
|
szFormattedDate[ format_count++ ] = szDate[ 4 ];
|
|
digit_count--;
|
|
}
|
|
default:
|
|
if( ! used_m && format_count < size )
|
|
{
|
|
szFormattedDate[ format_count++ ] = szDate[ 5 ];
|
|
digit_count--;
|
|
}
|
|
while( digit_count-- > 0 && format_count < size ) szFormattedDate[ format_count++ ] = digit;
|
|
}
|
|
used_m = TRUE;
|
|
break;
|
|
|
|
case 'Y':
|
|
switch( digit_count )
|
|
{
|
|
case 4:
|
|
if( ! used_y && format_count < size )
|
|
{
|
|
szFormattedDate[ format_count++ ] = szDate[ 0 ];
|
|
digit_count--;
|
|
}
|
|
|
|
case 3:
|
|
if( ! used_y && format_count < size )
|
|
{
|
|
szFormattedDate[ format_count++ ] = szDate[ 1 ];
|
|
digit_count--;
|
|
}
|
|
|
|
case 2:
|
|
if( ! used_y && format_count < size )
|
|
{
|
|
szFormattedDate[ format_count++ ] = szDate[ 2 ];
|
|
digit_count--;
|
|
}
|
|
|
|
default:
|
|
if( ! used_y && format_count < size )
|
|
{
|
|
szFormattedDate[ format_count++ ] = szDate[ 3 ];
|
|
digit_count--;
|
|
}
|
|
while( digit_count-- > 0 && format_count < size ) szFormattedDate[ format_count++ ] = digit;
|
|
}
|
|
used_y = TRUE;
|
|
break;
|
|
|
|
default:
|
|
while( digit_count-- > 0 && format_count < size ) szFormattedDate[ format_count++ ] = digit;
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
/* Not a valid date string, so return a blank date with separators */
|
|
format_count = size; /* size is either 8 or 10 */
|
|
strncpy( szFormattedDate, szDateFormat, size );
|
|
|
|
for( digit_count = 0; digit_count < size; digit_count++ )
|
|
{
|
|
switch( szFormattedDate[ digit_count ] )
|
|
{
|
|
case 'D':
|
|
case 'd':
|
|
case 'M':
|
|
case 'm':
|
|
case 'Y':
|
|
case 'y':
|
|
szFormattedDate[ digit_count ] = ' ';
|
|
}
|
|
}
|
|
}
|
|
|
|
szFormattedDate[ format_count ] = '\0';
|
|
|
|
return szFormattedDate;
|
|
}
|
|
|
|
int HB_EXPORT hb_dateDOW( int iYear, int iMonth, int iDay )
|
|
{
|
|
HB_TRACE(HB_TR_DEBUG, ("hb_dateDOW(%d, %d, %d)", iYear, iMonth, iDay));
|
|
|
|
if( iMonth < 3 )
|
|
{
|
|
iMonth += 13;
|
|
iYear--;
|
|
}
|
|
else
|
|
iMonth++;
|
|
|
|
return ( iDay + 26 * iMonth / 10 +
|
|
iYear + iYear / 4 - iYear / 100 + iYear / 400 + 6 ) % 7 + 1;
|
|
}
|
|
|
|
void HB_EXPORT hb_dateToday( int * piYear, int * piMonth, int * piDay )
|
|
{
|
|
#if defined(HB_OS_WIN_32)
|
|
{
|
|
SYSTEMTIME st;
|
|
GetLocalTime( &st );
|
|
|
|
*piYear = st.wYear;
|
|
*piMonth = st.wMonth;
|
|
*piDay = st.wDay;
|
|
}
|
|
#else
|
|
{
|
|
time_t t;
|
|
struct tm * oTime;
|
|
|
|
time( &t );
|
|
oTime = localtime( &t );
|
|
|
|
*piYear = oTime->tm_year + 1900;
|
|
*piMonth = oTime->tm_mon + 1;
|
|
*piDay = oTime->tm_mday;
|
|
}
|
|
#endif
|
|
}
|
|
|
|
/* NOTE: The passed buffer must be at least 9 chars long */
|
|
|
|
void HB_EXPORT hb_dateTimeStr( char * pszTime )
|
|
{
|
|
#if defined(HB_OS_WIN_32)
|
|
{
|
|
SYSTEMTIME st;
|
|
GetLocalTime( &st );
|
|
sprintf( pszTime, "%02d:%02d:%02d", st.wHour, st.wMinute, st.wSecond );
|
|
}
|
|
#else
|
|
{
|
|
time_t t;
|
|
struct tm * oTime;
|
|
|
|
time( &t );
|
|
oTime = localtime( &t );
|
|
sprintf( pszTime, "%02d:%02d:%02d", oTime->tm_hour, oTime->tm_min, oTime->tm_sec );
|
|
}
|
|
#endif
|
|
}
|