SIMPLE: A language-independent tree IR

[Richard Henderson]

On Thu, Jan 03, 2002 at 12:24:08AM +0100, Toon Moene wrote:
> that under Diego's proposal, the back-end would be free to re-order this
> as
> 
>       tmp = A + B
>       Z = tmp + C

Yes, we must do something special to represent this.  Otherwise
we can't tell the difference between 

	Z = A + B + C + D
	Z = ((A + B) + C) + D

and, given a pipelined fpu, clearly you want the former rendered as

	t1 = A + B
	t2 = C + D
	Z = t1 + t2


r~