3 This first version is intended for prototyping and test purposes:
4 it has "direct" access to Memory.
6 The intention is that this version remains an integral part of the
7 test infrastructure, and, just as with minerva's memory arrangement,
8 a dynamic runtime config *selects* alternative memory arrangements
9 rather than *replaces and discards* this code.
13 * https://bugs.libre-soc.org/show_bug.cgi?id=216
14 * https://libre-soc.org/3d_gpu/architecture/memory_and_cache/
18 from nmigen
.compat
.sim
import run_simulation
, Settle
19 from nmigen
.cli
import verilog
, rtlil
20 from nmigen
import Module
, Signal
, Mux
, Elaboratable
, Array
, Cat
21 from nmutil
.iocontrol
import RecordObject
22 from nmigen
.utils
import log2_int
23 from nmigen
.hdl
.rec
import Record
, Layout
25 from nmutil
.latch
import SRLatch
, latchregister
26 from soc
.decoder
.power_decoder2
import Data
27 from soc
.decoder
.power_enums
import InternalOp
28 from soc
.regfile
.regfile
import ortreereduce
29 from nmutil
.util
import treereduce
31 from soc
.fu
.ldst
.ldst_input_record
import CompLDSTOpSubset
32 from soc
.decoder
.power_decoder2
import Data
33 #from nmutil.picker import PriorityPicker
34 from nmigen
.lib
.coding
import PriorityEncoder
35 from soc
.scoreboard
.addr_split
import LDSTSplitter
36 from soc
.scoreboard
.addr_match
import LenExpand
38 # for testing purposes
39 from soc
.experiment
.testmem
import TestMemory
# TODO: replace with TMLSUI
40 # TODO: from soc.experiment.testmem import TestMemoryLoadStoreUnit
45 class PortInterface(RecordObject
):
48 defines the interface - the API - that the LDSTCompUnit connects
49 to. note that this is NOT a "fire-and-forget" interface. the
50 LDSTCompUnit *must* be kept appraised that the request is in
51 progress, and only when it has a 100% successful completion rate
52 can the notification be given (busy dropped).
54 The interface FSM rules are as follows:
56 * if busy_o is asserted, a LD/ST is in progress. further
57 requests may not be made until busy_o is deasserted.
59 * only one of is_ld_i or is_st_i may be asserted. busy_o
60 will immediately be asserted and remain asserted.
62 * addr.ok is to be asserted when the LD/ST address is known.
63 addr.data is to be valid on the same cycle.
65 addr.ok and addr.data must REMAIN asserted until busy_o
66 is de-asserted. this ensures that there is no need
67 for the L0 Cache/Buffer to have an additional address latch
68 (because the LDSTCompUnit already has it)
70 * addr_ok_o (or addr_exc_o) must be waited for. these will
71 be asserted *only* for one cycle and one cycle only.
73 * addr_exc_o will be asserted if there is no chance that the
74 memory request may be fulfilled.
76 busy_o is deasserted on the same cycle as addr_exc_o is asserted.
78 * conversely: addr_ok_o must *ONLY* be asserted if there is a
79 HUNDRED PERCENT guarantee that the memory request will be
82 * for a LD, ld.ok will be asserted - for only one clock cycle -
83 at any point in the future that is acceptable to the underlying
84 Memory subsystem. the recipient MUST latch ld.data on that cycle.
86 busy_o is deasserted on the same cycle as ld.ok is asserted.
88 * for a ST, st.ok may be asserted only after addr_ok_o had been
89 asserted, alongside valid st.data at the same time. st.ok
90 must only be asserted for one cycle.
92 the underlying Memory is REQUIRED to pick up that data and
93 guarantee its delivery. no back-acknowledgement is required.
95 busy_o is deasserted on the cycle AFTER st.ok is asserted.
98 def __init__(self
, name
=None, regwid
=64, addrwid
=48):
100 self
._regwid
= regwid
101 self
._addrwid
= addrwid
103 RecordObject
.__init
__(self
, name
=name
)
105 # distinguish op type (ld/st)
106 self
.is_ld_i
= Signal(reset_less
=True)
107 self
.is_st_i
= Signal(reset_less
=True)
108 self
.op
= CompLDSTOpSubset() # hm insn_type ld/st duplicates here
111 self
.busy_o
= Signal(reset_less
=True) # do not use if busy
112 self
.go_die_i
= Signal(reset_less
=True) # back to reset
113 self
.addr
= Data(addrwid
, "addr_i") # addr/addr-ok
114 # addr is valid (TLB, L1 etc.)
115 self
.addr_ok_o
= Signal(reset_less
=True)
116 self
.addr_exc_o
= Signal(reset_less
=True) # TODO, "type" of exception
119 self
.ld
= Data(regwid
, "ld_data_o") # ok to be set by L0 Cache/Buf
120 self
.st
= Data(regwid
, "st_data_i") # ok to be set by CompUnit
122 # TODO: elaborate function
125 class DualPortSplitter(Elaboratable
):
128 * one incoming PortInterface
129 * two *OUTGOING* PortInterfaces
130 * uses LDSTSplitter to do it
132 (actually, thinking about it LDSTSplitter could simply be
133 modified to conform to PortInterface: one in, two out)
135 once that is done each pair of ports may be wired directly
136 to the dual ports of L0CacheBuffer
138 The split is carried out so that, regardless of alignment or
139 mis-alignment, outgoing PortInterface[0] takes bit 4 == 0
140 of the address, whilst outgoing PortInterface[1] takes
143 PortInterface *may* need to be changed so that the length is
144 a binary number (accepting values 1-16).
147 self
.outp
= [PortInterface(name
="outp_0"),
148 PortInterface(name
="outp_1")]
149 self
.inp
= PortInterface(name
="inp")
152 def elaborate(self
, platform
):
155 m
.submodules
.splitter
= splitter
= LDSTSplitter(64, 48, 4)
156 comb
+= splitter
.addr_i
.eq(self
.inp
.addr
) #XXX
157 #comb += splitter.len_i.eq()
158 #comb += splitter.valid_i.eq()
159 comb
+= splitter
.is_ld_i
.eq(self
.inp
.is_ld_i
)
160 comb
+= splitter
.is_st_i
.eq(self
.inp
.is_st_i
)
161 #comb += splitter.st_data_i.eq()
162 #comb += splitter.sld_valid_i.eq()
163 #comb += splitter.sld_data_i.eq()
164 #comb += splitter.sst_valid_i.eq()
168 class DataMergerRecord(Record
):
170 {data: 128 bit, byte_enable: 16 bit}
173 def __init__(self
, name
=None):
174 layout
= (('data', 128),
176 Record
.__init
__(self
, Layout(layout
), name
=name
)
178 self
.data
.reset_less
= True
179 self
.en
.reset_less
= True
182 # TODO: formal verification
183 class DataMerger(Elaboratable
):
186 Merges data based on an address-match matrix.
187 Identifies (picks) one (any) row, then uses that row,
188 based on matching address bits, to merge (OR) all data
189 rows into the output.
191 Basically, by the time DataMerger is used, all of its incoming data is
192 determined not to conflict. The last step before actually submitting
193 the request to the Memory Subsystem is to work out which requests,
194 on the same 128-bit cache line, can be "merged" due to them being:
195 (A) on the same address (bits 4 and above) (B) having byte-enable
196 lines that (as previously mentioned) do not conflict.
198 Therefore, put simply, this module will:
199 (1) pick a row (any row) and identify it by an index labelled "idx"
200 (2) merge all byte-enable lines which are on that same address, as
201 indicated by addr_match_i[idx], onto the output
204 def __init__(self
, array_size
):
206 :addr_array_i: an NxN Array of Signals with bits set indicating address
207 match. bits across the diagonal (addr_array_i[x][x])
208 will always be set, to indicate "active".
209 :data_i: an Nx Array of Records {data: 128 bit, byte_enable: 16 bit}
210 :data_o: an Output Record of same type
211 {data: 128 bit, byte_enable: 16 bit}
213 self
.array_size
= array_size
215 for i
in range(array_size
):
216 ul
.append(Signal(array_size
,
218 name
="addr_match_%d" % i
))
219 self
.addr_array_i
= Array(ul
)
222 for i
in range(array_size
):
223 ul
.append(DataMergerRecord())
224 self
.data_i
= Array(ul
)
225 self
.data_o
= DataMergerRecord()
227 def elaborate(self
, platform
):
231 m
.submodules
.pick
= pick
= PriorityEncoder(self
.array_size
)
232 for j
in range(self
.array_size
):
233 comb
+= pick
.i
[j
].eq(self
.addr_array_i
[j
].bool())
239 for j
in range(self
.array_size
):
240 select
= self
.addr_array_i
[idx
][j
]
241 r
= DataMergerRecord()
243 comb
+= r
.eq(self
.data_i
[j
])
245 comb
+= self
.data_o
.data
.eq(ortreereduce(l
,"data"))
246 comb
+= self
.data_o
.en
.eq(ortreereduce(l
,"en"))
251 class LDSTPort(Elaboratable
):
252 def __init__(self
, idx
, regwid
=64, addrwid
=48):
253 self
.pi
= PortInterface("ldst_port%d" % idx
, regwid
, addrwid
)
255 def elaborate(self
, platform
):
257 comb
, sync
= m
.d
.comb
, m
.d
.sync
260 m
.submodules
.busy_l
= busy_l
= SRLatch(False, name
="busy")
261 m
.submodules
.cyc_l
= cyc_l
= SRLatch(True, name
="cyc")
262 comb
+= cyc_l
.s
.eq(0)
263 comb
+= cyc_l
.r
.eq(0)
265 # this is a little weird: we let the L0Cache/Buffer set
266 # the outputs: this module just monitors "state".
268 # LD/ST requested activates "busy"
269 with m
.If(self
.pi
.is_ld_i | self
.pi
.is_st_i
):
270 comb
+= busy_l
.s
.eq(1)
272 # monitor for an exception or the completion of LD.
273 with m
.If(self
.pi
.addr_exc_o
):
274 comb
+= busy_l
.r
.eq(1)
276 # however ST needs one cycle before busy is reset
277 with m
.If(self
.pi
.st
.ok | self
.pi
.ld
.ok
):
278 comb
+= cyc_l
.s
.eq(1)
281 comb
+= cyc_l
.r
.eq(1)
282 comb
+= busy_l
.r
.eq(1)
284 # busy latch outputs to interface
285 comb
+= self
.pi
.busy_o
.eq(busy_l
.q
)
290 yield self
.pi
.is_ld_i
291 yield self
.pi
.is_st_i
292 yield from self
.pi
.op
.ports()
294 yield self
.pi
.go_die_i
295 yield from self
.pi
.addr
.ports()
296 yield self
.pi
.addr_ok_o
297 yield self
.pi
.addr_exc_o
299 yield from self
.pi
.ld
.ports()
300 yield from self
.pi
.st
.ports()
305 # TODO: turn this into a module
306 def byte_reverse(m
, name
, data
, length
):
308 data_r
= Signal
.like(data
, name
=name
)
309 with m
.Switch(length
):
313 dest
= data_r
.word_select(i
, 8)
314 src
= data
.word_select(j
-1-i
, 8)
319 class L0CacheBuffer(Elaboratable
):
322 Note that the final version will have *two* interfaces per LDSTCompUnit,
323 to cover mis-aligned requests, as well as *two* 128-bit L1 Cache
324 interfaces: one for odd (addr[4] == 1) and one for even (addr[4] == 1).
326 This version is to be used for test purposes (and actively maintained
327 for such, rather than "replaced")
329 There are much better ways to implement this. However it's only
330 a "demo" / "test" class, and one important aspect: it responds
331 combinatorially, where a nmigen FSM's state-changes only activate
332 on clock-sync boundaries.
335 def __init__(self
, n_units
, mem
, regwid
=64, addrwid
=48):
336 self
.n_units
= n_units
337 self
.mem
= mem
# TODO: remove, replace with lsui
338 # TODO: self.lsui = LoadStoreUnitInterface(addr_wid=addrwid....)
340 self
.addrwid
= addrwid
342 for i
in range(n_units
):
343 ul
.append(LDSTPort(i
, regwid
, addrwid
))
344 self
.dports
= Array(ul
)
348 return log2_int(self
.mem
.regwid
//8)
350 def splitaddr(self
, addr
):
351 """split the address into top and bottom bits of the memory granularity
353 return addr
[:self
.addrbits
], addr
[self
.addrbits
:]
355 def elaborate(self
, platform
):
357 comb
, sync
= m
.d
.comb
, m
.d
.sync
359 # connect the ports as modules
360 for i
in range(self
.n_units
):
361 setattr(m
.submodules
, "port%d" % i
, self
.dports
[i
])
363 # state-machine latches
364 m
.submodules
.st_active
= st_active
= SRLatch(False, name
="st_active")
365 m
.submodules
.ld_active
= ld_active
= SRLatch(False, name
="ld_active")
366 m
.submodules
.reset_l
= reset_l
= SRLatch(True, name
="reset")
367 m
.submodules
.idx_l
= idx_l
= SRLatch(False, name
="idx_l")
368 m
.submodules
.adrok_l
= adrok_l
= SRLatch(False, name
="addr_acked")
370 # find one LD (or ST) and do it. only one per cycle.
371 # TODO: in the "live" (production) L0Cache/Buffer, merge multiple
372 # LD/STs using mask-expansion - see LenExpand class
374 m
.submodules
.ldpick
= ldpick
= PriorityEncoder(self
.n_units
)
375 m
.submodules
.stpick
= stpick
= PriorityEncoder(self
.n_units
)
376 m
.submodules
.lenexp
= lenexp
= LenExpand(4, 8)
378 lds
= Signal(self
.n_units
, reset_less
=True)
379 sts
= Signal(self
.n_units
, reset_less
=True)
382 for i
in range(self
.n_units
):
383 pi
= self
.dports
[i
].pi
384 ldi
.append(pi
.is_ld_i
& pi
.busy_o
) # accumulate ld-req signals
385 sti
.append(pi
.is_st_i
& pi
.busy_o
) # accumulate st-req signals
386 # put the requests into the priority-pickers
387 comb
+= ldpick
.i
.eq(Cat(*ldi
))
388 comb
+= stpick
.i
.eq(Cat(*sti
))
390 # hmm, have to select (record) the right port index
391 nbits
= log2_int(self
.n_units
, False)
392 ld_idx
= Signal(nbits
, reset_less
=False)
393 st_idx
= Signal(nbits
, reset_less
=False)
394 # use these because of the sync-and-comb pass-through capability
395 latchregister(m
, ldpick
.o
, ld_idx
, idx_l
.qn
, name
="ld_idx_l")
396 latchregister(m
, stpick
.o
, st_idx
, idx_l
.qn
, name
="st_idx_l")
398 # convenience variables to reference the "picked" port
399 ldport
= self
.dports
[ld_idx
].pi
400 stport
= self
.dports
[st_idx
].pi
401 # and the memory ports
402 rdport
= self
.mem
.rdport
403 wrport
= self
.mem
.wrport
405 # Priority-Pickers pick one and only one request, capture its index.
406 # from that point on this code *only* "listens" to that port.
408 sync
+= adrok_l
.s
.eq(0)
409 comb
+= adrok_l
.r
.eq(0)
410 with m
.If(~ldpick
.n
):
411 comb
+= ld_active
.s
.eq(1) # activate LD mode
412 comb
+= idx_l
.r
.eq(1) # pick (and capture) the port index
413 with m
.Elif(~stpick
.n
):
414 comb
+= st_active
.s
.eq(1) # activate ST mode
415 comb
+= idx_l
.r
.eq(1) # pick (and capture) the port index
417 # from this point onwards, with the port "picked", it stays picked
418 # until ld_active (or st_active) are de-asserted.
420 # if now in "LD" mode: wait for addr_ok, then send the address out
421 # to memory, acknowledge address, and send out LD data
422 with m
.If(ld_active
.q
):
423 # set up LenExpander with the LD len and lower bits of addr
424 lsbaddr
, msbaddr
= self
.splitaddr(ldport
.addr
.data
)
425 comb
+= lenexp
.len_i
.eq(ldport
.op
.data_len
)
426 comb
+= lenexp
.addr_i
.eq(lsbaddr
)
427 with m
.If(ldport
.addr
.ok
& adrok_l
.qn
):
428 comb
+= rdport
.addr
.eq(msbaddr
) # addr ok, send thru
429 comb
+= ldport
.addr_ok_o
.eq(1) # acknowledge addr ok
430 sync
+= adrok_l
.s
.eq(1) # and pull "ack" latch
432 # if now in "ST" mode: likewise do the same but with "ST"
433 # to memory, acknowledge address, and send out LD data
434 with m
.If(st_active
.q
):
435 # set up LenExpander with the ST len and lower bits of addr
436 lsbaddr
, msbaddr
= self
.splitaddr(stport
.addr
.data
)
437 comb
+= lenexp
.len_i
.eq(stport
.op
.data_len
)
438 comb
+= lenexp
.addr_i
.eq(lsbaddr
)
439 with m
.If(stport
.addr
.ok
):
440 comb
+= wrport
.addr
.eq(msbaddr
) # addr ok, send thru
441 with m
.If(adrok_l
.qn
):
442 comb
+= stport
.addr_ok_o
.eq(1) # acknowledge addr ok
443 sync
+= adrok_l
.s
.eq(1) # and pull "ack" latch
445 # NOTE: in both these, below, the port itself takes care
446 # of de-asserting its "busy_o" signal, based on either ld.ok going
447 # high (by us, here) or by st.ok going high (by the LDSTCompUnit).
449 # for LD mode, when addr has been "ok'd", assume that (because this
450 # is a "Memory" test-class) the memory read data is valid.
451 comb
+= reset_l
.s
.eq(0)
452 comb
+= reset_l
.r
.eq(0)
453 with m
.If(ld_active
.q
& adrok_l
.q
):
454 # shift data down before pushing out. requires masking
455 # from the *byte*-expanded version of LenExpand output
456 lddata
= Signal(self
.regwid
, reset_less
=True)
457 # TODO: replace rdport.data with LoadStoreUnitInterface.x_load_data
458 # and also handle the ready/stall/busy protocol
459 comb
+= lddata
.eq((rdport
.data
& lenexp
.rexp_o
) >>
461 # yes this looks odd (inverted)
462 with m
.If(ldport
.op
.byte_reverse
):
463 comb
+= ldport
.ld
.data
.eq(lddata
) # put data out
465 # byte-reverse the data based on ld/st width
466 lddata_r
= byte_reverse(m
, 'lddata_r', lddata
, lenexp
.len_i
)
467 comb
+= ldport
.ld
.data
.eq(lddata_r
) # put reversed- data out
468 comb
+= ldport
.ld
.ok
.eq(1) # indicate data valid
469 comb
+= reset_l
.s
.eq(1) # reset mode after 1 cycle
471 # for ST mode, when addr has been "ok'd", wait for incoming "ST ok"
472 with m
.If(st_active
.q
& stport
.st
.ok
):
473 # shift data up before storing. lenexp *bit* version of mask is
474 # passed straight through as byte-level "write-enable" lines.
475 stport_d
= stport
.st
.data
476 stdata_i
= Signal(self
.regwid
, reset_less
=True)
477 stdata
= Signal(self
.regwid
, reset_less
=True)
478 # yes this looks odd (inverted)
479 with m
.If(ldport
.op
.byte_reverse
):
480 comb
+= stdata_i
.eq(stport_d
)
482 # byte-reverse the data based on width
483 stdata_r
= byte_reverse(m
, 'stdata_r', stport_d
, lenexp
.len_i
)
484 comb
+= stdata_i
.eq(stdata_r
)
485 comb
+= stdata
.eq(stdata_i
<< (lenexp
.addr_i
*8))
486 # TODO: replace with link to LoadStoreUnitInterface.x_store_data
487 # and also handle the ready/stall/busy protocol
488 comb
+= wrport
.data
.eq(stdata
) # write st to mem
489 comb
+= wrport
.en
.eq(lenexp
.lexp_o
) # enable writes
490 comb
+= reset_l
.s
.eq(1) # reset mode after 1 cycle
492 # ugly hack, due to simultaneous addr req-go acknowledge
493 reset_delay
= Signal(reset_less
=True)
494 sync
+= reset_delay
.eq(reset_l
.q
)
495 with m
.If(reset_delay
):
496 comb
+= adrok_l
.r
.eq(1) # address reset
498 # after waiting one cycle (reset_l is "sync" mode), reset the port
499 with m
.If(reset_l
.q
):
500 comb
+= idx_l
.s
.eq(1) # deactivate port-index selector
501 comb
+= ld_active
.r
.eq(1) # leave the ST active for 1 cycle
502 comb
+= st_active
.r
.eq(1) # leave the ST active for 1 cycle
503 comb
+= reset_l
.r
.eq(1) # clear reset
504 comb
+= adrok_l
.r
.eq(1) # address reset
509 for p
in self
.dports
:
513 class TstL0CacheBuffer(Elaboratable
):
514 def __init__(self
, n_units
=3, regwid
=16, addrwid
=4):
515 # TODO: replace with TestMemoryLoadStoreUnit
516 self
.mem
= TestMemory(regwid
, addrwid
, granularity
=regwid
//8)
517 self
.l0
= L0CacheBuffer(n_units
, self
.mem
, regwid
, addrwid
<<1)
519 def elaborate(self
, platform
):
521 m
.submodules
.mem
= self
.mem
522 m
.submodules
.l0
= self
.l0
527 yield from self
.l0
.ports()
528 yield self
.mem
.rdport
.addr
529 yield self
.mem
.rdport
.data
530 yield self
.mem
.wrport
.addr
531 yield self
.mem
.wrport
.data
535 def wait_busy(port
, no
=False):
537 busy
= yield port
.pi
.busy_o
538 print("busy", no
, busy
)
546 addr_ok
= yield port
.pi
.addr_ok_o
547 print("addrok", addr_ok
)
555 ldok
= yield port
.pi
.ld
.ok
562 def l0_cache_st(dut
, addr
, data
, datalen
):
568 # have to wait until not busy
569 yield from wait_busy(port1
, no
=False) # wait until not busy
571 # set up a ST on the port. address first:
572 yield port1
.pi
.is_st_i
.eq(1) # indicate ST
573 yield port1
.pi
.op
.data_len
.eq(datalen
) # ST length (1/2/4/8)
575 yield port1
.pi
.addr
.data
.eq(addr
) # set address
576 yield port1
.pi
.addr
.ok
.eq(1) # set ok
577 yield from wait_addr(port1
) # wait until addr ok
578 # yield # not needed, just for checking
579 # yield # not needed, just for checking
580 # assert "ST" for one cycle (required by the API)
581 yield port1
.pi
.st
.data
.eq(data
)
582 yield port1
.pi
.st
.ok
.eq(1)
584 yield port1
.pi
.st
.ok
.eq(0)
586 # can go straight to reset.
587 yield port1
.pi
.is_st_i
.eq(0) # end
588 yield port1
.pi
.addr
.ok
.eq(0) # set !ok
589 # yield from wait_busy(port1, False) # wait until not busy
592 def l0_cache_ld(dut
, addr
, datalen
, expected
):
599 # have to wait until not busy
600 yield from wait_busy(port1
, no
=False) # wait until not busy
602 # set up a LD on the port. address first:
603 yield port1
.pi
.is_ld_i
.eq(1) # indicate LD
604 yield port1
.pi
.op
.data_len
.eq(datalen
) # LD length (1/2/4/8)
606 yield port1
.pi
.addr
.data
.eq(addr
) # set address
607 yield port1
.pi
.addr
.ok
.eq(1) # set ok
608 yield from wait_addr(port1
) # wait until addr ok
610 yield from wait_ldok(port1
) # wait until ld ok
611 data
= yield port1
.pi
.ld
.data
614 yield port1
.pi
.is_ld_i
.eq(0) # end
615 yield port1
.pi
.addr
.ok
.eq(0) # set !ok
616 # yield from wait_busy(port1, no=False) # wait until not busy
621 def l0_cache_ldst(arg
, dut
):
627 yield from l0_cache_st(dut
, 0x2, data
, 2)
628 yield from l0_cache_st(dut
, 0x4, data2
, 2)
629 result
= yield from l0_cache_ld(dut
, 0x2, 2, data
)
630 result2
= yield from l0_cache_ld(dut
, 0x4, 2, data2
)
632 arg
.assertEqual(data
, result
, "data %x != %x" % (result
, data
))
633 arg
.assertEqual(data2
, result2
, "data2 %x != %x" % (result2
, data2
))
636 def data_merger_merge(dut
):
638 #starting with all inputs zero
640 en
= yield dut
.data_o
.en
641 data
= yield dut
.data_o
.data
642 assert en
== 0, "en must be zero"
643 assert data
== 0, "data must be zero"
646 yield dut
.addr_array_i
[0].eq(0xFF)
647 for j
in range(dut
.array_size
):
648 yield dut
.data_i
[j
].en
.eq(1 << j
)
649 yield dut
.data_i
[j
].data
.eq(0xFF << (16*j
))
652 en
= yield dut
.data_o
.en
653 data
= yield dut
.data_o
.data
654 assert data
== 0xff00ff00ff00ff00ff00ff00ff00ff
659 class TestL0Cache(unittest
.TestCase
):
661 def test_l0_cache(self
):
663 dut
= TstL0CacheBuffer(regwid
=64)
664 #vl = rtlil.convert(dut, ports=dut.ports())
665 #with open("test_basic_l0_cache.il", "w") as f:
668 run_simulation(dut
, l0_cache_ldst(self
, dut
),
669 vcd_name
='test_l0_cache_basic.vcd')
672 class TestDataMerger(unittest
.TestCase
):
674 def test_data_merger(self
):
677 #vl = rtlil.convert(dut, ports=dut.ports())
678 #with open("test_data_merger.il", "w") as f:
681 run_simulation(dut
, data_merger_merge(dut
),
682 vcd_name
='test_data_merger.vcd')
685 class TestDualPortSplitter(unittest
.TestCase
):
687 def test_dual_port_splitter(self
):
689 dut
= DualPortSplitter()
690 #vl = rtlil.convert(dut, ports=dut.ports())
691 #with open("test_data_merger.il", "w") as f:
694 #run_simulation(dut, data_merger_merge(dut),
695 # vcd_name='test_dual_port_splitter.vcd')
698 if __name__
== '__main__':
699 unittest
.main(exit
=False)