https://gcc.gnu.org/bugzilla/show_bug.cgi?id=114855
Sam James <sjames at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
See Also| |https://github.com/GaloisIn
| |c/cryptol-compiler/issues/4
| |2
--- Comment #18 from Sam James <sjames at gcc dot gnu.org> ---
(In reply to Richard Biener from comment #15)
> The testcase is a bit unwieldly for developing a fix - I wonder if it's
> possible to auto-generate smaller testcases with the same structure?
Jeremy, could you give us some recipe for it?
That said I tried to look a bit, the file has "Automatically generated by SBV".
It looks like an SMT solver:
https://hackage.haskell.org/package/sbv-10.11/docs/Documentation-SBV-Examples-CodeGeneration-AddSub.html
(the example looks kind of similar to the original testcase too, just way
smaller).
That led me to
https://github.com/GaloisInc/cryptol-compiler/issues/42#issuecomment-2076405286.
I don't know enough about Haskell stuff to try extract a generator from that
though.
