That seems like a very reasonable place.
Andrew
On 10/18/24 08:11, Richard Biener wrote:
On Fri, 18 Oct 2024, Richard Sandiford wrote:
At the moment, ranger punts entirely on POLY_INT_CSTs. Numerical
ranges are a bit difficult, unless we do start modelling bounds on
the indeterminates. But
On Fri, 18 Oct 2024, Richard Sandiford wrote:
> At the moment, ranger punts entirely on POLY_INT_CSTs. Numerical
> ranges are a bit difficult, unless we do start modelling bounds on
> the indeterminates. But we can at least track the nonzero bits.
OK unless Andrew knows a better proper place to
At the moment, ranger punts entirely on POLY_INT_CSTs. Numerical
ranges are a bit difficult, unless we do start modelling bounds on
the indeterminates. But we can at least track the nonzero bits.
gcc/
* value-query.cc (range_query::get_tree_range): Use get_nonzero_bits
to populat
