[Bug tree-optimization/86136] Modular multiplication optimization

2025-04-09 Thread mcccs at gmx dot com via Gcc-bugs
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=86136 mcccs at gmx dot com changed: What|Removed |Added Resolution|--- |WONTFIX Status|NEW

[Bug tree-optimization/86136] Modular multiplication optimization

2021-11-16 Thread navidrahimi at microsoft dot com via Gcc-bugs
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=86136 Navid Rahimi changed: What|Removed |Added CC||navidrahimi at microsoft dot com --- Com

[Bug tree-optimization/86136] Modular multiplication optimization

2018-06-24 Thread mcccs at gmx dot com
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=86136 --- Comment #3 from MCCCS --- What about unsigned int k (unsigned int a) { if (a > 5) { __builtin_unreachable(); } return (a * 83) % 5; }

[Bug tree-optimization/86136] Modular multiplication optimization

2018-06-14 Thread rguenth at gcc dot gnu.org
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=86136 Richard Biener changed: What|Removed |Added Status|UNCONFIRMED |NEW Last reconfirmed|

[Bug tree-optimization/86136] Modular multiplication optimization

2018-06-13 Thread mcccs at gmx dot com
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=86136 --- Comment #1 from MCCCS --- Note: It can notice (a * n) % k = 0 if n is a multiple of k. The bug happens only if n % k != 0.