|
|
|
|
|
|
by fpoling
466 days ago
|
|
|
Depth is easy to miss when the parser calls a lot of functions that call each other and that have vastly different stack usage. A more reliable check is to compare an address of a thing on the stack at api boundary with the current address of things on the stack. SpiderMonkey, the JS engine in Firefox, used something like that in past to stop run-away recursion or at least to switch to slower algorithms with bounded stack usage. |
|
|