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
|
# SPDX-License-Identifier: BSD-2-Clause-FreeBSD
#
# Copyright (c) 2017 Alan Somers
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions
# are met:
# 1. Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
#
# THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
# ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
# SUCH DAMAGE.
#
# $FreeBSD$
atf_test_case bmod
bmod_head()
{
atf_set "descr" "Tests the remainder % operator"
}
bmod_body()
{
cat > input.dc << EOF
0 3 % p # basic usage
1 3 % p
2 3 % p
3 3 % p
4 3 % p
_1 3 % p # negative dividends work like a remainder, not a modulo
1 _3 % p # negative divisors use the divisor's absolute value
1k # fractional remainders
5 3 % p
6 5 % p
5.4 3 % p
_.1 3 % p
1.1 _3 % p
1 .3 % p
EOF
dc input.dc > output.txt
cat > expect.txt << EOF
0
1
2
0
1
-1
1
2
1
2.4
-.1
1.1
.1
EOF
atf_check cmp expect.txt output.txt
}
atf_test_case bmod_by_zero
bmod_by_zero_head()
{
atf_set "descr" "remaindering by zero should print a warning"
}
bmod_by_zero_body()
{
atf_check -e match:"remainder by zero" dc -e '1 0 %'
}
atf_test_case bdivmod
bdivmod_head()
{
atf_set "descr" "Tests the divide and modulo ~ operator"
}
bdivmod_body()
{
cat > input.dc << EOF
0 3 ~ n32Pp # basic usage
1 3 ~ n32Pp
2 3 ~ n32Pp
3 3 ~ n32Pp
4 3 ~ n32Pp
_1 3 ~ n32Pp # negative dividends work like a remainder, not a modulo
_4 3 ~ n32Pp # sign of quotient and divisor must agree
1 _3 ~ n32Pp # negative divisors use the divisor's absolute value
1k # fractional remainders
5 3 ~ n32Pp
6 5 ~ n32Pp
5.4 3 ~ n32Pp
_.1 3 ~ n32Pp
1.1 _3 ~ n32Pp
1 .3 ~ n32Pp
4k
.01 .003 ~ n32Pp # divmod quotient always has scale=0
EOF
dc input.dc > output.txt
cat > expect.txt << EOF
0 0
1 0
2 0
0 1
1 1
-1 0
-1 -1
1 0
2 1.6
1 1.2
2.4 1.8
-.1 0.0
1.1 -.3
.1 3.3
.001 3.3333
EOF
atf_check cmp expect.txt output.txt
}
atf_test_case bdivmod_by_zero
bdivmod_by_zero_head()
{
atf_set "descr" "divmodding by zero should print a warning"
}
bdivmod_by_zero_body()
{
atf_check -e match:"divide by zero" dc -e '1 0 ~'
}
atf_init_test_cases()
{
atf_add_test_case bmod
atf_add_test_case bmod_by_zero
atf_add_test_case bdivmod
atf_add_test_case bdivmod_by_zero
}
|
