On 11/25/2013 03:05 PM, Richard Sandiford wrote:
wi::eq_p (t1, t2) asserts that t1 and t2 are the same precision and ignores signedness; it just tests whether they are the same bitstring. wi::to_widest (t1) == wi::to_widest (t2) compares them as logical numbers, taking sign into account and allowing different types. I think that's what the original TREE_INT_CST_LOW and TREE_INT_CST_HIGH tests did too.
That seems reasonable, though I don't think allowing different types is actually a goal. In most cases the type is required to be the same by the context.
Jason
