Framestack - how to prevent to run into it?

[Benjamin]

Hi,

any tips to prevent from running into a FRAMESTACK error?

Benjamin

[Ben Irwin]

Benjamin,

Is it a Framestack Overflow error.

[DAiMor]

Write good code. :)

You could use some utils for analize performance like ^PERFMON, ^%SYS.MONLBL.

And if you have already known where you catch a FRAMESTACK error, you could put debug code with analyze $STACK variable, and if your code get for example more than 50 steps, you must get stack trace like me 

s $ze="testframestack",t=$$LOG^%ETN(),$ze=""

And after that, you can see this stack in SMP System > System Logs > View Application Error Log

вторник, 21 января 2014 г., 23:46:14 UTC+4 пользователь Benjamin написал:

[Ben Irwin]

The number 1 reason for a FRAMESTACK OVERFLOW error is a misplaced "NEW" command in a loop.

[Michae...@kp.org]

Interesting difference:

%SYS>f  n

F  N
   ^
<MAXSCOPE>
%SYS>f  n x

F  N x
   ^
<FRAMESTACK>
%SYS>

Why, I wonder?

[David Whitten]

The <MAXSCOPE> error is talking about exceeding the maximum number of NEW-stack levels (each of which doesn't actually have any variables in it, since you said you wanted to hide all variables by not putting a name after the NEW command).

The <FRAMESTACK> error is talking about running out of space in the NEW -STACK levels (each of which hides only one variable - the one named lower-case-x )

David

--
--
Caché, Ensemble, DeepSee
 
---
You received this message because you are subscribed to the Google Groups "Caché, Ensemble, DeepSee" group.
To unsubscribe from this group and stop receiving emails from it, send an email to intersystems-publi...@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.

[Anil Agarwal]

You can also get framestack error if you are calling A() from B() and then again B() from A().

--
--
Thanks & Regards

[David Whitten]

I don't think you automatically get a <FRAMESTACK> when you have two mutually recursive routines. I think it only happens if the mutual recursion (or just plain recursion i.e. where A() calls A() ) uses up all the available storage for a stack.

David
713-870-3834