Re: PATCH to dbxout_typedefs

[Mike Stump <mrs at apple dot com>]

On Friday, September 12, 2003, at 03:00  PM, Per Bothner wrote:
> The recursion to emit the typedefs in reverse order is
> both inefficient and seemingly wrong.

I also hit this as I was trying to debug in emacs started by my GUI 
environment, and the stack only managed to have 4MB of space.  If it 
were started from my shell, it would have had 64 MB of stack space.  I 
was trying to debug non-trivial code.  It is something like 94 or 96 
bytes per item.  A temporary work array would be 24x smaller, and we 
could leave the order alone, though, welcome to fault city.  Another 
approach might be to have a tail pointer, and insert new elements at 
the end using the tail pointer.  Though, the problem with that is all 
consumers of that information would have to change to allow for the 
different ordering...  :-(

In my local tree, I'm just using iteration with the possibly `wrong' 
order.