RepeatHiddens in Nested Functions

Approved-by: Yuan-Po (Paul) Teng

To avoid connecting non function ports to function ports.

Fix Arbiter with FunCall inside Map

Approved-by: Yuan-Po (Paul) Teng

Generalize some rewrites to work with n-tuples

Approved-by: Tzung-Han Juang

The original implementation would count all occurrences and check if
that matched the number of times it was repeated (which is encoded by
the size of the reps sequence).

The slight issue is that the reps sequence is actually a cons list,
which means calculating its size is O(n).

We can do better.

The observation is to instead store the number of occurrences that
aren't repeated by having the repeating side decrease the counter.

So then to check if all occurrences go through some repeat becomes a
0-check, and to check if there is repeats do happen (so it's not like
the element is never used) becomes a cons-check.

Curiously, the two find...Candidates function are quite similar.

For example:

  \(u : (t0, t1, t2, t3)) -> (u.0, u.1)

The above example would unfortunately fulfill all the guard conditions
of removeSelect, but we know that this cannot be correct because the
function transforms a tuple-4 into a tuple-2.

To clarify, the original tuple-2 pattern is safe. I missed this case
when generalizing it to tuple-N.

By using a map to store the candidates, we can hoist multiple repeats at
once. This is more useful for tuples that have more than two elements
because for tuple-2's, there usually is only one element that is being
repeated.

Said rules to occassionally occur when doing in-buffer sliding.

Note that initializing variable only works for first time. After
that, the variable is contaminated and will break the controller.

To avoid cases that ready signal is never asserted (Usually caused
by full buffer). Also next client mech only switches to the clients
with asserted valid signal. This change is to avoid deadlock caused
by write-ready and even number of clients. (Write-ready flips every
cycle. If the number of clients is even, client 0 cannot be reached
because ready signal is always 0 for it.)

Solver-based e-graph extraction, outlining on neural networks

Approved-by: Tzung-Han Juang

Make visitAndRebuild pattern of mapFissionMapStmFun consistent

Approved-by: Jonathan Van der Cruysse

Yuan-Po (Paul) Teng authored 1 year ago and Tzung-Han JUANG committed 1 year ago

Update ClipBankersRound apply for arch level

Approved-by: Tzung-Han Juang

Exclude Lambda's param from RepeatHidden insertion

Approved-by: Yuan-Po (Paul) Teng

For some reason, this triggered a pretty incomprehensible error while
rebuilding ArithType...
(and it hasn't happened until now...)

In any case, this new definition is now up-to-date with the algo level.

In repeatFunctionLeaves, we only want to insert RepeatHidden if a
param is bounded in Lambda's body. Note that Lambda's param is not
bounded if we look at Lambda's body only.

Fix Aribiters with only Scalar/BasicData inputs

Approved-by: Yuan-Po (Paul) Teng

Such signals are designed for stream so they will get the circuit stuck.

We have to consider ready signal to proper switch to another client.

Consider Ready signal to avoid getting stuck

Fix RepeatHidden Insertion

Approved-by: Yuan-Po (Paul) Teng

Avoid an infinite rewrite loop with map map fission

Approved-by: Tzung-Han Juang