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
|
/*****************************************************************************
Licensed to Accellera Systems Initiative Inc. (Accellera) under one or
more contributor license agreements. See the NOTICE file distributed
with this work for additional information regarding copyright ownership.
Accellera licenses this file to you under the Apache License, Version 2.0
(the "License"); you may not use this file except in compliance with the
License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied. See the License for the specific language governing
permissions and limitations under the License.
*****************************************************************************/
/*****************************************************************************
fsm.cpp --
Original Author: Rocco Jonack, Synopsys, Inc., 1999-07-30
*****************************************************************************/
/*****************************************************************************
MODIFICATION LOG - modifiers, enter your name, affiliation, date and
changes you are making here.
Name, Affiliation, Date:
Description of Modification:
*****************************************************************************/
#include "fsm.h"
void fsm::entry(){
sc_biguint<4> tmp1;
sc_biguint<4> tmp2;
sc_biguint<4> tmp3;
sc_unsigned out_tmp2(12);
sc_unsigned out_tmp3(12);
unsigned int tmpint;
// reset_loop
if (reset.read() == true) {
out_value1.write(0);
out_value2.write(0);
out_value3.write(0);
out_valid1.write(false);
out_valid2.write(false);
out_valid3.write(false);
wait();
} else wait();
//
// main loop
//
while(1) {
do { wait(); } while (in_valid == false);
//reading inputs
tmp1 = in_value1.read();
//easy, just a bunch of different waits
out_valid1.write(true);
tmpint = tmp1.to_uint();
wait();
switch (tmpint) {
case 4 :
wait();
wait();
wait();
wait();
out_value1.write(3);
wait();
break;
case 3 :
out_value1.write(2);
wait();
wait();
wait();
break;
case 2 :
out_value1.write(1);
wait();
wait();
break;
default :
out_value1.write(tmp1);
wait();
break;
};
out_valid1.write(false);
wait();
//the first branch should be pushed out in latency due to long delay
tmp2 = in_value2.read();
out_valid2.write(true);
wait();
tmpint = tmp2.to_uint();
switch (tmpint) {
case 0 :
case 1 :
case 2 :
case 3 :
//long operation should extent latency
out_tmp2 = tmp2*tmp2*tmp2;
wait();
break;
case 4 :
case 5 :
case 6 :
case 7 :
//short operation should not extent latency
out_tmp2 = 4;
wait();
break;
case 8 :
case 9 :
case 10 :
case 11 :
//wait statements should extent latency
out_tmp2 = 1;
wait();
wait();
wait();
break;
};
out_value2.write( sc_biguint<4>( out_tmp2 ) );
out_valid2.write(false);
wait();
// and just another short case, maybe later to check unbalanched case
tmp3 = in_value3.read();
out_valid3.write(true);
wait();
tmpint = tmp3.to_uint();
switch (tmpint) {
case 0 :
case 1 :
case 2 :
case 3 :
//long operation should extent latency
out_tmp3 = tmp3*tmp3*tmp3;
wait();
break;
default :
//short operation should not extent latency
out_tmp3 = 4;
wait();
break;
};
out_value3.write( sc_biguint<4>( out_tmp3 ) );
wait();
out_valid3.write(false);
}
}
// EOF
|
