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
|
-- Copyright (C) 1996 Morgan Kaufmann Publishers, Inc
-- 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: ch_09_ch_09_04.vhd,v 1.2 2001-10-24 23:31:00 paw Exp $
-- $Revision: 1.2 $
--
-- ---------------------------------------------------------------------
package arithmetic_ops is
-- code from book
procedure increment ( bv : inout bit_vector; by : in integer := 1 );
procedure increment ( int : inout integer; by : in integer := 1 );
-- end code from book
end package arithmetic_ops;
package body arithmetic_ops is
procedure increment ( bv : inout bit_vector; by : in integer := 1 ) is
begin
end procedure increment;
procedure increment ( int : inout integer; by : in integer := 1 ) is
begin
end procedure increment;
end package body arithmetic_ops;
entity ch_09_04 is
end entity ch_09_04;
library stimulus;
use stimulus.stimulus_generators.all;
architecture test of ch_09_04 is
-- code from book
-- MTI bug mt017
-- alias bv_increment is work.arithmetic_ops.increment [ bit_vector, integer ];
alias int_increment is work.arithmetic_ops.increment [ integer, integer ];
-- workaround to avoid MTI bug mt018
-- alias "*" is "and" [ bit, bit return bit ];
alias "*" is std.standard."and" [ bit, bit return bit ];
-- alias "+" is "or" [ bit, bit return bit ];
alias "+" is std.standard."or" [ bit, bit return bit ];
-- alias "-" is "not" [ bit return bit ];
alias "-" is std.standard."not" [ bit return bit ];
-- end workaround
alias high is std.standard.'1' [ return bit ];
-- end code from book
signal a, b, c, s : bit := '0';
signal test_vector : bit_vector(1 to 3);
signal test_high : bit := high;
begin
-- code from book
-- workaround to avoid MTI bug mt018
-- s <= a * b + (-a) * c;
s <= (a and b) or ((not a) and c);
-- end workaround
-- end code from book
stimulus : all_possible_values ( bv => test_vector,
delay_between_values => 10 ns );
(a, b, c) <= test_vector;
end architecture test;
|
