Re: [PATCH GCC][1/3]Simplify (A + CST cmp A -> CST cmp zero) for undefined overflow type

On Thu, Oct 19, 2017 at 4:22 PM, Marc Glisse wrote: > On Thu, 19 Oct 2017, Bin Cheng wrote: > >> * match.pd (A + CST cmp A -> CST cmp zero): New simplification >> for undefined overflow types in (A + CST CMP A -> A CMP' CST'). > > > Could you check if you

Re: [PATCH GCC][1/3]Simplify (A + CST cmp A -> CST cmp zero) for undefined overflow type

On Thu, 19 Oct 2017, Bin Cheng wrote: * match.pd (A + CST cmp A -> CST cmp zero): New simplification for undefined overflow types in (A + CST CMP A -> A CMP' CST'). Could you check if you still need that? I recently added something very similar (search for "X + Y < Y" in

[PATCH GCC][1/3]Simplify (A + CST cmp A -> CST cmp zero) for undefined overflow type

Hi, This is a rework of patch set at https://gcc.gnu.org/ml/gcc-patches/2017-06/msg01036.html and https://gcc.gnu.org/ml/gcc-patches/2017-06/msg01037.html. The patch set improves niters bound analysis for split loop. Instead of feeding bound computation to generic folder, this patch