This is the mail archive of the
mailing list for the GCC project.
Re: GCC Status Report (2004-03-09)
- From: Eric Botcazou <ebotcazou at libertysurf dot fr>
- To: Jakub Jelinek <jakub at redhat dot com>
- Cc: Mark Mitchell <mark at codesourcery dot com>,gcc at gcc dot gnu dot org,gcc-patches at gcc dot gnu dot org
- Date: Fri, 19 Mar 2004 14:13:10 +0100
- Subject: Re: GCC Status Report (2004-03-09)
- References: <200403091809.i29I9P04020607@sirius.codesourcery.com> <firstname.lastname@example.org> <20040318233552.GI31589@devserv.devel.redhat.com>
> Can't we at least detect the case where either the whole aggregate
> is const or all its fields are const? Then we don't need any blockage.
Guess what? The constness is not propagated to the RTL in the former case,
because of the pessimization recently introduced in maybe_set_unchanging:
We cannot do this for non-static aggregates, because of the double
writes that can be generated by store_constructor, depending on the
contents of the initializer. Yes, this does eliminate a good fraction
of the number of uses of RTX_UNCHANGING_P for a language like Ada.
It also eliminates a good quantity of bugs. Let this be incentive to
eliminate RTX_UNCHANGING_P entirely in favor of a more reliable
solution, perhaps based on alias sets. */
This means that const automatic aggregates would take a double pessimization
with the blockage scheme.