[libre-riscv-dev] [Bug 316] bperm TODO

[bugzilla-daemon at libre-soc.org]

https://bugs.libre-soc.org/show_bug.cgi?id=316

--- Comment #74 from Cole Poirier <colepoirier at gmail.com> ---
Test passes, and code has been commit-pushed. Moving on to your suggestion on
today's kanban update of integrating the formal proof of bpermd:

```
Luke in reply to Cole:

>Today I plan on integrating the Bpermd module into the
>logical pipeline, with tests.

fooocuuuus :)  adding the module to Logical main_stage.py should be
around... maximum 10 lines of code.  really.  not.  difficult.  link
the inputs.  link the outputs.  err... that's it.

btw as a third (incremental) step, after integrating it and putting in
the unit test into soc.fu.logical.test/test_pipe_caller.py, you should
actually be able to integrate the formal proof into the Logical
pipeline as well.
```

How should I go about integrating the formal proof of bpermd into the logical
pipeline? I've thought about it, and I am unsure as to how to proceed. Is there
a model I can follow as before?

I also want to follow up on a comment of Michael's from yesterday:

```
>From comment #50 of this bug

Michael Nolan 2020-05-19 20:24:19 BST
I'd say try hooking it up to main_stage and adding a test for it would be
better than trying to "optimize" the proof. Especially since there's a bug in
the module that the proof hasn't revealed (hint: it has to do with power's
numbering of bits).
```

Is my proof of bpermd in fact not a proper proof, and incorrect because it's
making an mistake with endian-ness?

-- 
You are receiving this mail because:
You are on the CC list for the bug.