This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: committed: Ada updates
- From: kenner at vlsi1 dot ultra dot nyu dot edu (Richard Kenner)
- To: dnovillo at redhat dot com
- Cc: gcc-patches at gcc dot gnu dot org
- Date: Thu, 8 Apr 04 11:47:14 EDT
- Subject: Re: committed: Ada updates
The trick is to make sure that you remove all the semantics from the
input language so that the GIMPLE optimizers don't munge things up.
Since I don't know anything about Ada it is very difficult for me to
estimate. I'm just guessing.
That's certainly what's happening. Look at the code I pointed you to.
The tree nodes currently being used are defined in language-independent
terms. They are implemented by calling the standard expand_* routines.
Note that the majority of Ada semantics have already been removed by the
part of the front end written in Ada before even calling the C code at all.