This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: needless deep recursion in gt-c-decl.h
- From: Geoff Keating <geoffk at geoffk dot org>
- To: dje at watson dot ibm dot com
- Cc: per at bothner dot com, gcc at gcc dot gnu dot org
- Date: Mon, 5 Aug 2002 12:08:20 -0700
- Subject: Re: needless deep recursion in gt-c-decl.h
- References: <200208051839.OAA31486@makai.watson.ibm.com>
- Reply-to: Geoff Keating <geoffk at redhat dot com>
> X-Sieve: cmu-sieve 2.0
> cc: Geoff Keating <geoffk@redhat.com>, gcc@gcc.gnu.org
> Date: Mon, 05 Aug 2002 14:39:14 -0400
> From: David Edelsohn <dje@watson.ibm.com>
>
> >>>>> Per Bothner writes:
>
> Per> I'm point point is I'm not sure a two-loop algorithm is needed.
> Per> I got the impression is that the one-loop argorithm doesn't work
> Per> for trees because of references from trees to rtl, like DECL_RTL.
> Per> I don't understand how rtl to the same extent, but I also think
> Per> a single loop should be enough to avoid deep recursion.
>
> Per> I'm just concerned about slowing down gcc bit by bit.
>
> Does GCC always do the marking or only when PCH will be enabled?
The marking is for GC, so it's always on.
--
- Geoffrey Keating <geoffk@geoffk.org> <geoffk@redhat.com>