https://gcc.gnu.org/bugzilla/show_bug.cgi?id=65855
Richard Biener changed:
What|Removed |Added
CC||jakub at gcc dot gnu.org
--- Comment #6
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=65855
Richard Biener changed:
What|Removed |Added
CC||spop at gcc dot gnu.org
--- Comment #5
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=65855
--- Comment #4 from Richard Biener ---
match.pd now has the desired simplification. So we run into
(chrec_apply
(varying_loop = 1
)
(chrec = {1, +, {2, +, 1}_1}_1)
(x = (long unsigned int) n_3(D) + 18446744073709551615)
(res = scev_not_
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=65855
Richard Biener changed:
What|Removed |Added
CC||ktietz at gcc dot gnu.org,
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=65855
--- Comment #2 from Shawn Landden ---
Created attachment 35399
--> https://gcc.gnu.org/bugzilla/attachment.cgi?id=35399&action=edit
triange, 64-bit version
This can also work with 128-bit multiple of course as well.
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=65855
Richard Biener changed:
What|Removed |Added
Status|UNCONFIRMED |ASSIGNED
Last reconfirmed|
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=65855
Andrew Pinski changed:
What|Removed |Added
Keywords||missed-optimization
Version|5
