https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104265
--- Comment #6 from Richard Biener ---
Sure - the example is more complicated to what I'd initially try to handle ;)
Consider a fully unrolled
bool is_hello (const char *s)
{
for (int i = 0; i < 8; ++i)
if (s[i] != "hello world][i])
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104265
--- Comment #5 from Tamar Christina ---
Also for fully masked architectures we can instead of recreating the vectors
just mask out the irrelevant values.
But we should still order the exits based on complexity.
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104265
--- Comment #4 from Tamar Christina ---
(In reply to Richard Biener from comment #3)
> Note the SLP discovery opportunity is from the "reduction" PHI to the
> return which merges control flow to a zero/one flag.
Right, so I get what you mean he
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104265
--- Comment #3 from Richard Biener ---
Note the SLP discovery opportunity is from the "reduction" PHI to the
return which merges control flow to a zero/one flag.
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104265
Thomas Koenig changed:
What|Removed |Added
CC||tkoenig at gcc dot gnu.org
--- Comment
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104265
Bug 104265 depends on bug 104240, which changed state.
Bug 104240 Summary: SLP discovery does not consider swapping comparisons
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104240
What|Removed |Added
--
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104265
Andrew Pinski changed:
What|Removed |Added
Severity|normal |enhancement
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104265
Martin Liška changed:
What|Removed |Added
CC||marxin at gcc dot gnu.org
Last reconfi
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104265
Richard Biener changed:
What|Removed |Added
Depends on||104240
Blocks|
