https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68894
Andrew Pinski changed:
What|Removed |Added
Target Milestone|--- |14.0
Resolution|---
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68894
--- Comment #12 from Andrew Pinski ---
Just a quick note on this part of the bug report:
(In reply to Richard Biener from comment #3)
> Doing this in a classical way in phi-opt might end up being slightly
> convoluted.
> So I'd propose to try to
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68894
--- Comment #11 from Andrew Pinski ---
The phiopt issue is fixed for GCC 14 now.
Ifcvt will be fixed soon.
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68894
--- Comment #10 from CVS Commits ---
The trunk branch has been updated by Andrew Pinski :
https://gcc.gnu.org/g:7049241f6ee558cfc0b227b5a0a355ec29afd6f1
commit r14-201-g7049241f6ee558cfc0b227b5a0a355ec29afd6f1
Author: Andrew Pinski
Date: Thu
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68894
--- Comment #9 from Andrew Pinski ---
I have a patch which fixes the phiopt issue I saw.
The problem is when do_hoist_loads is true (which is !early and
-fhoist-adjacent-loads ), we would not do the diamond case for phiopt in later
passes.
In the
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68894
--- Comment #8 from Andrew Pinski ---
(In reply to Andrew Pinski from comment #7)
> Mine, working on improving phi-opt here; though the hoisting of the load is
> something which needs to be looked into further.
>
> I have the match.pd pattern fo
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68894
Andrew Pinski changed:
What|Removed |Added
Assignee|unassigned at gcc dot gnu.org |pinskia at gcc dot
gnu.org
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68894
Andrew Pinski changed:
What|Removed |Added
Keywords||missed-optimization, TREE
--- Comment #6
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68894
--- Comment #5 from Andrew Pinski ---
I think this is fixed on the trunk now.
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68894
--- Comment #4 from Richard Biener ---
This is a missed code hoisting opportunity again.
_6 = a1[i_24];
_7 = a2[i_24];
if (_6 < _7)
goto ;
else
goto ;
:
_8 = a3[i_24];
_22 = MIN_EXPR <_6, _8>;
goto ;
:
_9 = a3[i_24]
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68894
--- Comment #3 from Richard Biener ---
Doing this in a classical way in phi-opt might end up being slightly
convoluted.
So I'd propose to try to utilize match-and-simplify by adding
(cond (ge @0 @1) (max:s @0 @2) (max:s @1 @2))
-> (max (max @0
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68894
Richard Biener changed:
What|Removed |Added
Status|UNCONFIRMED |NEW
Last reconfirmed|
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68894
--- Comment #1 from Yuri Rumyantsev ---
Created attachment 37026
--> https://gcc.gnu.org/bugzilla/attachment.cgi?id=37026&action=edit
test-case to reproduce
It is sufficient to compile it with -O3 option to see the difference in
produced assem
13 matches
Mail list logo
