This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: [RFC] Contributing tree-ssa to mainline
- From: kenner at vlsi1 dot ultra dot nyu dot edu (Richard Kenner)
- To: dnovillo at redhat dot com
- Cc: gcc at gcc dot gnu dot org
- Date: Mon, 19 Jan 04 13:08:31 EST
- Subject: Re: [RFC] Contributing tree-ssa to mainline
Instead of emitting runtime calls, would it be possible to emit tree
codes with well defined semantics? On finding them, the optimizers
would know that it's not just an arbitrary function call for instance
(perhaps adding attributes to the libcall).
But I'm oversimplifying. We would have to talk about specific cases.
You are oversimplifying. There is a *huge* amount of code generated
that has subtle dependencies on these things.
Just as one example, the representation and generated code for packed
array of Boolean is completely different if the array bounds are constant
and small (say 1..32) vs. if they are variable.
There's no practical way to represent all the different possibilities
and expect language-independent code to choose one based on constant
propagation: it has to be done in the front end or not at all.