Guilherme Blanco wrote:
Hm...
Actually at that time I was not able to reproduce the limit, and I
wrote a fix that worked well and reduced the number of nest calls.
Maybe the guy that notified me was using it. Here is the changeset I
did to fix the issue:
On Mon, 8 Sep 2008, Guilherme Blanco wrote:
Yeah... recursion depth.
Sorry, I wrongly typed it.
I think it may be cleaner now...
Well, PHP itself doesn't protect against this, but my guess is that you
have Xdebug running. Xdebug limits to 100 levels by default in order to
prevent
There is no nesting limit, it recurses until it runs out of memory.
Derick was saying that XDebug will add one, but other than that there
isn't any.
dev/php53/sapi/cli/php -r 'function m($m) { echo ++$m . ; m($m); }
m(0); '
I ran that and I got bored when it got to 750,000 levels deep.
Scott
Hm...
Actually at that time I was not able to reproduce the limit, and I
wrote a fix that worked well and reduced the number of nest calls.
Maybe the guy that notified me was using it. Here is the changeset I
did to fix the issue: http://trac.phpdoctrine.org/changeset/4397
But right now I'll
Derick,
I do not have xdebug installed here.
That's why I thought it was something that could be changed, since
it's something too specific and afaik used only by xdebug.
Regards,
On Tue, Sep 9, 2008 at 3:19 AM, Derick Rethans [EMAIL PROTECTED] wrote:
On Mon, 8 Sep 2008, Guilherme Blanco
Hi ML,
Short version: Increase the default max_input_nesting_level from 100
to something 150.
Extended version:
I am working on a Compiler written for PHP. Before you criticize me,
let me explain the entire situation.
I work for Doctrine project. Currently we're refactoring the DQL
(Doctrine
Hi!
Currently I'm working on the compiler, which has this BNF:
http://trac.doctrine-project.org/browser/trunk/query-language.txt
I've done a lot of optimizations to be able to not touch the default
nesting input level, but doing that I added a lot of restrictions that
now are my bottlenecks.
Each grammar rule may forward calls and subsequent things to build itself.
So, ConditionalExpression may forward a call and later call itself
again and again, etc.
At last, the number of nested function calls can easily reach 100.
If you need an example... I can spend some time on it to
Hi,
He means recursion depth, not input nesting depth. 5.3 had a proposed fast
function call algorithm which would avoid the stack limit and allow deeper
recursion, was this accepted and how does it affect the limit of 100 nested
calls?
Regards,
Stan Vassilev
Hi!
Currently I'm working
Yeah... recursion depth.
Sorry, I wrongly typed it.
I think it may be cleaner now...
On Mon, Sep 8, 2008 at 11:07 PM, Stan Vassilev | FM
[EMAIL PROTECTED] wrote:
Hi,
He means recursion depth, not input nesting depth. 5.3 had a proposed fast
function call algorithm which would avoid the
10 matches
Mail list logo
