summaryrefslogtreecommitdiff
path: root/scheme/guile/geiser
diff options
context:
space:
mode:
authorJose Antonio Ortega Ruiz <jao@gnu.org>2013-07-29 02:34:22 +0200
committerJose Antonio Ortega Ruiz <jao@gnu.org>2013-07-29 02:34:22 +0200
commit25a81dc10945622a0a52e54ea0b818aa1deae326 (patch)
tree3e72947ec257935aefe1a94de5afa8a0b886b0cf /scheme/guile/geiser
parent20a68166d0c05a18932bc784da5fe060fd3f32ae (diff)
downloadgeiser-chez-25a81dc10945622a0a52e54ea0b818aa1deae326.tar.gz
geiser-chez-25a81dc10945622a0a52e54ea0b818aa1deae326.tar.bz2
Avoiding a segfault due to out of bounds stack size
The parser in geiser-syntax is (tail, but elisp doesn't care) recursive, and we are setting max-lisp-eval-depth to some, ahem, heuristic value before starting a read. For long strings, such as that returned by the list of identifiers exported by the racket module, the heuristic was bad enough to produce a value making Emacs to blow away. This is just a palliative. The real solution is turn the recursion in geiser-syntax--read into an explicit iteration.
Diffstat (limited to 'scheme/guile/geiser')
0 files changed, 0 insertions, 0 deletions