On 17 October 2014 18:48, Yoann Padioleau <p...@fb.com> wrote: > Somehow? > > Would be nice to have a comment explaining this “somehow" then > because it looks tricky. >
it's building a tree for (0:int-(0:int-x)) which later transformations will simplify to x, but having done "the usual arithmetic conversions" balancing and promoting 0s and x as required, if it's char/int/long/vlong.
