Comment author: @lefessan

Unfortunately, your data structure is too deep for Marshal.from_string which triggers a stack overflow. Marshal.from_string is optimized for trees, i.e. depth in log(n), and simple lists. You should consider either changing the representation of your doubly linked list, or save it into an array first, save the array with Marshal.to_string, and then do the reverse when unmarshaling.

Fixing this would require implementing another marshal/unmarshal couple, more expensive in memory, but without recursion on the stack.

Comment author: eugenz

Still, the same issue arises when outputting into/inputting from a file.

Comment author: @lefessan

Of course, Marshal.from/to_string share the C code with input/output_value, so all of them should trigger the same problem. You should consider saving the doubly linked list in an array first, before outputting it.

Comment author: eugenz

OK, thank you.

Comment author: @xavierleroy

Feature wish: a non-recursive implementation of byterun/extern.c, perhaps following the same pattern as byterun/compare.c.

Comment author: pascal_cuoq

I am relatively sure that the implementation of unmarshal for OCaml 3.12 available in http://frama-c.com/download/frama-c-Nitrogen-20111001.tar.gz (files external/un*.ml*) and documented at http://blog.frama-c.com/public/unmarshal.pdf does not have this issue.

Comment author: @xavierleroy

The problem here is with marshaling. But, yes, the unmarshaler in byterun/intern.c is also recursive and vulnerable to stack overflows.

Comment author: meyer

This has been fixed now (the recursion has been unrolled in both marshaller and un-marshaller).

Please see SVN trunk revisions: 12390, 12250, 12248 and 12247, and also merged into 4.0.

Comment author: meyer

Merged from trunk to 4.0 as SVN revisions r12392 and r12394.