source: caseStudy_Huffmann/huffmann/huff_with_env/environment2.mv

Last change on this file was 105, checked in by cecile, 12 years ago

Hufmann case study

File size: 2.8 KB
RevLine 
[105]1# vl2mv environment2.v
2# version: 2.4
3# date:    17:32:27 07/20/2012 (CEST)
4.model environment
5# I/O ports
6.outputs addr<0> addr<1> addr<2> addr<3> addr<4>
7.outputs val
8.inputs i_val
9.inputs i_addr<0> i_addr<1> i_addr<2> i_addr<3> i_addr<4>
10.inputs ack
11# addr  = 0
12.names addr$raw_n0<0>
130
14.names addr$raw_n0<1>
150
16.names addr$raw_n0<2>
170
18.names addr$raw_n0<3>
190
20.names addr$raw_n0<4>
210
22# non-blocking assignments for initial
23# val  = 1
24.names val$raw_n1
251
26# non-blocking assignments for initial
27# r_val  = 1
28.names r_val$raw_n2
291
30# non-blocking assignments for initial
31# val  = 0
32.names val$raw_n3
330
34.names _n5
351
36# ack  == 1
37.names ack _n5 _n6
38.def 0
390 1 1
401 0 1
41.names _n6 _n4
420 1 
431 0 
44.names _n4 _n8
45- =_n4
46# val  = (r_val  == 1) ? 0 : i_val
47.names _nb
481
49# r_val  == 1
50.names r_val _nb _nc
51.def 0
520 1 1
531 0 1
54.names _nc _na
550 1 
561 0 
57.names _ne
580
59# (r_val  == 1) ? 0 : i_val
60.names _na _ne i_val _nf
61.def 0
621 1 - 1
630 - 1 1
64.names _nf val$_n4_n9$true
65- =_nf
66# addr  = i_addr
67.names i_addr<0> addr$_n4_n11$true<0>
68- =i_addr<0>
69.names i_addr<1> addr$_n4_n11$true<1>
70- =i_addr<1>
71.names i_addr<2> addr$_n4_n11$true<2>
72- =i_addr<2>
73.names i_addr<3> addr$_n4_n11$true<3>
74- =i_addr<3>
75.names i_addr<4> addr$_n4_n11$true<4>
76- =i_addr<4>
77# if/else (ack  == 1)
78.names _n4 val$_n4_n9$true val$raw_n3 val$_n4$raw_n13
79.def 0
801 1 - 1
810 - 1 1
82.names _n4 addr$_n4_n11$true<0> addr<0> addr$_n4$raw_n17<0>
83.def 0
841 1 - 1
850 - 1 1
86.names _n4 addr$_n4_n11$true<1> addr<1> addr$_n4$raw_n17<1>
87.def 0
881 1 - 1
890 - 1 1
90.names _n4 addr$_n4_n11$true<2> addr<2> addr$_n4$raw_n17<2>
91.def 0
921 1 - 1
930 - 1 1
94.names _n4 addr$_n4_n11$true<3> addr<3> addr$_n4$raw_n17<3>
95.def 0
961 1 - 1
970 - 1 1
98.names _n4 addr$_n4_n11$true<4> addr<4> addr$_n4$raw_n17<4>
99.def 0
1001 1 - 1
1010 - 1 1
102# r_val  = i_val
103.names i_val r_val$raw_n1f
104- =i_val
105# conflict arbitrators
106.names _n8 _n20
107.def 0
108 1 1
109.names _n20 addr$_n4$raw_n17<0> addr$_n4$raw_n17<1> addr$_n4$raw_n17<2> addr$_n4$raw_n17<3> addr$_n4$raw_n17<4> addr<0> addr<1> addr<2> addr<3> addr<4> -> _n21<0> _n21<1> _n21<2> _n21<3> _n21<4>
1101 - - - - - - - - - - =addr$_n4$raw_n17<0> =addr$_n4$raw_n17<1> =addr$_n4$raw_n17<2> =addr$_n4$raw_n17<3> =addr$_n4$raw_n17<4>
1110 - - - - - - - - - - =addr<0> =addr<1> =addr<2> =addr<3> =addr<4>
112.names _n22
113.def 0
114 1
115.names _n22 r_val$raw_n1f _n23
116.def 0
1171 0 0
1181 1 1
119.names _n8 _n24
120.def 0
121 - 1
122 1 1
123.names _n24 val$_n4$raw_n13 _n25
124.def 0
1251 0 0
1261 1 1
127# non-blocking assignments
128# latches
129.r addr$raw_n0<0> addr<0>
130.def 0
1311 1
132.r addr$raw_n0<1> addr<1>
133.def 0
1341 1
135.r addr$raw_n0<2> addr<2>
136.def 0
1371 1
138.r addr$raw_n0<3> addr<3>
139.def 0
1401 1
141.r addr$raw_n0<4> addr<4>
142.def 0
1431 1
144.latch _n21<0> addr<0>
145.latch _n21<1> addr<1>
146.latch _n21<2> addr<2>
147.latch _n21<3> addr<3>
148.latch _n21<4> addr<4>
149.r val$raw_n1 val
1500 0
1511 1
152.latch _n25 val
153.r r_val$raw_n2 r_val
1540 0
1551 1
156.latch _n23 r_val
157# quasi-continuous assignment
158.end
Note: See TracBrowser for help on using the repository browser.