https://gcc.gnu.org/bugzilla/show_bug.cgi?id=12849
--- Comment #7 from Cassio Neri ---
Thanks for implementing the modular inverse algorithm in gcc. However, the
implementation has an issue. In some cases, for no obvious reason, the compiler
falls back to the old algorithm. For instance,
boo
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=12849
Wilco changed:
What|Removed |Added
Status|NEW |RESOLVED
CC|
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=12849
krux changed:
What|Removed |Added
CC||hoganmeier at gmail dot com
--- Comment #5 from k
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=12849
Bug 12849 depends on bug 82853, which changed state.
Bug 82853 Summary: Optimize x % 3 == 0 without modulo
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=82853
What|Removed |Added
-
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=12849
Cassio Neri changed:
What|Removed |Added
CC||cassio.neri at gmail dot com
--- Comment #
