1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
|
{$Q-} { this is necessary to avoid an overflow error below }
{$mode objfpc}
uses
sysutils
{$ifdef go32v2}
,dpmiexcp
{$endif go32v2}
;
type
tqwordrec = packed record
{$ifndef ENDIAN_BIG}
low,high : dword;
{$else}
high, low : dword;
{$endif}
end;
const
{$ifdef CPU68K}
{ this test takes ages under m68k otherwise PM }
NumIterations = 10000;
{$else not CPU68K}
NumIterations = 100000;
{$endif not CPU68K}
procedure dumpqword(q : qword);
begin
write('$',hexstr(tqwordrec(q).high,8),' ',hexstr(tqwordrec(q).low,8));
end;
procedure dumpqwordln(q : qword);
begin
dumpqword(q);
writeln;
end;
procedure assignqword(h,l : dword;var q : qword);
begin
tqwordrec(q).high:=h;
tqwordrec(q).low:=l;
end;
procedure do_error(l : longint);
begin
writeln('Error near number ',l);
halt(1);
end;
procedure do_error;
begin
do_error(0);
end;
procedure simpletestcmpqword;
var
q1,q2,q3,q4 : qword;
begin
assignqword(0,5,q1);
assignqword(6,0,q2);
assignqword(6,1,q3);
assignqword(6,5,q4);
{ first test the code generation of the operators }
if q1<>q1 then
do_error(0);
if q2<>q2 then
do_error(0);
if q3<>q3 then
do_error(0);
if not(q1=q1) then
do_error(0);
if not(q2=q2) then
do_error(0);
if not(q3=q3) then
do_error(0);
writeln(' <>,= succesfully tested');
if q1>q2 then
do_error(1100);
if q2>q3 then
do_error(1101);
if q2<q1 then
do_error(1102);
if q3<q2 then
do_error(1103);
writeln(' <,> succesfully tested');
if q1>=q2 then
do_error(1104);
if q2>=q3 then
do_error(1105);
if q2<=q1 then
do_error(1106);
if q3<=q2 then
do_error(1107);
writeln(' >=,<= succesfully tested');
if q1=q2 then
do_error(1108);
if q2=q3 then
do_error(1109);
if q3=q1 then
do_error(1111);
if q1=q4 then
do_error(1112);
if q2=q4 then
do_error(1113);
if q3=q4 then
do_error(1114);
writeln(' More comparisations successful tested');
end;
procedure testaddqword;
var
q1,q2,q3,q4,q5,q6 : qword;
begin
{ without overflow between 32 bit }
assignqword(0,5,q1);
assignqword(0,6,q2);
assignqword(0,1,q3);
assignqword(0,11,q4);
assignqword(0,1,q5);
if q1+q2<>q4 then
do_error(1200);
if q1+q3+q1<>q4 then
do_error(1201);
if q1+(q3+q1)<>q4 then
do_error(1202);
if (q1+q3)+q1<>q4 then
do_error(1203);
{ a more complex expression }
if ((((q5+q3)+(q3+q5))+((q5+q3)+(q3+q5)))+q5+q3+q5)<>q4 then
do_error(1204);
{ with overflow between 32 bit }
assignqword(0,$ffffffff,q1);
assignqword(1,3,q2);
assignqword(0,4,q3);
assignqword(1,4,q4);
assignqword(0,1,q5);
assignqword(1,$fffffffe,q6);
if q1+q3<>q2 then
do_error(1205);
if q3+q1<>q2 then
do_error(1206);
if q1+(q3+q5)<>q4 then
do_error(1207);
if (q1+q3)+q5<>q4 then
do_error(1208);
if (q1+q1)<>q6 then
do_error(1209);
end;
procedure testcmpqword;
var
q1,q2,q3,q4,q5,q6 : qword;
begin
assignqword(0,$ffffffff,q1);
assignqword(0,$ffffffff,q2);
assignqword(1,$fffffffe,q3);
assignqword(0,2,q4);
assignqword(1,$fffffffc,q5);
if (q1+q2)<>q3 then
do_error(1300);
if not(q3=(q1+q2)) then
do_error(1301);
if (q1+q2)>q3 then
do_error(1302);
if (q1+q2)<q3 then
do_error(1303);
if not(q3<=(q1+q2)) then
do_error(1304);
if not(q3>=(q1+q2)) then
do_error(1305);
if (q1+q2)<>(q4+q5) then
do_error(1306);
if not((q4+q5)=(q1+q2)) then
do_error(1307);
if (q1+q2)>(q4+q5) then
do_error(1308);
if (q1+q2)<(q4+q5) then
do_error(1309);
if not((q4+q5)<=(q1+q2)) then
do_error(1310);
if not((q4+q5)>=(q1+q2)) then
do_error(1311);
end;
procedure testlogqword;
var
q0,q1,q2,q3,q4,q5,q6 : qword;
begin
assignqword(0,0,q0);
assignqword($ffffffff,$ffffffff,q1);
assignqword(0,$ffffffff,q2);
assignqword($ffffffff,0,q3);
assignqword($a0a0a0a0,$50505050,q4);
assignqword(0,$50505050,q5);
assignqword($a0a0a0a0,0,q6);
{ here we don't need to test all cases of locations, }
{ this is already done by the addtion test }
if (q2 or q3)<>q1 then
do_error(1400);
if (q5 or q6)<>q4 then
do_error(1401);
if (q2 and q3)<>q0 then
do_error(1402);
if (q5 and q6)<>q0 then
do_error(1403);
if (q2 xor q3)<>q1 then
do_error(1404);
if (q5 xor q6)<>q4 then
do_error(1405);
{ the test before could be also passed by the or operator! }
if (q4 xor q4)<>q0 then
do_error(1406);
end;
procedure testshlshrqword;
var
q0,q1,q2,q3,q4,q5 : qword;
l1,l2 : longint;
begin
assignqword(0,0,q0);
assignqword($ffff,$ffff0000,q1);
assignqword(0,$ffffffff,q2);
assignqword($ffffffff,0,q3);
assignqword(0,1,q4);
assignqword($80000000,0,q5);
l1:=16;
l2:=0;
if (q1 shl 16)<>q3 then
do_error(1500);
if (q1 shl 48)<>q0 then
do_error(1501);
if (q1 shl 47)<>q5 then
do_error(1501);
if ((q1+q0) shl 16)<>q3 then
do_error(1502);
if ((q1+q0) shl 48)<>q0 then
do_error(1503);
if ((q1+q0) shl 47)<>q5 then
do_error(15031);
if (q1 shl l1)<>q3 then
do_error(1504);
if (q1 shl (3*l1))<>q0 then
do_error(1505);
if ((q1+q0) shl l1)<>q3 then
do_error(1506);
if ((q1+q0) shl (3*l1))<>q0 then
do_error(1507);
if ((q1+q0) shl (3*l1-1))<>q5 then
do_error(15071);
if (q1 shl (l1+l2))<>q3 then
do_error(1508);
if ((q1+q0) shl (l1+l2))<>q3 then
do_error(1509);
if (q1 shr 16)<>q2 then
do_error(1510);
if (q1 shr 48)<>q0 then
do_error(1511);
if (q1 shr 47)<>q4 then
do_error(15111);
if ((q1+q0) shr 16)<>q2 then
do_error(1512);
if ((q1+q0) shr 48)<>q0 then
do_error(1513);
if (q1 shr l1)<>q2 then
do_error(1514);
if (q1 shr (3*l1))<>q0 then
do_error(1515);
if (q1 shr (3*l1-1))<>q4 then
do_error(15151);
if ((q1+q0) shr l1)<>q2 then
do_error(1516);
if ((q1+q0) shr (3*l1))<>q0 then
do_error(1517);
if ((q1+q0) shr (3*l1-1))<>q4 then
do_error(15171);
if (q1 shr (l1+l2))<>q2 then
do_error(1518);
if ((q1+q0) shr (l1+l2))<>q2 then
do_error(1519);
end;
procedure testsubqword;
var
q0,q1,q2,q3,q4,q5,q6 : qword;
begin
{ without overflow between 32 bit }
assignqword(0,0,q0);
assignqword(0,6,q1);
assignqword(0,5,q2);
assignqword(0,1,q3);
assignqword(0,11,q4);
assignqword(0,1,q5);
if q1-q2<>q3 then
do_error(1600);
if q1-q0-q1<>q0 then
do_error(1601);
if q1-(q0-q1)<>q1+q1 then
do_error(1602);
if (q1-q0)-q1<>q0 then
do_error(1603);
{ a more complex expression }
if ((((q5-q3)-(q3-q5))-((q5-q3)-(q3-q5))))<>q0 then
do_error(1604);
{ with overflow between 32 bit }
assignqword(1,0,q1);
assignqword(0,$ffffffff,q2);
assignqword(0,1,q3);
assignqword(1,$ffffffff,q4);
if q1-q2<>q3 then
do_error(1605);
if q1-q0-q2<>q3 then
do_error(1606);
if q1-(q0-q2)<>q4 then
do_error(1607);
if (q1-q0)-q1<>q0 then
do_error(1608);
assignqword(1,$ffffffff,q5);
assignqword(1,$ffffffff,q4);
{ a more complex expression }
if ((((q5-q3)-(q3-q5))-((q5-q3)-(q3-q5))))<>q0 then
do_error(1609);
end;
procedure testnotqword;
var
q0,q1,q2,q3,q4 : qword;
begin
assignqword($f0f0f0f0,$f0f0f0f0,q1);
assignqword($f0f0f0f,$f0f0f0f,q2);
assignqword($f0f0f0f0,0,q3);
assignqword(0,$f0f0f0f0,q4);
if not(q1)<>q2 then
do_error(1700);
if not(q3 or q4)<>q2 then
do_error(1701);
{ do a more complex expression to stress the register saving }
if not(q3 or q4)<>not(q3 or q4) then
do_error(1702);
end;
procedure testnegqword;
var
q0,q1,q2,q3,q4 : qword;
begin
assignqword($1,$0,q1);
assignqword($0,1234,q2);
if -q1<>(0-q1) then
do_error(2700);
if -q2<>(0-q2) then
do_error(2701);
if -(q1+q2)<>(0-(q1+q2)) then
do_error(2702);
end;
procedure testmulqword;
var
q0,q1,q2,q3,q4,q5,q6 : qword;
i : longint;
begin
assignqword(0,0,q0);
assignqword(0,1,q1);
assignqword(0,4,q2);
assignqword(2,0,q3);
assignqword(8,0,q4);
assignqword(0,1,q5);
assignqword($ffff,$12344321,q6);
{ to some trivial tests }
{ to test the code generation }
if q1*q2<>q2 then
do_error(1800);
if q1*q2*q3<>q4 then
do_error(1801);
if q1*(q2*q3)<>q4 then
do_error(1802);
if (q1*q2)*q3<>q4 then
do_error(1803);
if (q6*q5)*(q1*q2)<>q1*q2*q5*q6 then
do_error(1804);
{ a more complex expression }
if ((((q1*q5)*(q1*q5))*((q5*q1)*(q1*q5)))*q5*q1*q5)<>q1 then
do_error(1805);
{ now test the multiplication procedure with random bit patterns }
writeln('Doing some random multiplications, takes a few seconds');
writeln('........................................ 100%');
for i:=1 to NumIterations do
begin
tqwordrec(q1).high:=0;
tqwordrec(q1).low:=random($7ffffffe);
tqwordrec(q2).high:=0;
tqwordrec(q2).low:=random($7ffffffe);
if q1*q2<>q2*q1 then
begin
write('Multiplication of ');
dumpqword(q1);
write(' and ');
dumpqword(q2);
writeln(' failed');
do_error(1806);
end;
if i mod (NumIterations div 20)=0 then
write('.');
end;
for i:=1 to NumIterations do
begin
tqwordrec(q1).high:=0;
tqwordrec(q1).low:=random($7ffffffe);
q1:=q1 shl 16;
tqwordrec(q2).high:=0;
tqwordrec(q2).low:=random($fffe);
if q1*q2<>q2*q1 then
begin
write('Multiplication of ');
dumpqword(q1);
write(' and ');
dumpqword(q2);
writeln(' failed');
do_error(1806);
end;
if i mod (NumIterations div 20)=0 then
write('.');
end;
writeln(' OK');
end;
procedure testdivqword;
var
q0,q1,q2,q3,q4,q5,q6 : qword;
i : longint;
begin
assignqword(0,0,q0);
assignqword(0,1,q1);
assignqword(0,4,q2);
assignqword(2,0,q3);
assignqword(8,0,q4);
assignqword(0,1,q5);
assignqword($ffff,$12344321,q6);
{ to some trivial tests }
{ to test the code generation }
if q2 div q1<>q2 then
do_error(1900);
if q2 div q1 div q1<>q2 then
do_error(1901);
if q2 div (q4 div q3)<>q1 then
do_error(1902);
if (q4 div q3) div q2<>q1 then
do_error(1903);
{ a more complex expression }
if (q4 div q3) div (q2 div q1)<>(q2 div q1) div (q4 div q3) then
do_error(1904);
{ now test the division procedure with random bit patterns }
writeln('Doing some random divisions, takes a few seconds');
writeln('.................... 100%');
for i:=1 to NumIterations do
begin
tqwordrec(q1).high:=random($7ffffffe);
tqwordrec(q1).low:=random($7ffffffe);
tqwordrec(q2).high:=random($7ffffffe);
tqwordrec(q2).low:=random($7ffffffe);
{ avoid division by zero }
if (tqwordrec(q2).low or tqwordrec(q2).high)=0 then
tqwordrec(q2).low:=1;
q3:=q1 div q2;
{ get a restless division }
q1:=q2*q3;
q3:=q1 div q2;
if q3*q2<>q1 then
begin
write('Division of ');
dumpqword(q1);
write(' by ');
dumpqword(q2);
writeln(' failed');
do_error(1906);
end;
if i mod (NumIterations div 10)=0 then
write('.');
end;
for i:=1 to NumIterations do
begin
tqwordrec(q1).high:=0;
tqwordrec(q1).low:=random($7ffffffe);
tqwordrec(q2).high:=0;
tqwordrec(q2).low:=random($7ffffffe);
{ avoid division by zero }
if tqwordrec(q2).low=0 then
tqwordrec(q2).low:=1;
{ get a restless division }
q3:=q1*q2;
q3:=q3 div q2;
if q3<>q1 then
begin
write('Division of ');
dumpqword(q1);
write(' by ');
dumpqword(q2);
writeln(' failed');
do_error(1907);
end;
if i mod (NumIterations div 10)=0 then
write('.');
end;
writeln(' OK');
end;
function testf : qword;
var
q : qword;
begin
assignqword($ffffffff,$a0a0a0a0,q);
testf:=q;
end;
procedure testfuncqword;
var
q : qword;
begin
assignqword($ffffffff,$a0a0a0a0,q);
if testf<>q then
do_error(1900);
if q<>testf then
do_error(1901);
end;
procedure testtypecastqword;
var
s1,s2 : shortint;
b1,b2 : byte;
w1,w2 : word;
i1,i2 : integer;
l1,l2 : longint;
d1,d2 : dword;
q1,q2 : qword;
r1,r2 : double;
begin
{ shortint }
s1:=75;
s2:=0;
q1:=s1;
{ mix up the processor a little bit }
q2:=q1;
if q2<>75 then
begin
dumpqword(q2);
do_error(2006);
end;
s2:=q2;
if s1<>s2 then
do_error(2000);
{ byte }
b1:=$ca;
b2:=0;
q1:=b1;
{ mix up the processor a little bit }
q2:=q1;
if q2<>$ca then
do_error(2007);
b2:=q2;
if b1<>b2 then
do_error(2001);
{ integer }
i1:=12345;
i2:=0;
q1:=i1;
{ mix up the processor a little bit }
q2:=q1;
if q2<>12345 then
do_error(2008);
i2:=q2;
if i1<>i2 then
do_error(2002);
{ word }
w1:=$a0ff;
w2:=0;
q1:=w1;
{ mix up the processor a little bit }
q2:=q1;
if q2<>$a0ff then
do_error(2009);
w2:=q2;
if w1<>w2 then
do_error(2003);
{ longint }
l1:=12341234;
l2:=0;
q1:=l1;
{ mix up the processor a little bit }
q2:=q1;
if q2<>12341234 then
do_error(2010);
l2:=q2;
if l1<>l2 then
do_error(2004);
{ dword }
d1:=$5bcdef01;
b2:=0;
q1:=d1;
{ mix up the processor a little bit }
q2:=q1;
if q2<>$5bcdef01 then
do_error(2011);
d2:=q2;
if d1<>d2 then
do_error(2005);
{ real }
{ memory location }
q1:=12;
d1:=q1;
d2:=12;
if d1<>d2 then
do_error(2012);
{ register location }
q1:=12;
d1:=q1+1;
d2:=13;
if d1<>d2 then
do_error(2013);
// a constant which can't be loaded with fild
q1:=$80000000;
q1:=q1 shl 32;
d2:=$80000000;
if q1<>double(d2)*d2*2.0 then
do_error(20);
// register location
q1:=q1+1;
if q1<>double(d2)*d2*2.0+1 then
do_error(2014);
end;
procedure testioqword;
var
t : text;
q1,q2 : qword;
i : longint;
begin
assignqword($ffffffff,$a0a0a0a0,q1);
assign(t,'testi642.tmp');
rewrite(t);
writeln(t,q1);
close(t);
reset(t);
readln(t,q2);
close(t);
if q1<>q2 then
do_error(2100);
{ do some random tests }
for i:=1 to 100 do
begin
tqwordrec(q1).high:=random($7ffffffe);
tqwordrec(q1).low:=random($7ffffffe);
rewrite(t);
writeln(t,q1);
close(t);
reset(t);
readln(t,q2);
close(t);
if q1<>q2 then
begin
write('I/O of ');dumpqword(q1);writeln(' failed');
do_error(2101);
end;
end;
erase(t);
end;
procedure teststringqword;
var
q1,q2 : qword;
s : string;
l : cardinal;
a : ansistring;
code : integer;
begin
{ testing str: shortstring }
// simple tests
q1:=1;
str(q1,s);
if s<>'1' then
do_error(2200);
// simple tests
q1:=0;
str(q1,s);
if s<>'0' then
do_error(2201);
// more complex tests
q1:=4321;
str(q1,s);
if s<>'4321' then
do_error(2202);
str(q1:6,s);
if s<>' 4321' then
do_error(2203);
// create a big qword:
q2:=1234;
l:=1000000000;
q2:=q2*l;
l:=54321;
q2:=q2+l;
str(q2,s);
if s<>'1234000054321' then
do_error(2204);
{ testing str: ansistring }
// more complex tests
q1:=4321;
str(q1,a);
if a<>'4321' then
do_error(2205);
str(q1:6,a);
if a<>' 4321' then
do_error(2206);
// create a big qword:
q2:=1234;
l:=1000000000;
q2:=q2*l;
l:=54321;
q2:=q2+l;
str(q2,a);
if a<>'1234000054321' then
do_error(2207);
{ testing val for qword }
assignqword($ffffffff,$ffffffff,q1);
s:='18446744073709551615';
a:=s;
val(s,q2,code);
if code<>0 then
do_error(2208);
if q1<>q2 then
do_error(2209);
val(a,q2,code);
if code<>0 then
do_error(2210);
if q1<>q2 then
do_error(2211);
s:='18446744073709551616';
val(s,q2,code);
if code=0 then
do_error(2212);
end;
procedure testmodqword;
var
q0,q1,q2,q3,q4,q5,q6 : qword;
i : longint;
begin
assignqword(0,0,q0);
assignqword(0,3,q1);
assignqword(0,5,q2);
assignqword(0,2,q3);
assignqword(0,4,q4);
assignqword(0,1,q5);
assignqword($ffff,$12344321,q6);
{ to some trivial tests }
{ to test the code generation }
if q2 mod q1<>q3 then
do_error(2300);
if q2 mod q1 mod q3<>q0 then
do_error(2301);
if q2 mod (q1 mod q3)<>q0 then
do_error(2302);
if (q1 mod q3) mod q2<>q5 then
do_error(2303);
if q1 mod q2<>q1 then
do_error(2308);
{ a more complex expression }
if (q2 mod q4) mod (q1 mod q3)<>(q1 mod q3) mod (q2 mod q4) then
do_error(2304);
{ now test the modulo division procedure with random bit patterns }
writeln('Doing some random module divisions, takes a few seconds');
writeln('.................... 100%');
for i:=1 to NumIterations do
begin
tqwordrec(q1).high:=random($7ffffffe);
tqwordrec(q1).low:=random($7ffffffe);
tqwordrec(q2).high:=random($7ffffffe);
tqwordrec(q2).low:=random($7ffffffe);
{ avoid division by zero }
if (tqwordrec(q2).low or tqwordrec(q2).high)=0 then
tqwordrec(q2).low:=1;
q3:=q1 mod q2;
if (q1-q3) mod q2<>q0 then
begin
write('Modulo division of ');
dumpqword(q1);
write(' by ');
dumpqword(q2);
writeln(' failed');
do_error(2306);
end;
if i mod (NumIterations div 10)=0 then
write('.');
end;
for i:=1 to NumIterations do
begin
tqwordrec(q1).high:=random($7ffffffe);
tqwordrec(q1).low:=random($7ffffffe);
tqwordrec(q2).high:=0;
tqwordrec(q2).low:=random($7ffffffe);
{ avoid division by zero }
if tqwordrec(q2).low=0 then
tqwordrec(q2).low:=1;
{ get a restless division }
q3:=q1 mod q2;
if (q1-q3) mod q2<>q0 then
begin
write('Modulo division of ');
dumpqword(q1);
write(' by ');
dumpqword(q2);
writeln(' failed');
do_error(2307);
end;
if i mod (NumIterations div 10)=0 then
write('.');
end;
writeln(' OK');
end;
const
constqword : qword = 131975;
procedure testconstassignqword;
var
q1,q2,q3 : qword;
begin
// constant assignments
assignqword(0,5,q2);
q1:=5;
if q1<>q2 then
do_error(2400);
// constants in expressions
q1:=1234;
if q1<>1234 then
do_error(2401);
// typed constants
assignqword(0,131975,q1);
q2:=131975;
if q1<>q2 then
do_error(2402);
//!!!!! large constants are still missed
end;
{$Q+}
procedure testreqword;
var
q0,q1,q2,q3 : qword;
begin
q0:=0;
assignqword($ffffffff,$ffffffff,q1);
q2:=1;
// addition
try
// expect an exception
q3:=q1+q2;
do_error(2500);
except
on eintoverflow do
;
else
do_error(2501);
end;
// subtraction
try
q3:=q0-q2;
do_error(2502);
except
on eintoverflow do
;
else
do_error(2503);
end;
// multiplication
q2:=2;
try
q3:=q2*q1;
do_error(2504);
except
on eintoverflow do
;
else
do_error(2505);
end;
// division
try
q3:=q1 div q0;
do_error(2506);
except
on edivbyzero do
;
else
do_error(2507);
end;
// modulo division
try
q3:=q1 mod q0;
do_error(2508);
except
on edivbyzero do
;
else
do_error(2509);
end;
{$Q-}
// now we do the same operations but without overflow
// checking -> we should get no exceptions
q2:=1;
// addition
try
q3:=q1+q2;
except
do_error(2510);
end;
// subtraction
try
q3:=q0-q2;
except
do_error(2511);
end;
// multiplication
q2:=2;
try
q3:=q2*q1;
except
do_error(2512);
end;
end;
procedure testintqword;
var
q1,q2,q3 : qword;
begin
// lo/hi
assignqword($fafafafa,$03030303,q1);
if lo(q1)<>$03030303 then
do_error(2600);
if hi(q1)<>$fafafafa then
do_error(2601);
if lo(q1+1)<>$03030304 then
do_error(2602);
if hi(q1+$f0000000)<>$fafafafa then
do_error(2603);
// swap
assignqword($03030303,$fafafafa,q2);
if swap(q1)<>q2 then
do_error(2604);
// succ/pred
assignqword(0,$1,q1);
q3:=q1;
q1:=succ(q1);
q1:=succ(q1+1);
q2:=pred(q1-1);
q2:=pred(q2);
if q3<>q2 then
do_error(2605);
assignqword(0,$ffffffff,q1);
q3:=q1;
q1:=succ(q1);
q1:=succ(q1+1);
q2:=pred(q1-1);
q2:=pred(q2);
if q3<>q2 then
do_error(2606);
end;
procedure testcritical;
var
a : array[0..10,0..10,0..10] of qword;
i,j,k : longint;
d1,d2 : extended;
q1,q2 : qword;
i1,i2 : int64;
begin
i:=1;
j:=3;
k:=5;
{ check if it is handled correct if a register is used }
{ in a reference as well as temp. reg }
a[i,j,k]:=1234;
a[i,j,k]:=a[i,j,k]+a[i,j,k];
if a[i,j,k]<>2468 then
do_error(2700);
if not(not(a[i,j,k]))<>a[i,j,k] then
do_error(2701);
if -(-(a[i,j,k]))<>a[i,j,k] then
do_error(2702);
if (a[i,j,k] shl (i-i))<>a[i,j,k] then
do_error(2703);
q1:=10;
q2:=100;
i1:=1000;
i2:=10000;
d1:=q1/q2;
d2:=i1/i2;
if (d1<>d2) then
do_error(2704);
end;
var
q : qword;
begin
randomize;
writeln('------------------------------------------------------');
writeln(' QWord test ');
writeln('------------------------------------------------------');
writeln;
writeln('Testing assignqword and dumpqword ... ');
assignqword($12345678,$9ABCDEF0,q);
dumpqword(q);
writeln;
writeln('The output should be:');
writeln('$12345678 9ABCDEF0');
writeln;
writeln('Testing simple QWord comparisations');
simpletestcmpqword;
writeln('Testing simple QWord comparisations was successful');
writeln;
writeln('Testing QWord additions');
testaddqword;
writeln('Testing QWord additions was successful');
writeln;
writeln('Testing more QWord comparisations');
testcmpqword;
writeln('Testing more QWord comparisations was successful');
writeln;
writeln('Testing QWord subtraction');
testsubqword;
writeln('Testing QWord subtraction was successful');
writeln;
writeln('Testing QWord constants');
testconstassignqword;
writeln('Testing QWord constants was successful');
writeln;
writeln('Testing QWord logical operators (or,xor,and)');
testlogqword;
writeln('Testing QWord logical operators (or,xor,and) was successful');
writeln;
writeln('Testing QWord logical not operator');
testnotqword;
writeln('Testing QWord logical not operator was successful');
writeln;
writeln('Testing QWord logical - operator');
testnegqword;
writeln('Testing QWord logical - operator was successful');
writeln;
writeln('Testing QWord logical shift operators (shr,shr)');
testshlshrqword;
writeln('Testing QWord logical shift operators (shr,shr) was successful');
writeln;
writeln('Testing QWord function results');
testfuncqword;
writeln('Testing QWord function results was successful');
writeln;
writeln('Testing QWord type casts');
testtypecastqword;
writeln('Testing QWord type casts was successful');
writeln;
writeln('Testing QWord internal procedures');
testintqword;
writeln('Testing QWord internal procedures was successful');
writeln;
writeln('Testing QWord multiplications');
testmulqword;
writeln('Testing QWord multiplications was successful');
writeln;
writeln('Testing QWord division');
testdivqword;
writeln('Testing QWord division was successful');
writeln;
writeln('Testing QWord modulo division');
testmodqword;
writeln('Testing QWord modulo division was successful');
writeln;
writeln('Testing QWord runtime errors');
testreqword;
writeln('Testing QWord runtime errors was successful');
writeln;
writeln('Testing QWord string conversion');
teststringqword;
writeln('Testing QWord string conversion was successful');
writeln;
writeln('Testing QWord input/output');
testioqword;
writeln('Testing QWord input/output was successful');
writeln;
writeln('Some extra tests for critical things');
testcritical;
writeln('Extra tests for critical things were successful');
writeln('------------------------------------------------------');
writeln(' QWord test successful');
writeln('------------------------------------------------------');
writeln;
writeln('------------------------------------------------------');
writeln(' Int64 test ');
writeln('------------------------------------------------------');
writeln;
writeln('------------------------------------------------------');
writeln(' Int64 test successful');
writeln('------------------------------------------------------');
halt(0);
end.
|