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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
|
// See LICENSE for license details.
package chiselTests
import org.scalacheck._
import chisel3._
import chisel3.testers.BasicTester
import chisel3.util._
import chisel3.util.random.LFSR
class ThingsPassThroughTester(elements: Seq[Int], queueDepth: Int, bitWidth: Int, tap: Int) extends BasicTester {
val q = Module(new Queue(UInt(bitWidth.W), queueDepth))
val elems = VecInit(elements.map {
_.asUInt()
})
val inCnt = Counter(elements.length + 1)
val outCnt = Counter(elements.length + 1)
q.io.enq.valid := (inCnt.value < elements.length.U)
q.io.deq.ready := LFSR(16)(tap)
q.io.enq.bits := elems(inCnt.value)
when(q.io.enq.fire()) {
inCnt.inc()
}
when(q.io.deq.fire()) {
//ensure that what comes otu is what comes in
assert(elems(outCnt.value) === q.io.deq.bits)
outCnt.inc()
}
when(outCnt.value === elements.length.U) {
stop()
}
}
class QueueReasonableReadyValid(elements: Seq[Int], queueDepth: Int, bitWidth: Int, tap: Int) extends BasicTester {
val q = Module(new Queue(UInt(bitWidth.W), queueDepth))
val elems = VecInit(elements.map {
_.asUInt()
})
val inCnt = Counter(elements.length + 1)
val outCnt = Counter(elements.length + 1)
q.io.enq.valid := (inCnt.value < elements.length.U)
//Queue should be full or ready
assert(q.io.enq.ready || q.io.count === queueDepth.U)
q.io.deq.ready := LFSR(16)(tap)
//Queue should be empty or valid
assert(q.io.deq.valid || q.io.count === 0.U)
q.io.enq.bits := elems(inCnt.value)
when(q.io.enq.fire()) {
inCnt.inc()
}
when(q.io.deq.fire()) {
outCnt.inc()
}
when(outCnt.value === elements.length.U) {
stop()
}
}
class CountIsCorrectTester(elements: Seq[Int], queueDepth: Int, bitWidth: Int, tap: Int) extends BasicTester {
val q = Module(new Queue(UInt(bitWidth.W), queueDepth))
val elems = VecInit(elements.map {
_.asUInt(bitWidth.W)
})
val inCnt = Counter(elements.length + 1)
val outCnt = Counter(elements.length + 1)
q.io.enq.valid := (inCnt.value < elements.length.U)
q.io.deq.ready := LFSR(16)(tap)
q.io.enq.bits := elems(inCnt.value)
when(q.io.enq.fire()) {
inCnt.inc()
assert(q.io.count === (inCnt.value - outCnt.value))
}
when(q.io.deq.fire()) {
outCnt.inc()
assert(q.io.count === (inCnt.value - outCnt.value))
}
//assert(q.io.count === (inCnt.value - outCnt.value))
when(outCnt.value === elements.length.U) {
stop()
}
}
class QueueSinglePipeTester(elements: Seq[Int], bitWidth: Int, tap: Int) extends BasicTester {
val q = Module(new Queue(UInt(bitWidth.W), 1, pipe = true))
val elems = VecInit(elements.map {
_.asUInt(bitWidth.W)
})
val inCnt = Counter(elements.length + 1)
val outCnt = Counter(elements.length + 1)
q.io.enq.valid := (inCnt.value < elements.length.U)
q.io.deq.ready := LFSR(16)(tap)
assert(q.io.enq.ready || (q.io.count === 1.U && !q.io.deq.ready))
q.io.enq.bits := elems(inCnt.value)
when(q.io.enq.fire()) {
inCnt.inc()
}
when(q.io.deq.fire()) {
outCnt.inc()
}
when(outCnt.value === elements.length.U) {
stop()
}
}
class QueuePipeTester(elements: Seq[Int], queueDepth: Int, bitWidth: Int, tap: Int) extends BasicTester {
val q = Module(new Queue(UInt(bitWidth.W), queueDepth, pipe = true))
val elems = VecInit(elements.map {
_.asUInt(bitWidth.W)
})
val inCnt = Counter(elements.length + 1)
val outCnt = Counter(elements.length + 1)
q.io.enq.valid := (inCnt.value < elements.length.U)
q.io.deq.ready := LFSR(16)(tap)
assert(q.io.enq.ready || (q.io.count === queueDepth.U && !q.io.deq.ready))
q.io.enq.bits := elems(inCnt.value)
when(q.io.enq.fire()) {
inCnt.inc()
}
when(q.io.deq.fire()) {
outCnt.inc()
}
when(outCnt.value === elements.length.U) {
stop()
}
}
class QueueFlowTester(elements: Seq[Int], queueDepth: Int, bitWidth: Int, tap: Int) extends BasicTester {
val q = Module(new Queue(UInt(bitWidth.W), queueDepth, flow = true))
val elems = VecInit(elements.map {
_.asUInt()
})
val inCnt = Counter(elements.length + 1)
val outCnt = Counter(elements.length + 1)
q.io.enq.valid := (inCnt.value < elements.length.U)
//Queue should be full or ready
assert(q.io.enq.ready || q.io.count === queueDepth.U)
q.io.deq.ready := LFSR(16)(tap)
//Queue should be empty or valid
assert(q.io.deq.valid || (q.io.count === 0.U && !q.io.enq.fire()))
q.io.enq.bits := elems(inCnt.value)
when(q.io.enq.fire()) {
inCnt.inc()
}
when(q.io.deq.fire()) {
outCnt.inc()
}
when(outCnt.value === elements.length.U) {
stop()
}
}
class QueueSpec extends ChiselPropSpec {
// Disable shrinking on error.
implicit val noShrinkListVal = Shrink[List[Int]](_ => Stream.empty)
implicit val noShrinkInt = Shrink[Int](_ => Stream.empty)
property("Queue should have things pass through") {
forAll(vecSizes, safeUIntN(20), Gen.choose(0, 15)) { (depth, se, tap) =>
whenever(se._1 >= 1 && depth >= 1 && se._2.nonEmpty) {
assertTesterPasses {
new ThingsPassThroughTester(se._2, depth, se._1, tap)
}
}
}
}
property("Queue should have reasonable ready/valid") {
forAll(vecSizes, safeUIntN(20), Gen.choose(0, 15)) { (depth, se, tap) =>
whenever(se._1 >= 1 && depth >= 1 && se._2.nonEmpty) {
assertTesterPasses {
new QueueReasonableReadyValid(se._2, depth, se._1, tap)
}
}
}
}
property("Queue should have correct count") {
forAll(vecSizes, safeUIntN(20), Gen.choose(0, 15)) { (depth, se, tap) =>
whenever(se._1 >= 1 && depth >= 1 && se._2.nonEmpty) {
assertTesterPasses {
new CountIsCorrectTester(se._2, depth, se._1, tap)
}
}
}
}
property("Queue pipe should work for 1-element queues") {
forAll(safeUIntN(20), Gen.choose(0, 15)) { (se, tap) =>
whenever(se._1 >= 1 && se._2.nonEmpty) {
assertTesterPasses {
new QueueSinglePipeTester(se._2, se._1, tap)
}
}
}
}
property("Queue pipe should work for more general queues") {
forAll(vecSizes, safeUIntN(20), Gen.choose(0, 15)) { (depth, se, tap) =>
whenever(se._1 >= 1 && depth >= 1 && se._2.nonEmpty) {
assertTesterPasses {
new QueuePipeTester(se._2, depth, se._1, tap)
}
}
}
}
property("Queue flow should work") {
forAll(vecSizes, safeUIntN(20), Gen.choose(0, 15)) { (depth, se, tap) =>
whenever(se._1 >= 1 && depth >= 1 && se._2.nonEmpty) {
assertTesterPasses {
new QueueFlowTester(se._2, depth, se._1, tap)
}
}
}
}
}
|
