Hello,

> On 29 Dec 2019, at 23:31, Daniel Glöckner <[email protected]> wrote:
> 
> Adding recursion depth limitation into all cycles of this graph is a
> lot of work. 

It would also be counter-productive. Currently it takes a single ulimit command 
to compile a larger-than-usual program, but if tcc enforced its own limits 
there would be several settings to tweak.

I don't know any compiler that does not stack overflow on sufficiently large 
inputs. Tcc is only structured in a way that a dumb fuzzer can find an input 
that produces this behavior by just repeating the character *. This does not 
sound like a security issue, or even an issue.

Pascal
_______________________________________________
Tinycc-devel mailing list
[email protected]
https://lists.nongnu.org/mailman/listinfo/tinycc-devel

Reply via email to