whet.pas 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284
  1. program Whet;
  2. {$IFDEF VirtualPascal}
  3. {$AlignCode+,AlignData+,AlignRec+,Asm-,B-,Cdecl-,D-,Delphi-,Frame+,G4+,I-}
  4. {$Optimise+,OrgName-,P-,Q-,R-,SmartLink+,Speed+,T-,V-,W-,X+,Z-,ZD-}
  5. uses
  6. Dos, Os2Def, Os2Base;
  7. {$ENDIF}
  8. {$IFDEF Speed}
  9. {$B-,D-,I-,L-,O-,Q-,R-,S-,V-,Z-}
  10. uses
  11. Dos, BseDos;
  12. {$ENDIF}
  13. {$IFDEF Speed_Pascal_20}
  14. {$B-,D-,I-,L-,O-,Q-,R-,S-,V-,Z-}
  15. uses
  16. Dos,BseDos,OS2Def;
  17. {$ENDIF}
  18. {$IFDEF VER70}
  19. {$A+,B-,D-,E-,F-,G+,I-,L-,N+,O-,P-,Q-,R-,S-,T-,V-,X-,Y-}
  20. {$M 16384,0,655360}
  21. uses
  22. OpTimer, Dos;
  23. {$ENDIF}
  24. {$IFDEF Delphi}
  25. uses
  26. Dmisc;
  27. {$ENDIF Delphi}
  28. {$IFDEF FPC}
  29. uses
  30. Dos;
  31. {$ENDIF FPC}
  32. (**********************************************************************
  33. C Benchmark Double Precision Whetstone (A001)
  34. C
  35. C o This is a LONGREAL*8 version of
  36. C the Whetstone benchmark program.
  37. C o FOR-loop semantics are ANSI-66 compatible.
  38. C o Final measurements are to be made with all
  39. C WRITE statements and FORMAT sttements removed.
  40. C
  41. C**********************************************************************)
  42. const
  43. (* With loopcount NLoop=10, one million Whetstone instructions
  44. will be executed in each major loop.
  45. A major loop is executed 'II' times to increase wall-clock timing accuracy *)
  46. NLoopValue = 100;
  47. {$IFDEF OS2}
  48. function TimeNow : LongInt;
  49. var
  50. Clocks : LongInt;
  51. rc : ApiRet;
  52. begin
  53. rc := DosQuerySysInfo(qsv_Ms_Count, qsv_Ms_Count, Clocks, SizeOf(Clocks));
  54. TimeNow := Clocks;
  55. end;
  56. {$ELSE}
  57. function TimeNow : Int64;
  58. var
  59. h,m,s,s100 : word;
  60. begin
  61. gettime(h,m,s,s100);
  62. TimeNow := h*3600*1000+m*60*1000+s*1000+s100*10;
  63. end;
  64. {$ENDIF}
  65. TYPE ARRAY4 = ARRAY [1..4] OF DOUBLE;
  66. VAR E1 : ARRAY4;
  67. T, T1, T2 : DOUBLE;
  68. J, K, L : LONGINT;
  69. ptime, time0, time1 : DOUBLE;
  70. PROCEDURE PA (VAR E : ARRAY4);
  71. VAR J1 : LONGINT;
  72. BEGIN
  73. J1 := 0;
  74. REPEAT
  75. E [1] := ( E [1] + E [2] + E [3] - E [4]) * T;
  76. E [2] := ( E [1] + E [2] - E [3] + E [4]) * T;
  77. E [3] := ( E [1] - E [2] + E [3] + E [4]) * T;
  78. E [4] := (-E [1] + E [2] + E [3] + E [4]) / T2;
  79. J1 := J1 + 1;
  80. UNTIL J1 >= 6;
  81. END;
  82. PROCEDURE P0;
  83. BEGIN
  84. E1 [J] := E1 [K]; E1 [K] := E1 [L]; E1 [L] := E1 [J];
  85. END;
  86. PROCEDURE P3 (X,Y : DOUBLE; VAR Z : DOUBLE);
  87. VAR X1, Y1 : DOUBLE;
  88. BEGIN
  89. X1 := X;
  90. Y1 := Y;
  91. X1 := T * (X1 + Y1);
  92. Y1 := T * (X1 + Y1);
  93. Z := (X1 + Y1)/T2;
  94. END;
  95. PROCEDURE POUT (N, J, K : LONGINT; X1, X2, X3, X4 : DOUBLE);
  96. VAR time1 : double;
  97. BEGIN
  98. {
  99. time1 := TimeNow;
  100. WriteLn(time1-time0:6:1,time1-ptime:6,N:6,J:6,K:6,' ',
  101. X1:10,' ', X2:10,' ',X3:10,' ',X4:10);
  102. ptime := time1;
  103. }
  104. END;
  105. PROCEDURE DoIt;
  106. VAR NLoop, I, II, JJ : LONGINT;
  107. N1, N2, N3, N4, N5, N6, N7, N8, N9, N10, N11 : LONGINT;
  108. X1, X2, X3, X4, X, Y, Z : DOUBLE;
  109. BEGIN
  110. time0 := TimeNow;
  111. ptime := time0;
  112. (* The actual benchmark starts here. *)
  113. T := 0.499975;
  114. T1 := 0.50025;
  115. T2 := 2.0;
  116. NLoop := NLoopValue;
  117. II := 400;
  118. FOR JJ:=1 TO II DO BEGIN
  119. (* Establish the relative loop counts of each module. *)
  120. N1 := 0;
  121. N2 := 12 * NLoop;
  122. N3 := 14 * NLoop;
  123. N4 := 345 * NLoop;
  124. N5 := 0;
  125. N6 := 210 * NLoop;
  126. N7 := 32 * NLoop;
  127. N8 := 899 * NLoop;
  128. N9 := 616 * NLoop;
  129. N10 := 0;
  130. N11 := 93 * NLoop;
  131. (* Module 1: Simple identifiers *)
  132. X1 := 1.0;
  133. X2 := -1.0;
  134. X3 := -1.0;
  135. X4 := -1.0;
  136. FOR I:=1 TO N1 DO BEGIN
  137. X1 := (X1 + X2 + X3 - X4)*T;
  138. X2 := (X1 + X2 - X3 + X4)*T;
  139. X3 := (X1 - X2 + X3 + X4)*T;
  140. X4 := (-X1 + X2 + X3 + X4)*T;
  141. END;
  142. IF (JJ = II) THEN BEGIN
  143. POUT (N1, N1, N1, X1, X2, X3, X4);
  144. END;
  145. (* Module 2: Array elements *)
  146. E1 [1] := 1.0;
  147. E1 [2] := -1.0;
  148. E1 [3] := -1.0;
  149. E1 [4] := -1.0;
  150. FOR I:=1 TO N2 DO BEGIN
  151. E1 [1] := (E1 [1] + E1 [2] + E1 [3] - E1 [4])*T;
  152. E1 [2] := (E1 [1] + E1 [2] - E1 [3] + E1 [4])*T;
  153. E1 [3] := (E1 [1] - E1 [2] + E1 [3] + E1 [4])*T;
  154. E1 [4] := (-E1 [1] + E1 [2] + E1 [3] + E1 [4])*T;
  155. END;
  156. IF (JJ = II) THEN BEGIN
  157. POUT (N2, N3, N2, E1 [1], E1 [2], E1 [3], E1 [4]);
  158. END;
  159. (* Module 3: Array as parameter *)
  160. FOR I:=1 TO N3 DO BEGIN
  161. PA (E1);
  162. END;
  163. IF (JJ = II) THEN BEGIN
  164. POUT(N3, N2, N2, E1 [1], E1 [2], E1 [3], E1 [4]);
  165. END;
  166. (* Module 4: Conditional jumps *)
  167. J := 1;
  168. FOR I:=1 TO N4 DO BEGIN
  169. IF (J <> 1) THEN J := 3 ELSE J := 2;
  170. IF (J <= 2) THEN J := 1 ELSE J := 0;
  171. IF (J >= 1) THEN J := 0 ELSE J := 1;
  172. END;
  173. IF (JJ = II) THEN BEGIN
  174. POUT (N4, J, J, X1, X2, X3, X4)
  175. END;
  176. (* Module 5: Omitted; Module 6: Integer arithmetic *)
  177. J := 1;
  178. K := 2;
  179. L := 3;
  180. FOR I:=1 TO N6 DO BEGIN
  181. J := J * (K-J) * (L-K);
  182. K := L * K - (L-J) * K;
  183. L := (L - K) * (K + J);
  184. E1 [L-1] := (J + K + L);
  185. E1 [K-1] := (J * K * L);
  186. END;
  187. IF (JJ = II) THEN BEGIN
  188. POUT (N6, J, K, E1 [1], E1 [2], E1 [3], E1 [4]);
  189. END;
  190. (* Module 7: Trigonometric functions *)
  191. X := 0.5;
  192. Y := 0.5;
  193. FOR I:=1 TO N7 DO BEGIN
  194. X:=T*arctan(T2*sin(X)*cos(X)/(cos(X+Y)+cos(X-Y)-1.0));
  195. Y:=T*arctan(T2*sin(Y)*cos(Y)/(cos(X+Y)+cos(X-Y)-1.0));
  196. END;
  197. IF (JJ = II) THEN BEGIN
  198. POUT (N7, J, K, X, X, Y, Y);
  199. END;
  200. (* Module 8: Procedure calls *)
  201. X := 1.0;
  202. Y := 1.0;
  203. Z := 1.0;
  204. FOR I:=1 TO N8 DO BEGIN
  205. P3 (X,Y,Z);
  206. END;
  207. IF (JJ = II) THEN BEGIN
  208. POUT (N8, J, K, X, Y, Z, Z);
  209. END;
  210. (* Module 9: Array references *)
  211. J := 1;
  212. K := 2;
  213. L := 3;
  214. E1 [1] := 1.0;
  215. E1 [2] := 2.0;
  216. E1 [3] := 3.0;
  217. FOR I:=1 TO N9 DO BEGIN
  218. P0;
  219. END;
  220. IF (JJ = II) THEN BEGIN
  221. POUT (N9, J, K, E1 [1], E1 [2], E1 [3], E1 [4])
  222. END;
  223. (* Module 10: Integer arithmetic *)
  224. J := 2;
  225. K := 3;
  226. FOR I:=1 TO N10 DO BEGIN
  227. J := J + K;
  228. K := J + K;
  229. J := K - J;
  230. K := K - J - J;
  231. END;
  232. IF (JJ = II) THEN BEGIN
  233. POUT (N10, J, K, X1, X2, X3, X4)
  234. END;
  235. (* Module 11: Standard functions *)
  236. X := 0.75;
  237. FOR I:=1 TO N11 DO BEGIN
  238. X := sqrt (exp (ln (X)/T1))
  239. // x:=sqrt(x);
  240. END;
  241. IF (JJ = II) THEN BEGIN
  242. POUT (N11, J, K, X, X, X, X)
  243. END;
  244. (* THIS IS THE END OF THE MAJOR LOOP. *)
  245. END;
  246. (* Stop benchmark timing at this point. *)
  247. time1 := TimeNow;
  248. (*----------------------------------------------------------------
  249. Performance in Whetstone KIP's per second is given by
  250. (100*NLoop*II)/TIME
  251. where TIME is in seconds.
  252. --------------------------------------------------------------------*)
  253. WriteLn;
  254. WriteLn ('Double Whetstone KIPS ',
  255. (TRUNC ((100.0 * NLoop * II) * 1000 / (time1 - time0))));
  256. WriteLn ('Whetstone MIPS ',
  257. 1.0*NLoop*II * 1000 / (time1 - time0):12:2);
  258. END;
  259. BEGIN
  260. DoIt;
  261. END.