This is the mail archive of the
mailing list for the GCC project.
Re: needless deep recursion in gt-c-decl.h
- From: Per Bothner <per at bothner dot com>
- To: David Edelsohn <dje at watson dot ibm dot com>
- Cc: Geoff Keating <geoffk at redhat dot com>, gcc at gcc dot gnu dot org
- Date: Mon, 05 Aug 2002 12:03:30 -0700
- Subject: Re: needless deep recursion in gt-c-decl.h
- References: <200208051839.OAA31486@makai.watson.ibm.com>
David Edelsohn wrote:
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?
Always (unless I'm very confused) - this is the compile-time
garbage collection we're talking about. It was re-written in
conjunction with PCH, but it's still the same basic ggc, except
that the tree-marking and rtl-marking code is now auto-generated
from the header files.