bug-gnu-music
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: segfault in grob.cc


From: Han-Wen Nienhuys
Subject: Re: segfault in grob.cc
Date: Sun, 3 Jun 2001 18:27:25 +0200

address@hidden writes:
> After digging around, it seems that os.system in the python library calls
> system(3) (no big surprise there) which in turns calls /bin/sh to execute
> the command.  On linux, /bin/sh is actually bash. 
> 
> I appended 'ulimit -a' to the os.system command so I could see what my
> resources were.  It turns out that the stack size is <2K, which is an odd
> number (I don't know where it comes from)  because from the shell it
> reports 8K.  If I also append  'ulimit -s unlimited', then ly2dvi
> *works* all the way through.   It also seems to work with 8192 instead
> of unlimited.  

ok. So we should get rid of system, and call lilypond using exec()
directly. FWIW, I usually run LilyPond with 1 meg of stack space.

> "paper output to ...".  Would there be something that causes
> exponential growth in memory size (stack or otherwise) as a function
> of input complexity?

no, as Jan said Lily is linear. You can get more  details on mem usage
if you run lilypond with -V.

> What is a broken smob, anyway?  Is it possible that my score has some
> diabolical feature that makes a bunch of those?

Lily constructs  the score as one very long line (or system). After
line breaking, this long line is broken into the lines which are
printed, and spanners (slurs, ties, etc.) are broken along. This
linebreaking requires that lots of pointers have to be remapped, which
is what handle_broken_smobs () does.

This reminds me to change the name. It should be
handle_broken_grobs().

> What is the largest score that has been processed with lilypond so
> far?  Mine is 830 measures of a score with 12 parts.  Not quite a
> Mahler symphony, but pretty big.  My score also has a lot more meter
> changes, tuplets, ties, and articulations than something like the
> Coriolan that result in a higher density of graphic objects.  Am I on
> the cutting edge of lilypond complexity, or are other users out there

Seems you are. I'd be interested in trying out the score.
Meter changes sounds like 20th century music, though. Is your score PD? 


--
Han-Wen Nienhuys   |   address@hidden    | http://www.cs.uu.nl/~hanwen/




reply via email to

[Prev in Thread] Current Thread [Next in Thread]