[Bug tree-optimization/70547] Optimize multiplication of booleans to bit_and

2022-11-25 Thread pinskia at gcc dot gnu.org via Gcc-bugs
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70547 Andrew Pinski changed: What|Removed |Added Resolution|--- |FIXED Status|ASSIGNED

[Bug tree-optimization/70547] Optimize multiplication of booleans to bit_and

2022-11-25 Thread pinskia at gcc dot gnu.org via Gcc-bugs
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70547 Andrew Pinski changed: What|Removed |Added Target Milestone|--- |10.0 --- Comment #8 from Andrew Pinski

[Bug tree-optimization/70547] Optimize multiplication of booleans to bit_and

2021-07-06 Thread pinskia at gcc dot gnu.org via Gcc-bugs
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70547 Andrew Pinski changed: What|Removed |Added Status|NEW |ASSIGNED Assignee|unassigned a

[Bug tree-optimization/70547] Optimize multiplication of booleans to bit_and

2020-11-06 Thread gabravier at gmail dot com via Gcc-bugs
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70547 Gabriel Ravier changed: What|Removed |Added CC||gabravier at gmail dot com --- Comment

[Bug tree-optimization/70547] Optimize multiplication of booleans to bit_and

2018-11-09 Thread pinskia at gcc dot gnu.org
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70547 --- Comment #5 from Andrew Pinski --- (In reply to Andrew Pinski from comment #4) > /* (m1 CMP m2) * d -> (m1 CMP m2) ? d : 0 */ > (for cmp (gt lt ge le) > (simplify > (mult (convert (cmp @0 @1)) @2) > (cond (cmp @0 @1) @2 { build_zero_cst (t

[Bug tree-optimization/70547] Optimize multiplication of booleans to bit_and

2018-11-09 Thread pinskia at gcc dot gnu.org
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70547 --- Comment #4 from Andrew Pinski --- /* (m1 CMP m2) * d -> (m1 CMP m2) ? d : 0 */ (for cmp (gt lt ge le) (simplify (mult (convert (cmp @0 @1)) @2) (cond (cmp @0 @1) @2 { build_zero_cst (type); }))) Should have caught that ... NOTE I think

[Bug tree-optimization/70547] Optimize multiplication of booleans to bit_and

2016-04-05 Thread glisse at gcc dot gnu.org
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70547 --- Comment #3 from Marc Glisse --- In this case, the code was deliberately written this way, presumably to avoid the branching in &&. Using & would be better (and that's what I am suggesting we optimize it to), but * doesn't seem nonsensical to

[Bug tree-optimization/70547] Optimize multiplication of booleans to bit_and

2016-04-05 Thread manu at gcc dot gnu.org
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70547 Manuel López-Ibáñez changed: What|Removed |Added CC||manu at gcc dot gnu.org --- Commen

[Bug tree-optimization/70547] Optimize multiplication of booleans to bit_and

2016-04-05 Thread rguenth at gcc dot gnu.org
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70547 Richard Biener changed: What|Removed |Added Status|UNCONFIRMED |NEW Last reconfirmed|