https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105832
Andrew Pinski changed:
What|Removed |Added
Target Milestone|13.3|14.0
Resolution|---
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105832
--- Comment #18 from CVS Commits ---
The trunk branch has been updated by Andrew Pinski :
https://gcc.gnu.org/g:b34f373635635fa331d2803d9232b3cfd4fd4fd1
commit r14-3719-gb34f373635635fa331d2803d9232b3cfd4fd4fd1
Author: Andrew Pinski
Date: S
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105832
Andrew Pinski changed:
What|Removed |Added
URL||https://gcc.gnu.org/piperma
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105832
--- Comment #16 from Andrew Pinski ---
Created attachment 55833
--> https://gcc.gnu.org/bugzilla/attachment.cgi?id=55833&action=edit
Patch which I am testing
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105832
--- Comment #15 from Andrew Pinski ---
So there is a pattern for:
/* Simplify ((C <> x) & D) != 0 where C and D are power of two constants,
either to false if D is smaller (unsigned comparison) than C, or to
x == log2 (D) - log2 (C). Simi
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105832
Andrew Pinski changed:
What|Removed |Added
Status|NEW |ASSIGNED
Assignee|unassigned
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105832
Richard Biener changed:
What|Removed |Added
Target Milestone|13.2|13.3
--- Comment #12 from Andrew Pinsk
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105832
--- Comment #11 from Jeffrey A. Law ---
Looks viable to me. Are you thinking match.pd?
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105832
--- Comment #10 from Andrew Pinski ---
I think the simple way of fixing this is optimizing:
```
bool f(int g)
{
return (1 >> g) != 0;
}
```
into
```
bool f0(int g)
{
return g == 0;
}
```
In threadfull1 (before vrp1) we have:
```
[local count
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=105832
Richard Biener changed:
What|Removed |Added
Target Milestone|13.0|13.2
--- Comment #9 from Richard Biene
10 matches
Mail list logo
