This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Re: [tree-ssa] Make PHI nodes reachable by GGC


> On Sat, Nov 29, 2003 at 01:11:14AM +0100, Jan Hubicka wrote:
> > We have no way to expose the fact that there are multiple linked lists
> > per node, so we probably need some extension to deal with this more
> > nicely.
> 
> When do we need this?
> 
> Iteration should begin with the bb->next list.  Now all blocks are
> marked (but not their subobjects).  Next, we begin marking subobjects
> of blocks, namely edges.  Choose the next link associated with the
> edge list that will be traversed first.  That is, if we mark bb->prev
> first, then make bb->prev_next the next link.
> 
> I would expect this to take care of the bulk of the problem.  Failing
> that, extend gengtype to handle multiple next links.  Shouldn't be hard.

You are probably right.  Given that GGC first marks and then traverls
other pointers it should not get to very large recursion depths.
It will walk all basic blocks after reaching first one and then
recursion over walking edges won't happen.
I will give the GGCeed CFG try next week.

Honza
> 
> 
> r~


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]