This is the successor to Clipper... Clipper... Clipper, a popular & well-linked CA-Clipper website which I started in 1995 and which went offline in 2002
Tuesday, February 24, 2009
Speedtst.prg by Przemyslaw Czerpak
//-----------------------------------------------//
// SpeedTst.prg
//-----------------------------------------------//
/*
* $Id; speedtst.prg 10153 2009-02-03 02;05;45Z druzus $
*/
/*
* Harbour Project source code;
* HVM speed test program
*
* Copyright 2008 Przemyslaw Czerpak
* www - www.harbour-project.org
*
*/
#define N_TESTS 54
#define N_LOOPS 1000000
#define ARR_LEN 16
#ifdef __XHARBOUR__
/* By default build xHarbour binaries without MT support
* xHarbour needs separated version for MT and ST mode
* because standard MT functions are not available in
* ST libraries.
*/
#ifndef __ST__
#ifndef __MT__
#ifndef MT
#ifndef HB_THREAD_SUPPORT
#define __ST__
#endif
#endif
#endif
#endif
#endif
#command ? => outstd(EOL)
#command ? => outstd(EOL);outstd()
#include "common.ch"
#ifdef __HARBOUR__
#define EOL hb_OSNewLine()
#else
#define HB_SYMBOL_UNUSED( symbol ) ( ( symbol ) )
#ifndef __CLIP__
#xtranslate secondsCPU() => seconds()
#endif
#ifndef EOL
#define EOL chr(10)
#endif
#endif
#xcommand _( [] ) => []
#xcommand TEST ;
[ WITH ] ;
[ INIT ] ;
[ EXIT ] ;
[ INFO ] ;
CODE [<*testExp*>] => ;
func ; ;
local time, i, x ;= nil ; ;
[ local ; ] ;
[ ; ] ;
time ;= secondscpu() ; ;
for i;=1 to N_LOOPS ; ;
[;] ;
next ; ;
time ;= secondscpu() - time ; ;
[ ; ] ;
return { procname() + "; " + iif( <.info.>, <(info)>, # ), time }
proc main( ... )
local aParams, nMT, cExclude, lScale, cParam, cMemTests, lSyntax, i
aParams ;= hb_aparams()
lSyntax ;= lScale ;= .f.
cMemTests ;= "029 030 023 025 027 040 041 043 052 053 019 022 031 032 054 "
cExclude ;= ""
nMT ;= 0
for each cParam in aParams
cParam ;= lower( cParam )
if cParam = "--thread"
if substr( cParam, 9, 1 ) == "="
if isdigit( substr( cParam, 10, 1 ) )
nMT ;= val( substr( cParam, 10 ) )
elseif substr( cParam, 10 ) == "all"
nMT ;= -1
else
lSyntax = .t.
endif
elseif empty( substr( cParam, 9 ) )
nMT ;= -1
else
lSyntax = .t.
endif
elseif cParam = "--exclude="
if substr( cParam, 11 ) == "mem"
cExclude += cMemTests
else
cExclude += strtran( strtran( strtran( substr( cParam, 11 ), ;
".", " " ), ".", " " ), "/", " " ) + " "
endif
elseif cParam = "--only="
cExclude ;= ""
if substr( cParam, 8 ) == "mem"
cParam ;= cMemTests
endif
for i ;= 1 to N_TESTS
if !strzero( i, 3 ) $ cParam
cExclude += strzero( i, 3 ) + " "
endif
next
elseif cParam = "--scale"
lScale ;= .t.
else
lSyntax = .t.
endif
if lSyntax
? "Unknown option;", cParam
? "syntax;", hb_argv( 0 ), "[--thread[=]] [--only=] [--exclude=]"
?
return
endif
next
test( nMT, cExclude, lScale )
return
#ifdef __XHARBOUR__
#xtranslate hb_mtvm() => hb_multiThread()
#xtranslate hb_threadWaitForAll() => WaitForThreads()
#xtranslate hb_mutexNotify() => Notify()
#ifndef __ST__
/* do not expect that this code will work with xHarbour.
* xHarbour has many race conditions which are exploited quite fast
* on real multi CPU machines so it crashes in different places ;-(
* probably this code should be forwared to xHarbour developers as
* some type of MT test
*/
/* this define is only for test if emulation function works
* without running real test which causes that xHarbour crashes
*/
//#define _DUMY_XHB_TEST_
function hb_mutexSubscribe( mtx, nTimeOut, xSubscribed )
local lSubscribed
if valtype( nTimeOut ) == "N"
nTimeOut ;= round( nTimeOut * 1000, 0 )
xSubscribed ;= Subscribe( mtx, nTimeOut, @lSubscribed )
else
xSubscribed ;= Subscribe( mtx )
lSubscribed ;= .t.
endif
return lSubscribed
/* in xHarbour there is race condition in JoinThread() which
* fails if thread end before we call it so we cannot use it ;-(
* this code tries to simulate it and also add support for thread
* return value
*/
function hb_threadStart( ... )
local thId
thId ;= StartThread( @threadFirstFunc(), hb_aParams() )
/* Just like in JoinThread() the same race condition exists in
* GetThreadId() so we will use HVM thread numbers internally
*/
#ifdef _DUMY_XHB_TEST_
return val( substr( hb_aParams()[1], 2 ) )
#else
return GetThreadId( thId )
#endif
function hb_threadJoin( thId, xResult )
xResult ;= results( thId )
return .t.
static function threadFirstFunc( aParams )
local xResult
#ifdef _DUMY_XHB_TEST_
xResult ;= { "skipped test " + aParams[1], val( substr( aParams[1], 2 ) ) + 0.99 }
results( val( substr( aParams[1], 2 ) ), xResult )
#else
xResult ;= hb_execFromArray( aParams )
results( GetThreadId(), xResult )
#endif
return nil
static function results( nThread, xResult )
static s_aResults
static s_mutex
if s_aResults == nil
s_aResults ;= HSetAutoAdd( hash(), .t. )
s_mutex ;= hb_mutexCreate()
endif
if pcount() < s_mutex ="=" xoncecontrol ="=" xoncecontrol ="=">= s
TEST t036 WITH a ;= array( ARR_LEN ), s ;= dtos( date() ) ;
INIT aeval( a, { |x,i| a[i] ;= left( s + s, i ), x } ) ;
CODE x ;= a[ i % ARR_LEN + 1 ] <= s TEST t037 WITH a ;= array( ARR_LEN ), s ;= dtos( date() ) ; INIT aeval( a, { |x,i| a[i] ;= left( s + s, i ), x } ) ; CODE x ;= a[ i % ARR_LEN + 1 ] <> s
TEST t039 WITH a ;= array( ARR_LEN ) ;
INIT aeval( a, { |x,i| a[i] ;= i, x } ) ;
CODE ascan( a, i % ARR_LEN )
TEST t040 WITH a ;= array( ARR_LEN ) ;
INIT aeval( a, { |x,i| a[i] ;= i, x } ) ;
CODE ascan( a, { |x| x == i % ARR_LEN } )
TEST t041 WITH a ;= {}, a2 ;= { 1, 2, 3 }, bc ;= { |x| f1(x) }, ;
s ;= dtos( date() ), s2 ;= "static text" ;
CODE if i%1000==0;a;={};end; aadd(a,{i,1,.t.,s,s2,a2,bc})
TEST t042 WITH a ;= {} CODE x ;= a
TEST t043 CODE x ;= {}
TEST t044 CODE f0()
TEST t045 CODE f1( i )
TEST t046 WITH c ;= dtos( date() ) ;
INFO f2( c[1...8] ) ;
CODE f2( c )
TEST t047 WITH c ;= repl( dtos( date() ), 5000 ) ;
INFO f2( c[1...40000] ) ;
CODE f2( c )
TEST t048 WITH c ;= repl( dtos( date() ), 5000 ) ;
INFO f2( @c[1...40000] ) ;
CODE f2( c )
TEST t049 WITH c ;= repl( dtos( date() ),5000 ), c2 ;
INFO "f2( @c[1...40000] ), c2 ;= c" ;
CODE f2( @c ); c2 ;= c
TEST t050 WITH a ;= {}, a2 ;= { 1, 2, 3 }, bc ;= { |x| f1(x) }, ;
s ;= dtos( date() ), s2 ;= "static text", n ;= 1.23 ;
CODE f3( a, a2, s, i, s2, bc, i, n, x )
TEST t051 WITH a ;= { 1, 2, 3 } CODE f2( a )
TEST t052 CODE x ;= f4()
TEST t053 CODE x ;= f5()
TEST t054 WITH c ;= dtos( date() ) CODE f_prv( c )
function thTest( mtxJobs, aResults )
local xJob
while .T.
hb_mutexSubscribe( mtxJobs,, @xJob )
if xJob == NIL
exit
endif
aResults[ xJob ] ;= &( "t" + strzero( xJob, 3 ) )()
enddo
return nil
function thTestScale( mtxJobs, mtxResults )
local xJob
while .T.
hb_mutexSubscribe( mtxJobs,, @xJob )
if xJob == NIL
exit
endif
hb_mutexNotify( mtxResults, &( "t" + strzero( xJob, 3 ) )() )
enddo
return nil
proc test( nMT, cExclude, lScale )
local nLoopOverHead, nTimes, nSeconds, cNum, aThreads, aResults, ;
mtxJobs, mtxResults, nTimeST, nTimeMT, nTimeTotST, nTimeTotMT, ;
cTest, x, i, j
create_db()
#ifdef __HARBOUR__
#include "hbmemory.ch"
if MEMORY( HB_MEM_USEDMAX ) != 0
? "Warning !!! Memory statistic enabled."
?
endif
#endif
//? "Startup loop to increase CPU clock..."
//x ;= seconds() + 5; while x > seconds(); enddo
#ifdef __HARBOUR__
if !hb_mtvm()
if lScale
? "scale test available only in MULTI THREAD mode"
?
return
endif
if nMT != 0
? "SINGLE THREAD mode, number of threads set to 0"
nMT ;= 0
endif
endif
? date(), time(), os()
? version() + iif( hb_mtvm(), " (MT)" + iif( nMT != 0, "+", "" ), "" ), ;
hb_compiler()
#else
? date(), time(), os()
? version()
#endif
if lScale .and. nMT <>" + ltrim( str( N_TESTS ) ), ltrim( str( nMT ) ) )
? "N_LOOPS;", ltrim( str( N_LOOPS ) )
if !empty( cExclude )
? "excluded tests;", cExclude
endif
x ;=t000()
nLoopOverHead ;= x[2]
if lScale
? space(56) + "1 th." + str(nMT,3) + " th. factor"
? replicate("=",76)
else
? dsp_result( x, 0 )
? replicate("=",68)
endif
nSeconds ;= seconds()
nTimes ;= secondsCPU()
#ifdef __HARBOUR__
if lScale
mtxJobs ;= hb_mutexCreate()
mtxResults ;= hb_mutexCreate()
nTimeTotST ;= nTimeTotMT ;= 0
for i;=1 to nMT
hb_threadStart( "thTestScale", mtxJobs, mtxResults )
next
for i;=1 to N_TESTS
cTest ;= strzero( i, 3 )
if !cTest $ cExclude
/* linear execution */
nTimeST ;= seconds()
for j;=1 to nMT
hb_mutexNotify( mtxJobs, i )
hb_mutexSubscribe( mtxResults,, @x )
cTest ;= x[1]
next
nTimeST ;= seconds() - nTimeST
nTimeTotST += nTimeST
/* simultaneous execution */
nTimeMT ;= seconds()
for j;=1 to nMT
hb_mutexNotify( mtxJobs, i )
next
for j;=1 to nMT
hb_mutexSubscribe( mtxResults,, @x )
cTest ;= x[1]
next
nTimeMT ;= seconds() - nTimeMT
nTimeTotMT += nTimeMT
? dsp_scaleResult( cTest, nTimeST, nTimeMT, nMT, nLoopOverHead )
endif
next
for i;=1 to nMT
hb_mutexNotify( mtxJobs, NIL )
next
hb_threadWaitForAll()
elseif nMT <> 0
aResults ;= array( N_TESTS )
mtxJobs ;= hb_mutexCreate()
for i;=1 to nMT
hb_threadStart( "thTest", mtxJobs, aResults )
next
for i;=1 to N_TESTS
if !strzero( i, 3 ) $ cExclude
hb_mutexNotify( mtxJobs, i )
endif
next
for i;=1 to nMT
hb_mutexNotify( mtxJobs, NIL )
next
hb_threadWaitForAll()
for i;=1 to N_TESTS
if aResults[ i ] != NIL
? dsp_result( aResults[ i ], nLoopOverHead )
endif
next
mtxJobs ;= NIL
else
for i;=1 to N_TESTS
cNum ;= strzero( i, 3 )
if !cNum $ cExclude
? dsp_result( &( "t" + cNum )(), nLoopOverHead )
endif
next
endif
#else
for i;=1 to N_TESTS
cNum ;= strzero( i, 3 )
if !cNum $ cExclude
? dsp_result( &( "t" + cNum )(), nLoopOverHead )
endif
next
#endif
nTimes ;= secondsCPU() - nTimes
nSeconds ;= seconds() - nSeconds
if lScale
? replicate("=",76)
? dsp_scaleResult( " TOTAL ", nTimeTotST, nTimeTotMT, nMT, 0 )
? replicate("=",76)
else
? replicate("=",68)
endif
? dsp_result( { "total application time;", nTimes }, 0)
? dsp_result( { "total real time;", nSeconds }, 0 )
?
remove_db()
return
function f0()
return nil
function f1(x)
return x
function f2(x)
HB_SYMBOL_UNUSED( x )
return nil
function f3(a,b,c,d,e,f,g,h,i)
HB_SYMBOL_UNUSED( a )
HB_SYMBOL_UNUSED( b )
HB_SYMBOL_UNUSED( c )
HB_SYMBOL_UNUSED( d )
HB_SYMBOL_UNUSED( e )
HB_SYMBOL_UNUSED( f )
HB_SYMBOL_UNUSED( g )
HB_SYMBOL_UNUSED( h )
HB_SYMBOL_UNUSED( i )
return nil
function f4()
return space(4000)
function f5()
return space(5)
function f_prv(x)
memvar PRV_C
private PRV_C ;= x
return nil
/*
function f_pub(x)
memvar PUB_C
public PUB_C ;= x
return nil
function f_stat(x)
static STAT_C
STAT_C ;= x
return nil
*/
static func dsp_result( aResult, nLoopOverHead )
return padr( "[ " + left( aResult[1], 56 ) + " ]", 60, "." ) + ;
strtran( str( max( aResult[2] - nLoopOverHead, 0 ), 8, 2 ), " ", "." )
static func dsp_scaleResult( cTest, nTimeST, nTimeMT, nMT, nLoopOverHead )
if .f.
nTimeST ;= max( 0, nTimeST - nMT * nLoopOverHead )
nTimeMT ;= max( 0, nTimeMT - nMT * nLoopOverHead )
endif
return padr( "[ " + left( cTest, 50 ) + " ]", 54, "_" ) + ;
str( nTimeST, 6, 2 ) + " " + str( nTimeMT, 6, 2 ) + " ->" + ;
str( nTimeST / nTimeMT, 6, 2 )
#define TMP_FILE "_tst_tmp.dbf"
static proc create_db()
remove_db()
dbcreate( TMP_FILE, { {"F_C", "C", 10, 0},;
{"F_N", "N", 10, 2},;
{"F_D", "D", 8, 0} } )
use TMP_FILE exclusive
dbappend()
replace F_C with dtos(date())
replace F_N with 112345.67
replace F_D with date()
close
return
static proc remove_db()
ferase( TMP_FILE )
return
static proc close_db()
close
return
static proc use_dbsh()
use TMP_FILE shared
return
Welcome to Clipper... Clipper... Clipper
In 1997, then using Delphi 3, I had already created 32-bits Windows applications for HRIS, ERP and CRM. In 2007, using Ruby on Rails, an AJAX powered CRM site running on Apache & MySQL was created and I am now using Visual Studio .Net 2008 to create web-based projects and Delphi 7 for Win32 applications using SQL2005 & DBFCDX.
So, why then am I reviving the Original Clipper... Clipper... Clipper via a Blog as CA-Clipper is a programming language for the DOS world ? Believe it or not, there are still some clients using my mission-critical CA-Clipper applications for DOS installed in the late 80's and up to the mid 90's. This is testimony to CA-Clipper's robustness as a language :-)
With the widespread introduction of Windows 7 64-bits as the standard O/S for new Windows based PCs & Notebooks, CA-Clipper EXE simply will not work and it has become imperative for Clipper programmers to migrate immediately to Harbour to build 32/64 bits EXEs
Since 28th January 2009, this blog has been read by 134,389 (10/3/11 - 39,277) unique visitors (of which 45,151 (10/3/11 - 13,929) are returning visitors) from 103 countries and 1,574 cities & towns in Europe (37; 764 cities), North America (3; 373 cities) , Central America & Caribeans (6; 13 cities), South America(10; 226 cities), Africa & Middle-East (12; 44 cities) , Asia-Pacific (21; 175 cities). So, obviously Clipper is Alive & Well : -)
TIA & Enjoy ! (10th October 2012, 11:05; 13th November 2015)
Original Welcome Page for Clipper... Clipper... Clipper
This site started out as a teeny-weeny section of Who the heck is Chee Chong Hwa ? and has graduated into a full blown web site of more than 140 pages (actually hundreds of A4 size pages) ! This is due to its growing popularity and tremendous encouragements from visiting Clipperheads from 100 countries worldwide, from North America, Central America, Caribbean, South America, Europe, Middle-East, Africa and Asia-Pacific. Thanx Clipperheads, you all made this happen !
What is Clipper ?
You may ask, what is this Clipper stuff ? Could Clipper be something to do with sailing as it is the name of a very fast sailing American ship in the 19th century ?Well, Clipper or to be precise, CA-Clipper is the premier PC-Software development tool for DOS. It was first developed by Nantucket Corporation initially as a compiler for dBase3+ programs. Since then, CA-Clipper has evolved away from its x-base roots with the introduction of lexical scoping & pre-defined objects like TBrowse. As at today, the most stable version ofClipper is 5.2e while the latest version, 5.3a was introduced on 21 May 1996.
As at 11th November, 1996, an unofficial 5.3a fixes file was made available by Jo French. See the About CA-Clipper 5.3a section for more details. BTW, Jo French uploaded the revised 5.3a fixes file on 20th November, 1996.
Latest News
The latest news is that CA has finally released the long-awaited 5.3b patch on 21 May, 1997.
For 5.3b users, you must a take a look at Jo French's comments on unfixed bugs in 5.3b.
BTW, have you used Click ? If you're a serious Clipperprogrammer and need an excellent code formatter, Click is a natural choice. How to get it ? Simple, access Phil Barnett's site via my Cool Clipper Sites.
32-bits Clipper for Windows ?
Have you tried Xbase ++ ? Well, I have and compared to Delphi (my current Windows programming tool of choice), I'm still sticking to Delphi.Anyway, you should visit the Alaska Home Page. Give it a chance and then draw your own conclusions !.
The Harbour Project
Is this the future of Xbase ? Take a look at at the Harbour ProjectYou are Visitor # ...
According to counter.digits.com, you are visitor since 3 June 1996.
If you like or dislike what you see on this website, please drop me a line by clicking the email button at the bottom of this page or better still, by filling out the form in my guest book. If you are not sure what to write,click here to take a look at what other Clipperheads have to say.
No comments:
Post a Comment