[CM] tips for chasing down memory leaks?

[Iain Duncan]

Hi Schemers, I have (in s7) created a (brute-force) backtracking constraint
satisfaction solver for generating exercise melodies against a chord
progression. It makes a big old recursive tree on each solve as it also
tracks all the domain values possible at every node in order to take random
walks through the problem space rather than just accepting the first good
one. It's working well, except that I apparently have created a hell of a
memory leak... when running in my web assembly project I hit an out of
memory error after about 40 passes. Which is odd, because on each pass I
make a whole new solver and search tree, so I guess somehow I am preventing
the GC from cleaning up the previous ones.

I'm just hoping to get any tips/tricks for chasing this kind of thing down,
whether general lisp strategies or s7 specific tricks I could use!

BTW, Bill in my reading for this work (cope's "Computers and Musical Style"
I came across a related citation to a paper of yours from 1989!  So if you
have suggestions on good readings for this area of study, I'm all ears. :-)

thanks!
iain
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://cm-mail.stanford.edu/pipermail/cmdist/attachments/20260316/68e389e9/attachment.html>