This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/70547] Optimize multiplication of booleans to bit_and
- From: "pinskia at gcc dot gnu.org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Sat, 10 Nov 2018 07:01:36 +0000
- Subject: [Bug tree-optimization/70547] Optimize multiplication of booleans to bit_and
- Auto-submitted: auto-generated
- References: <bug-70547-4@http.gcc.gnu.org/bugzilla/>
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70547
--- Comment #5 from Andrew Pinski <pinskia at gcc dot gnu.org> ---
(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 (type); })))
>
>
> Should have caught that ...
We do get:
_1 = c_5(D) < d_6(D);
_2 = (int) _1;
_7 = a_3(D) < b_4(D) ? _2 : 0;