Hi,
I was running down a problem with network objects producing a segv on
my linux box and finally discovered that the recursive pickler would
overflow the stack on a linked list of 25 or so items
which was documented in the pickle source. On trying to reproduce the
problem I discovered that it only occurs in a thread (using the
threadposix model) which is not the main. The main thread will
allocate as much stack as you like until you run out of virtual memory.
I was wondering what options there are to give better diagnostics of
stack overflow than simple segv's in an m3 program. Presumably the
pthread model will duplicate the main thread model in allocation of
more stack until vm exhaustion. At that point it would be nice to know
it was a stack problem and hence a probably recursive programming fault
than tracing through the nightmare of possible library bugs.
Regards
Peter
