2022-05-15 21:52:26 -05:00
|
|
|
# SPDX-License-Identifier: AGPL-3.0-Only
|
|
|
|
# Copyright (C) 2022 Sean Anderson <seanga2@gmail.com>
|
|
|
|
|
2022-08-06 20:38:36 -05:00
|
|
|
import functools
|
2022-08-07 23:23:55 -05:00
|
|
|
import random
|
2022-08-06 20:38:36 -05:00
|
|
|
|
|
|
|
import cocotb
|
|
|
|
from cocotb.result import SimTimeoutError
|
2022-08-27 12:09:30 -05:00
|
|
|
from cocotb.triggers import ClockCycles, FallingEdge, with_timeout
|
2022-08-07 23:23:55 -05:00
|
|
|
from cocotb.types import LogicArray
|
2022-08-06 20:38:36 -05:00
|
|
|
|
2022-05-15 21:52:26 -05:00
|
|
|
async def alist(xs):
|
|
|
|
return [x async for x in xs]
|
|
|
|
|
Add phy_core
This module integrates the PCS with the descrambler, implements the PMA
(which is just the link monitor), and implements loopback and coltest
functions. This is more of the PCS/PMA, but the descrambler is
technically part of the PMD, so it's the "core" instead.
We deviate from the standard in one important way: the link doesn't come
up until the descambler is locked. I think this makes sense, since if
the descrambler isn't locked, then the incoming data will be gibberish.
I suspect this isn't part of the standard because the descrambler
doesn't have a locked output in X3.263, so IEEE would have had to
specify it.
Loopback is actually implemented in the PMD, but it modifies the
behavior in several places. It disables collisions (unless
coltest is enabled). Additionally, we need to force the link up (to
avoid the lengthy stabilization timer), but ensure it is down for at
least once cycle (to ensure the descrambler desynchronizes).
On the test side, we just go through the "happy path," as many of the
edge conditions are tested for in the submodule tests. Several of those
tests are modified so that their helper functions can be reused in this
test. In particular, the rx path is now async so that we can feed it
rx_data.
Signed-off-by: Sean Anderson <seanga2@gmail.com>
2022-11-05 11:14:58 -05:00
|
|
|
async def async_iter(it):
|
|
|
|
for i in it:
|
|
|
|
yield i
|
|
|
|
|
2023-02-18 20:38:33 -06:00
|
|
|
def BIT(n):
|
|
|
|
return 1 << n
|
|
|
|
|
2023-02-18 21:32:12 -06:00
|
|
|
def GENMASK(h, l):
|
|
|
|
return (-1 << l) & ((1 << h + 1) - 1)
|
|
|
|
|
2022-05-15 21:52:26 -05:00
|
|
|
# From https://stackoverflow.com/a/7864317/5086505
|
|
|
|
class classproperty(property):
|
|
|
|
def __get__(self, cls, owner):
|
|
|
|
return classmethod(self.fget).__get__(None, owner)()
|
|
|
|
|
2022-08-06 20:38:36 -05:00
|
|
|
class timeout:
|
|
|
|
def __init__(self, time, unit):
|
|
|
|
self.time = time
|
|
|
|
self.unit = unit
|
|
|
|
|
|
|
|
def __call__(self, f):
|
|
|
|
coro = cocotb.coroutine(f)
|
|
|
|
|
|
|
|
@functools.wraps(f)
|
|
|
|
async def wrapped(*args, **kwargs):
|
|
|
|
r = coro(*args, **kwargs)
|
|
|
|
try:
|
|
|
|
return await with_timeout(r, self.time, self.unit)
|
|
|
|
except SimTimeoutError:
|
|
|
|
r.kill()
|
|
|
|
raise
|
|
|
|
return wrapped
|
|
|
|
|
2022-05-15 21:52:26 -05:00
|
|
|
class ReverseList(list):
|
|
|
|
def __init__(self, iterable=None):
|
|
|
|
super().__init__(reversed(iterable) if iterable is not None else None)
|
|
|
|
|
|
|
|
@staticmethod
|
|
|
|
def _slice(key):
|
|
|
|
start = -1 - key.start if key.start else None
|
|
|
|
stop = -key.stop if key.stop else None
|
|
|
|
return slice(start, stop, key.step)
|
|
|
|
|
|
|
|
def __getitem__(self, key):
|
|
|
|
if isinstance(key, slice):
|
|
|
|
return ReverseList(super().__getitem__(self._slice(key)))
|
|
|
|
return super().__getitem__(-1 - key)
|
|
|
|
|
|
|
|
def __setitem__(self, key, value):
|
|
|
|
if isinstance(key, slice):
|
|
|
|
super().__setitem__(self._slice(key), value)
|
|
|
|
else:
|
|
|
|
super().__setitem__(-1 - key, value)
|
|
|
|
|
|
|
|
def __delitem__(self, key):
|
|
|
|
if isinstance(key, slice):
|
|
|
|
super().__delitem__(self._slice(key))
|
|
|
|
else:
|
|
|
|
super().__delitem__(-1 - key)
|
|
|
|
|
|
|
|
def __reversed__(self):
|
|
|
|
return super().__iter__()
|
|
|
|
|
|
|
|
def __iter__(self):
|
|
|
|
return super().__reversed__()
|
2022-08-07 23:23:55 -05:00
|
|
|
|
|
|
|
def one_valid():
|
|
|
|
return 1
|
|
|
|
|
|
|
|
def two_valid():
|
|
|
|
return 2
|
|
|
|
|
|
|
|
def rand_valid():
|
|
|
|
return random.randrange(3)
|
|
|
|
|
|
|
|
class saw_valid:
|
|
|
|
def __init__(self):
|
|
|
|
self.last = 0
|
|
|
|
# Lie for TestFactory
|
|
|
|
self.__qualname__ = self.__class__.__qualname__
|
|
|
|
|
|
|
|
def __call__(self):
|
|
|
|
self.last += 1
|
|
|
|
if self.last > 2:
|
|
|
|
self.last = 0
|
|
|
|
return self.last
|
|
|
|
|
2022-08-24 11:25:07 -05:00
|
|
|
def with_valids(g, f):
|
|
|
|
for valids in (one_valid, two_valid, rand_valid, saw_valid()):
|
|
|
|
async def test(*args, valids=valids, **kwargs):
|
|
|
|
await f(*args, valids=valids, **kwargs)
|
|
|
|
test.__name__ = f"{f.__name__}_{valids.__qualname__}"
|
|
|
|
test.__qualname__ = f"{f.__qualname__}_{valids.__qualname__}"
|
|
|
|
test.valids = valids
|
|
|
|
g[test.__name__] = cocotb.test()(test)
|
|
|
|
|
2022-08-07 23:23:55 -05:00
|
|
|
async def send_recovered_bits(clk, data, valid, bits, valids):
|
2022-08-24 11:18:39 -05:00
|
|
|
bits = iter(bits)
|
2022-08-07 23:23:55 -05:00
|
|
|
await FallingEdge(clk)
|
|
|
|
try:
|
|
|
|
while True:
|
|
|
|
v = valids()
|
|
|
|
if v == 0:
|
|
|
|
d = 'XX'
|
|
|
|
elif v == 1:
|
|
|
|
d = (next(bits), 'X')
|
|
|
|
else:
|
|
|
|
first = next(bits)
|
|
|
|
try:
|
|
|
|
second = next(bits)
|
|
|
|
except StopIteration:
|
|
|
|
second = 'X'
|
2022-08-24 11:18:39 -05:00
|
|
|
v = 1
|
2022-08-07 23:23:55 -05:00
|
|
|
d = (first, second)
|
|
|
|
data.value = LogicArray(d)
|
2022-08-24 11:18:39 -05:00
|
|
|
valid.value = v
|
2022-08-07 23:23:55 -05:00
|
|
|
await FallingEdge(clk)
|
|
|
|
except StopIteration:
|
|
|
|
pass
|
2022-08-24 11:16:43 -05:00
|
|
|
|
|
|
|
def print_list_at(l, i):
|
|
|
|
print(' ' * max(50 - i, 0), *l[max(i - 50, 0):i+50], sep='')
|
|
|
|
|
|
|
|
def compare_lists(ins, outs):
|
|
|
|
assert outs
|
|
|
|
for idx, (i, o) in enumerate(zip(ins, outs)):
|
|
|
|
if i != o:
|
|
|
|
print(idx)
|
|
|
|
print_list_at(ins, idx)
|
|
|
|
print_list_at(outs, idx)
|
|
|
|
assert False, "Differring bit"
|
2022-08-27 12:09:30 -05:00
|
|
|
|
|
|
|
async def ClockEnable(clk, ce, ratio):
|
|
|
|
ce.value = 1
|
2022-11-30 14:23:59 -06:00
|
|
|
if ratio == 1:
|
|
|
|
return
|
|
|
|
|
2022-08-27 12:09:30 -05:00
|
|
|
while True:
|
2023-03-01 14:43:58 -06:00
|
|
|
await ClockCycles(clk, 1)
|
2022-08-27 12:09:30 -05:00
|
|
|
ce.value = 0
|
2023-03-01 14:43:58 -06:00
|
|
|
await ClockCycles(clk, ratio - 1)
|
2022-08-27 12:09:30 -05:00
|
|
|
ce.value = 1
|
2022-11-30 14:23:59 -06:00
|
|
|
|
|
|
|
# Adapted from https://stackoverflow.com/a/1630350/5086505
|
|
|
|
def lookahead(it):
|
|
|
|
it = iter(it)
|
|
|
|
last = next(it)
|
|
|
|
for val in it:
|
|
|
|
yield last, False
|
|
|
|
last = val
|
|
|
|
yield last, True
|