This is the mail archive of the
java-patches@gcc.gnu.org
mailing list for the Java project.
Re: problem building a GCJ-friendly GNU Crypto
- From: Tom Tromey <tromey at redhat dot com>
- To: Roger Sayle <roger at eyesopen dot com>
- Cc: Mark Wielaard <mark at klomp dot org>, raif at fl dot net dot au, <java at gcc dot gnu dot org>, <java-patches at gcc dot gnu dot org>, <gcc-patches at gcc dot gnu dot org>
- Date: 20 Sep 2003 14:47:28 -0600
- Subject: Re: problem building a GCJ-friendly GNU Crypto
- References: <Pine.LNX.4.44.0309201313280.21018-100000@www.eyesopen.com>
- Reply-to: tromey at redhat dot com
>>>>> "Roger" == Roger Sayle <roger@eyesopen.com> writes:
Roger> I'm currently working on a patch to add an -fevaluation-order command
Roger> line option to GCC, that sets a flag_evaluation_order variable that
Roger> can be checked during constant folding to preserve left-to-right
Roger> evaluation order of binary expressions. This can then be enabled by
Roger> default by the java front-end, which should help make libbackend.a
Roger> more java friendly.
What about just encoding the required sequencing information in the
trees somehow? Actually, I thought we did that already.
Last time this came up we also discussed having new operators
reflecting whether or not a given operation was required to be
strictfp.
Anyway, if you're interested in this area, there is a lot of
documentation on what is required from a java compiler here, and there
are also a fair number of tests in jacks. ISTR that we fail a pretty
large fraction of the tests in this area, though it has been a while
since I looked into this.
Tom