-
Notifications
You must be signed in to change notification settings - Fork 138
/
perlnum.t
1127 lines (997 loc) · 18.2 KB
/
perlnum.t
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
#! perl
# Copyright: 2001-2005 The Perl Foundation. All Rights Reserved.
# $Id$
use strict;
use warnings;
use lib qw( . lib ../lib ../../lib );
use Test::More;
use Parrot::Test tests => 55;
=head1 NAME
t/pmc/perlnum.t - Perl Numbers
=head1 SYNOPSIS
% prove t/pmc/perlnum.t
=head1 DESCRIPTION
Tests the C<PerlNum> PMC. Checks Perl-specific numeric behaviour.
=cut
my $fp_equality_macro = <<'ENDOFMACRO';
.macro fp_eq ( J, K, L )
save N0
save N1
save N2
set N0, .J
set N1, .K
sub N2, N1,N0
abs N2, N2
gt N2, 0.000001, .$FPEQNOK
restore N2
restore N1
restore N0
branch .L
.local $FPEQNOK:
restore N2
restore N1
restore N0
.endm
.macro fp_ne( J,K,L)
save N0
save N1
save N2
set N0, .J
set N1, .K
sub N2, N1,N0
abs N2, N2
lt N2, 0.000001, .$FPNENOK
restore N2
restore N1
restore N0
branch .L
.local $FPNENOK:
restore N2
restore N1
restore N0
.endm
ENDOFMACRO
output_is(<<'CODE', <<'OUTPUT', "set/get string value");
new P0, .PerlString
set P0, "bar"
set S0, P0
eq S0, "bar", OK1
print "not "
OK1: print "ok 1\n"
set P0, "\0"
set S0, P0
eq S0, "\0", OK2
print "not "
OK2: print "ok 2\n"
set P0, ""
set S0, P0
eq S0, "", OK3
print "not "
OK3: print "ok 3\n"
set P0, -1
set S0, P0
eq S0, "-1", OK4
print "not "
OK4: print "ok 4\n"
set P0, -1.0
set S0, P0
eq S0, "-1", OK5
print "not "
OK5: print "ok 5\n"
set P0, "1.23e23"
set S0, P0
eq S0, "1.23e23", OK6
print "not "
OK6: print "ok 6\n"
end
CODE
ok 1
ok 2
ok 3
ok 4
ok 5
ok 6
OUTPUT
output_is(<<"CODE", <<OUTPUT, "assign number");
@{[ $fp_equality_macro ]}
new P0, .PerlInt
assign P0, 42.21
.fp_eq(P0, 42.21, OK1)
print "not "
OK1:
print "ok 1\\n"
new P1, .PerlNum
assign P1, 21.01
.fp_eq(P1, 21.01, OK2)
print "not "
OK2:
print "ok 2\\n"
new P2, .PerlString
assign P2, 7.65
.fp_eq(P2, 7.65, OK3)
print "not "
OK3:
print "ok 3\\n"
new P3, .PerlUndef
assign P3, 1.23
.fp_eq(P3, 1.23, OK4)
print "not "
OK4:
print "ok 4\\n"
end
CODE
ok 1
ok 2
ok 3
ok 4
OUTPUT
output_is(<<CODE, <<OUTPUT, "if (P) - Num");
new P0, .PerlNum
set P0, 1.1
if P0, OK1
print "not "
OK1: print "ok 1\\n"
set P0, 0.0
if P0, BAD2
branch OK2
BAD2: print "not "
OK2: print "ok 2\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<CODE, <<OUTPUT, "unless (P) - Num");
new P0, .PerlNum
set P0, 0.0
unless P0, OK1
print "not "
OK1: print "ok 1\\n"
set P0, 1.1
unless P0, BAD2
branch OK2
BAD2: print "not "
OK2: print "ok 2\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<"CODE", <<OUTPUT, "inc, PerlNum");
@{[ $fp_equality_macro ]}
new P3, .PerlNum
set P3, -0.999
inc P3
.fp_eq(P3, 0.001, OK1)
print "not "
OK1: print "ok 1\\n"
inc P3
.fp_eq(P3, 1.001, OK2)
print "not "
OK2: print "ok 2\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<"CODE", <<OUTPUT, "dec, PerlNum");
@{[ $fp_equality_macro ]}
new P3, .PerlNum
set P3, 1.001
dec P3
.fp_eq(P3, 0.001, OK1)
print "not "
OK1: print "ok 1\\n"
dec P3
.fp_eq(P3, -0.999, OK2)
print "not "
OK2: print "ok 2\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<CODE, <<OUTPUT, "mul_p_p, PerlNum");
@{[ $fp_equality_macro ]}
new P0,.PerlNum
new P1,.PerlNum
set P0,-2.5
set P1,2.5
mul P0,P1
.fp_eq(P0,-6.25,EQ1)
print "not "
EQ1: print "ok 1"
print "\\n"
new P2, .PerlInt
set P2, 2
mul P0, P2
.fp_eq(P0,-12.5,EQ2)
print "not "
EQ2: print "ok 2"
print "\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<"CODE", <<OUTPUT, "add number to string integer");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlString
set P0, 6.1
set P1, "7"
add P0,P0,P1
.fp_eq( P0, 13.1, EQ1)
print P0
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "add number to string");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlString
set P0, 6.1
set P1, "ab"
add P0,P0,P1
.fp_eq( P0, 6.1, EQ1)
print P0
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "add number to string number");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlString
set P0, 6.1
set P1, "7.5"
add P0,P0,P1
.fp_eq( P0, 13.6, EQ1)
print P0
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "add number to self");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
set P0, 123.123
add P0, P0, P0
.fp_eq( P0, 246.246, EQ1)
print P0
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "sub number from self");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
set P0, 456.456
sub P0, P0, P0
.fp_eq( P0, 0, EQ1)
print P0
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "multiply number by self");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
set P0, 124.124
mul P0, P0, P0
.fp_eq( P0, 15406.767376, EQ1)
print P0
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "divide number by self");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
set P0, 23.23
div P0, P0, P0
.fp_eq( P0, 1, EQ1)
print P0
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
#
# Number vs. number
#
output_is(<<"CODE", <<OUTPUT, "add number to other");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P0, 123.123
set P1, 321.321
add P1, P1, P0
.fp_eq( P1, 444.444, EQ1)
print P1
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "subtract number from other");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P0, 123.123
set P1, 321.321
sub P1, P1, P0
.fp_eq( P1, 198.198, EQ1)
print P1
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "multiply number by other");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P0, 123.123
set P1, 321.321
mul P1, P1, P0
.fp_eq( P1, 39562.005483, EQ1)
print P1
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "divide number by other");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P0, 123.123
set P1, 246.246
div P1, P1, P0
.fp_eq( P1, 2, EQ1)
print P1
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
#
# Number vs. integer
#
output_is(<<"CODE", <<OUTPUT, "add integer to number");
@{[ $fp_equality_macro ]}
new P0, .PerlInt
new P1, .PerlNum
set P0, 123
set P1, 321.321
add P1, P1, P0
.fp_eq( P1, 444.321, EQ1)
print P1
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "subtract integer from number");
@{[ $fp_equality_macro ]}
new P0, .PerlInt
new P1, .PerlNum
set P0, 123
set P1, 321.321
sub P1, P1, P0
.fp_eq( P1, 198.321, EQ1)
print P1
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "multiply integer by number");
@{[ $fp_equality_macro ]}
new P0, .PerlInt
new P1, .PerlNum
set P0, 123
set P1, 321.321
mul P1, P1, P0
.fp_eq( P1,39522.483 , EQ1)
print P1
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "divide integer by number");
@{[ $fp_equality_macro ]}
new P0, .PerlInt
new P1, .PerlNum
set P0, 123
set P1, 246.246
div P1, P1, P0
.fp_eq( P1, 2.002 , EQ1)
print P1
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
#
# Number vs. integer
#
output_is(<<"CODE", <<OUTPUT, "add integer to number");
@{[ $fp_equality_macro ]}
new P0, .PerlInt
new P1, .PerlNum
set P0, 123
set P1, 321.321
add P1, P0, P1
.fp_eq( P1, 444.321 , EQ1)
print P1
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "subtract integer from number");
@{[ $fp_equality_macro ]}
new P0, .PerlInt
new P1, .PerlNum
set P0, 123
set P1, 321.321
sub P1, P0, P1
.fp_eq( P1, -198.321000, EQ1)
print P1
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "multiply integer by number");
@{[ $fp_equality_macro ]}
new P0, .PerlInt
new P1, .PerlNum
set P0, 123
set P1, 321.321
mul P1, P0, P1
.fp_eq( P1, 39522.483, EQ1)
print P1
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "divide integer by number");
@{[ $fp_equality_macro ]}
new P0, .PerlInt
new P1, .PerlNum
set P0, 123
set P1, 246.246
div P1, P0, P1
.fp_eq( P1, 0.499500, EQ1)
print P1
print "not "
EQ1: print "ok 1\\n"
end
CODE
ok 1
OUTPUT
output_is(<<'CODE', <<OUTPUT, "add number number gives int");
new P0, .PerlNum
new P1, .PerlNum
set P0, 4.2
set P1, 2.8
add P0, P1
print P0
print "\n"
end
CODE
7
OUTPUT
output_is(<<'CODE', <<OUTPUT, "sub number number gives int");
new P0, .PerlNum
new P1, .PerlNum
set P0, 4.2
set P1, 2.2
sub P0, P1
print P0
print "\n"
end
CODE
2
OUTPUT
output_is(<<'CODE', <<OUTPUT, "mul number number gives int");
new P0, .PerlNum
new P1, .PerlNum
set P0, 4.5
set P1, 2.0
mul P0, P1
print P0
print "\n"
end
CODE
9
OUTPUT
output_is(<<'CODE', <<OUTPUT, "divide number by number gives int");
new P0, .PerlNum
new P1, .PerlNum
set P0, 4.2
set P1, 2.1
div P0, P1
print P0
print "\n"
end
CODE
2
OUTPUT
output_is(<<"CODE", <<OUTPUT, "add PerlNum to PerlNum");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P1, 4000.04
set P0, 123
add P0, P0, P1
.fp_eq( P0, 4123.04, EQ1)
print "not "
EQ1: print "ok 1"
print "\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "subtract PerlNum from PerlNum");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P1, 4000.04
set P0, 123
sub P0, P0, P1
.fp_eq( P0, -3877.04, EQ1)
print "not "
EQ1: print "ok 1"
print "\\n"
new P2, .PerlNum
new P3, .PerlNum
new P4, .PerlNum
set P2, 12.7
set P3, 12.6
sub P3, P2
.fp_eq( P3, -0.1, EQ2)
print "not "
EQ2: print "ok 2"
print "\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<'CODE', <<OUTPUT, "multiply PerlNum with PerlNum");
new P0, .PerlNum
new P1, .PerlNum
set P1, 4000.04
set P0, 123
mul P0, P0, P1
print P0
print "\n"
end
CODE
492004.920000
OUTPUT
output_is(<<"CODE", <<OUTPUT, "divide PerlNum by PerlNum");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P1, 4000
set P0, 123
div P0, P0, P1
.fp_eq( P0, 0.03074969250307496925, EQ1)
print P0
print "not "
EQ1: print "ok 1"
print "\\n"
end
CODE
ok 1
OUTPUT
output_is(<<"CODE", <<OUTPUT, "add INTVAL to PerlNum");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P0, 12.5
add P1, P0, 12
.fp_eq(P1, 24.5, OK1)
print "not "
OK1: print "ok 1\\n"
add P0, -12
.fp_eq(P0, 0.5, OK2)
print "not "
OK2: print "ok 2\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<"CODE", <<OUTPUT, "add FLOATVAL to PerlNum");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P0, 12.5
add P1, P0, 12.6
.fp_eq(P1, 25.1, OK1)
print "not "
OK1: print "ok 1\\n"
add P0, -100.2
.fp_eq(P0, -87.7, OK2)
print "not "
OK2: print "ok 2\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<"CODE", <<OUTPUT, "subtract INTVAL from PerlNum");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P0, 12.5
sub P1, P0, 12
.fp_eq(P1, 0.5, OK1)
print "not "
OK1: print "ok 1\\n"
sub P0, -12
.fp_eq(P0, 24.5, OK2)
print "not "
OK2: print "ok 2\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<"CODE", <<OUTPUT, "subtract FLOATVAL from PerlNum");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P0, 12.5
sub P1, P0, 12.6
.fp_eq(P1, -0.1, OK1)
print "not "
OK1: print "ok 1\\n"
sub P0, -100.2
.fp_eq(P0, 112.7, OK2)
print "not "
OK2: print "ok 2\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<"CODE", <<OUTPUT, "multiply PerlNum by INTVAL");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P0, 12.5
mul P1, P0, 5
.fp_eq(P1, 62.5, OK1)
print "not "
OK1: print "ok 1\\n"
mul P0, -1
.fp_eq(P0, -12.5, OK2)
print "not "
OK2: print "ok 2\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<"CODE", <<OUTPUT, "multiply PerlNum by FLOATVAL");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P0, 12.5
mul P1, P0, 12.5
.fp_eq(P1, 156.25, OK1)
print "not "
OK1: print "ok 1\\n"
mul P0, 2.2
.fp_eq(P0, 27.5, OK2)
print "not "
OK2: print "ok 2\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<"CODE", <<OUTPUT, "divide PerlNum by INTVAL");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P0, 12.5
div P1, P0, 5
.fp_eq(P1, 2.5, OK1)
print "not "
OK1: print "ok 1\\n"
div P0, 10
.fp_eq(P0, 1.25, OK2)
print "not "
OK2: print "ok 2\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<"CODE", <<OUTPUT, "divide PerlNum by FLOATVAL");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
set P0, 12.5
div P1, P0, 0.35
.fp_eq(P1, 35.714286, OK1)
print "not "
OK1: print "ok 1\\n"
div P0, 5.0
.fp_eq(P0, 2.5, OK2)
print "not "
OK2: print "ok 2\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<"CODE", <<OUTPUT, "eq_p_n");
new P0, .PerlNum
set P0, 12.5
eq P0, 12.5, OK1
print "not "
OK1: print "ok 1\\n"
eq P0, 25.0, BAD2
branch OK2
BAD2: print "not "
OK2: print "ok 2\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<"CODE", <<OUTPUT, "ne_p_n");
new P0, .PerlNum
set P0, 12.5
ne P0, 12.0, OK1
print "not "
OK1: print "ok 1\\n"
ne P0, 12.5, BAD2
branch OK2
BAD2: print "not "
OK2: print "ok 2\\n"
end
CODE
ok 1
ok 2
OUTPUT
output_is(<<"CODE", <<OUTPUT, "eq_num");
new P0, .PerlNum
new P1, .PerlNum
set N0, 12.5
set P0, N0
set P1, N0
eq_num P0, P1, OK1
print "not "
OK1: print "ok 1\\n"
inc P1
eq_num P0, P1, BAD2
branch OK2
BAD2: print "not "
OK2: print "ok 2\\n"
new P2, .PerlInt
set P2, N0
eq_num P0, P2, OK3
print "not "
OK3: print "ok 3\\n"
end
CODE
ok 1
ok 2
ok 3
OUTPUT
output_is(<<CODE, <<OUTPUT, "p = fmod(p,p)");
@{[ $fp_equality_macro ]}
new P0, .PerlNum
new P1, .PerlNum
new P2, .PerlNum
new P3, .PerlInt
set P0, 13.4
set P1, 6.0
cmod P2, P0, P1
.fp_eq(P2, 1.4, OK1)
print "not "
OK1: print "ok 1\\n"
set P0, -25.1
cmod P3, P0, P1
.fp_eq(P3, -1.1, OK2)
print "not "
OK2: print "ok 2\\n"
cmod P0, P0, P1
.fp_eq(P0, -1.1, OK3)
print "not "
OK3: print "ok 3\\n"
end
CODE
ok 1
ok 2
ok 3
OUTPUT
#
# s. config/gen/platform/generic/math.h
#
output_is(<<'CODE', <<'OUTPUT', "+- zero");
new P0, .PerlNum
set P0, 0.0
print P0
print "\n"
set P0, -0.0
print P0
print "\n"
end
CODE
0
-0.000000
OUTPUT
pir_output_is(<< 'CODE', << 'OUTPUT', "Truth of a positive float");
.sub _main
.local pmc float_1
float_1 = new Float
float_1 = 123.123
print float_1
if float_1 goto IS_TRUE
print " is false\n"
end
IS_TRUE:
print " is true\n"
end
.end
CODE
123.123 is true
OUTPUT
pir_output_is(<< 'CODE', << 'OUTPUT', "Truth of a negative float");
.sub _main
.local pmc float_1
float_1 = new Float