Re: [PATCH] Improve VR computation for [x, y] & z or [x, y] | z (PR tree-optimization/80558)

2017-05-05 Thread Jakub Jelinek
On Fri, May 05, 2017 at 01:59:17PM +0200, Richard Biener wrote: > On Thu, 4 May 2017, Jakub Jelinek wrote: > > > Hi! > > > > This patch improves value range computation of BIT_{AND,IOR}_EXPR > > with one singleton range and one range_int_cst_p, where the singleton > > range has n clear least

Re: [PATCH] Improve VR computation for [x, y] & z or [x, y] | z (PR tree-optimization/80558)

2017-05-05 Thread Richard Biener
On Thu, 4 May 2017, Jakub Jelinek wrote: > Hi! > > This patch improves value range computation of BIT_{AND,IOR}_EXPR > with one singleton range and one range_int_cst_p, where the singleton > range has n clear least significant bits, then m set bits and either > that is all it has (i.e. negation

[PATCH] Improve VR computation for [x, y] & z or [x, y] | z (PR tree-optimization/80558)

2017-05-04 Thread Jakub Jelinek
Hi! This patch improves value range computation of BIT_{AND,IOR}_EXPR with one singleton range and one range_int_cst_p, where the singleton range has n clear least significant bits, then m set bits and either that is all it has (i.e. negation of a power of 2), or the bits above those two sets of