[Libre-soc-bugs] [Bug 782] add galois field bitmanip instructions

[bugzilla-daemon at libre-soc.org]

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

--- Comment #30 from Jacob Lifshay <programmerjake at gmail.com> ---
since GF(2^n) is a field, invert should be `gfdiv(1, v)` (since 1 is the
multiplicative identity) for all GF(2^n) values `v`.

the gcd algorithm is used for gf(p) for prime p, but there the mul, div, etc
are all integer div, mul, etc, not GF(n) operations. afaict you confused it
again.

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