Przemek:

This are st or mt ?
[E:\harbour809mt\harbour\tests]..\bin\hbrun.exe speedtst.prg

Below are results

David Macias


AMD Athlon 2200+ 2.0GHz, 1 Gb RAM, gcc 3.3.5

Warning !!! Memory statistic enabled.

Startup loop to increase CPU clock...

09/16/08 17:42:23 Harbour 1.1.0dev (Rev. 9418) (FMSTAT), OS/2 4.50
ARR_LEN =         16
N_LOOPS =    1000000
empty loops overhead =          0.14
CPU usage -> secondsCPU()

c:=L_C ->                                             0.10
n:=L_N ->                                             0.09
d:=L_D ->                                             0.09
c:=M_C ->                                             0.11
n:=M_N ->                                             0.10
d:=M_D ->                                             0.10
(sh) c:=F_C ->                                        0.71
(sh) n:=F_N ->                                        0.37
(sh) d:=F_D ->                                        0.21
(ex) c:=F_C ->                                        0.70
(ex) n:=F_N ->                                        0.37
(ex) d:=F_D ->                                        0.22
n:=o:GenCode ->                                       0.32
n:=o[8] ->                                            0.21
round(i/1000,2) ->                                    0.45
str(i/1000) ->                                        1.52
val(a3[i%ARR_LEN+1]) ->                               0.88
dtos(j+i%10000-5000) ->                               1.20
eval({||i%ARR_LEN}) ->                                0.44
eval({|x|x%ARR_LEN},i) ->                             0.48
eval({|x|f1(x)},i) ->                                 0.69
&('f1('+str(i)+')') ->                               10.11
eval([&('{|x|f1(x)}')]) ->                            0.79
j := valtype(a)+valtype(i) ->                         1.21
j := str(i%100,2) $ a2[i%ARR_LEN+1] ->                2.19
j := val(a2[i%ARR_LEN+1]) ->                          0.89
j := a2[i%ARR_LEN+1] == s ->                          0.61
j := a2[i%ARR_LEN+1] = s ->                           0.69
j := a2[i%ARR_LEN+1] >= s ->                          0.65
j := a2[i%ARR_LEN+1] < s ->                           0.65
aadd(aa,{i,j,s,a,a2,t,bc}) ->                         3.76
f0() ->                                               0.28
f1(i) ->                                              0.39
f2(c[8]) ->                                           0.31
f2(c[40000]) ->                                       0.31
f2(@c[40000]) ->                                      0.30
f2(c[40000]); c2:=c ->                                0.42
f2(@c[40000]); c2:=c ->                               0.42
f3(a,a2,c,i,j,t,bc) ->                                0.75
f2(a2) ->                                             0.33
s:=f4() ->                                            1.44
s:=f5() ->                                            0.95
ascan(a,i%ARR_LEN) ->                                 0.60
ascan(a2,c+chr(i%64+64)) ->                           2.80
ascan(a,{|x|x==i%ARR_LEN}) ->                         6.61
============================================================
total application time:                              53.30
total real time:                                     53.30

_______________________________________________
Harbour mailing list
Harbour@harbour-project.org
http://lists.harbour-project.org/mailman/listinfo/harbour

Reply via email to