Re: [PATCH] match.pd: Optimize (x & y) == x into (x & ~y) == 0 [PR94589]

On Tue, 11 May 2021, Jakub Jelinek wrote: > On Thu, May 06, 2021 at 09:42:41PM +0200, Marc Glisse wrote: > > We can probably do it in 2 steps, first something like > > > > (for cmp (eq ne) > > (simplify > > (cmp (bit_and:c @0 @1) @0) > > (cmp (@0 (bit_not! @1)) { build_zero_cst (TREE_TYPE (@

Re: [PATCH] match.pd: Optimize (x & y) == x into (x & ~y) == 0 [PR94589]

On Tue, 11 May 2021, Jakub Jelinek via Gcc-patches wrote: On Thu, May 06, 2021 at 09:42:41PM +0200, Marc Glisse wrote: We can probably do it in 2 steps, first something like (for cmp (eq ne) (simplify (cmp (bit_and:c @0 @1) @0) (cmp (@0 (bit_not! @1)) { build_zero_cst (TREE_TYPE (@0)); })

[PATCH] match.pd: Optimize (x & y) == x into (x & ~y) == 0 [PR94589]

On Thu, May 06, 2021 at 09:42:41PM +0200, Marc Glisse wrote: > We can probably do it in 2 steps, first something like > > (for cmp (eq ne) > (simplify > (cmp (bit_and:c @0 @1) @0) > (cmp (@0 (bit_not! @1)) { build_zero_cst (TREE_TYPE (@0)); }))) > > to get rid of the double use, and then sim