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
|
-- Copyright (C) 2001 Bill Billowitch.
-- Some of the work to develop this test suite was done with Air Force
-- support. The Air Force and Bill Billowitch assume no
-- responsibilities for this software.
-- This file is part of VESTs (Vhdl tESTs).
-- VESTs is free software; you can redistribute it and/or modify it
-- under the terms of the GNU General Public License as published by the
-- Free Software Foundation; either version 2 of the License, or (at
-- your option) any later version.
-- VESTs is distributed in the hope that it will be useful, but WITHOUT
-- ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-- FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
-- for more details.
-- You should have received a copy of the GNU General Public License
-- along with VESTs; if not, write to the Free Software Foundation,
-- Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
-- ---------------------------------------------------------------------
--
-- $Id: tc2269.vhd,v 1.2 2001-10-26 16:29:46 paw Exp $
-- $Revision: 1.2 $
--
-- ---------------------------------------------------------------------
ENTITY c07s02b06x00p12n01i02269ent IS
END c07s02b06x00p12n01i02269ent;
ARCHITECTURE c07s02b06x00p12n01i02269arch OF c07s02b06x00p12n01i02269ent IS
BEGIN
TESTING: PROCESS
-- Local declarations.
variable A, B : INTEGER;
variable OKtest : INTEGER := 0;
BEGIN
-- Test integer mod operations.
-- 1. Both positive.
for A in 0 to 20 loop
for B in 1 to 20 loop
if NOT(((A - (A mod B)) rem B) = 0) then
Oktest := 1;
end if;
assert (((A - (A mod B)) rem B) = 0)
report "Mod operation has failed for integers.";
end loop;
end loop;
-- 2. A negative, B positive.
for A in -1 downto -20 loop
for B in 1 to 20 loop
if NOT(((A - (A mod B)) rem B) = 0) then
Oktest := 1;
end if;
assert (((A - (A mod B)) rem B) = 0)
report "Mod operation has failed for integers.";
end loop;
end loop;
-- 3. A positive, B negative.
for A in 0 to 20 loop
for B in -1 downto -20 loop
if NOT(((A - (A mod B)) rem B) = 0) then
Oktest := 1;
end if;
assert (((A - (A mod B)) rem B) = 0)
report "Mod operation has failed for integers.";
end loop;
end loop;
-- 4. Both negative.
for A in -1 downto -20 loop
for B in -1 downto -20 loop
if NOT(((A - (A mod B)) rem B) = 0) then
Oktest := 1;
end if;
assert (((A - (A mod B)) rem B) = 0)
report "Mod operation has failed for integers.";
end loop;
end loop;
wait for 5 ns;
assert NOT(OKtest=0)
report "***PASSED TEST: c07s02b06x00p12n01i02269"
severity NOTE;
assert (OKtest=0)
report "***FAILED TEST: c07s02b06x00p12n01i02269 - The result of the modulus operation satisfy the relation :A = B*N + (A mod B)."
severity ERROR;
wait;
END PROCESS TESTING;
END c07s02b06x00p12n01i02269arch;
|
