This is the mail archive of the
java@gcc.gnu.org
mailing list for the Java project.
Re: gcj non-optimization curiosity
- From: Per Bothner <per at bothner dot com>
- To: Per Bothner <per at bothner dot com>
- Cc: tromey at redhat dot com, java at gcc dot gnu dot org
- Date: Sun, 16 Dec 2001 13:40:57 -0800
- Subject: Re: gcj non-optimization curiosity
- References: <87vgf628c4.fsf@creche.redhat.com> <3C1D1248.9040203@bothner.com>
One other point: These optimizations are perhaps best done at the
tree level, rather than the rtx level, because of the high-level
semantics involved. Tree-based optimization passes are fairly
new in ccc. I don't know if there is any general framework,
or if we would have to start from scratch.
A related point: When compiling from bytecodes, we generate trees
at the statement level, but not ta the function level. That should
be fixed, but is a non-trival task
--
--Per Bothner
per@bothner.com http://www.bothner.com/per/