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: Robert Dewar <dewar at gnat dot com>
- To: law at redhat dot com
- Cc: Jan Hubicka <hubicka at ucw dot cz>,Richard Kenner <kenner at vlsi1 dot ultra dot nyu dot edu>, gcc at gcc dot gnu dot org
- Date: Mon, 19 Jan 2004 12:30:18 -0500
- Subject: Re: [RFC] Contributing tree-ssa to mainline
- References: <200401191545.i0JFjgAj015618@speedy.slc.redhat.com>
>However Ada is not the only language having checks. In some extend,
>Java has the array bounds too. If the value range propagation pass were
>available, Java would take benefit of it too.
And C/C++ when instrumented to detect invalid memory operations.
jeff
Certainly Ada would benefit from such a pass. Right now, the front end
of Ada does a lot of work on computing value ranges, but it does a poor
job of propagation, since we have not put any kind of non-trivial flow
graph propagation into the front end.