Re: segfault in grob.cc

[John Galbraith]

   John Galbraith <address@hidden> writes:

   Not exponential, `just' linear.  But with large scores, the effect can
   be bad.  You just need to get beyond the swapping point, and there's
   little hope for LilyPond to finish at all; execution time will
   skyrocket.

   Try to free as much memory as you can, eg, don't run mozilla, emacs,
   X, mysql, apache, X.

Yeah, watching "top" shows the cpu usage drop to 10% or so as soon as
lilypond soaks up about 90% of RAM.  OK, so I don't have any
particularly weird situation here.  I have 128M on the linux box
running lilypond.  I actually sit at a separate FreeBSD box running X
and emacs, so lilypond pretty much gets all the RAM that the linux
kernel will give it.  Time for a memory upgrade 8-)

   You're pretty much on the cutting edge, as far as I know.  Maybe not
   of complexity, but certainly with respect to size.  Do you use much
   property settings?  It may pay to only use \override and \revert,
   memory consumption wise.

I don't have a lot of property manipulation in there yet.  Now that I am
reaching the final stages of preparing this score, I might start tweaking
some stuff.

   We may have to work with you to investigate this deep stack issue
   further.

OK - Anything I can do to help the cause.  Lilypond has quite literaly saved
my life - I am sure that I would have jumped off a bridge by now if I had
to use Finale on a windoze system.

Also, thanks for all the fast responses.  I have been sluggish on my
responses because I don't get to hack on this score (or even read this
account) every day.

John

   -- 
   Jan Nieuwenhuizen <address@hidden> | GNU LilyPond - The music typesetter
   http://www.xs4all.nl/~jantien       | http://www.lilypond.org