<piegames>
Formal question here: I know that the solver will try to reach every `cover` statement one at a time, independently. Is there a way to make this a "search for all combinations"?
<piegames>
Because I want to cover different operations, but I also want that any of these operations can work with pipeline backpressurce & other corner cases
<mwk>
not that I know of; best you can do is to use generate-for to make writing all the combinations less tedious I guess
emeb_mac has joined #yosys
eater has quit [*.net *.split]
vup has quit [*.net *.split]
kristianpaul has quit [*.net *.split]
indy has quit [*.net *.split]
lkcl has quit [*.net *.split]
mithro has quit [*.net *.split]
sm2n has quit [*.net *.split]
dys has quit [*.net *.split]
anticw_ has quit [*.net *.split]
killjoy has quit [*.net *.split]
vup has joined #yosys
eater has joined #yosys
indy has joined #yosys
kristianpaul has joined #yosys
sm2n has joined #yosys
lkcl has joined #yosys
dys has joined #yosys
anticw_ has joined #yosys
killjoy has joined #yosys
mithro has joined #yosys
vidbina has quit [Ping timeout: 252 seconds]
TD--Linux is now known as TD-Linux
emeb_mac has quit [Quit: Leaving.]
msh_ has joined #yosys
msh has quit [Read error: Connection reset by peer]
vidbina has joined #yosys
vidbina has quit [Ping timeout: 240 seconds]
GenTooMan has quit [Ping timeout: 250 seconds]
GenTooMan has joined #yosys
FabM has quit [Ping timeout: 240 seconds]
gsmecher has joined #yosys
lansiir has quit [Read error: Connection reset by peer]