Way to find recursive functions?
#1

Hello.

I decided recently to change the MySQL plugin that I use, and it has led me to "normalize" the size of the strings that I use to store the SQL queries to something bigger. Then, when I compile, I came up with such a report:

Pawn compiler 3.2.3664 Copyright © 1997-2006, ITB CompuPhase

Header size: 20832 bytes
Code size: 1195248 bytes
Data size: 868904 bytes
Stack/heap size: 16384 bytes; estimated max. usage: unknown, due to recursion
Total requirements: 2101368 bytes

OK, it's not the first time that I see something like this, and it was to be expected since I'm using local arrays of 4k cells to store my queries, thus it needs a kinda big stack/heap size, and I will use a #pragma dynamic to go along with it.

But what I am more worried about, is this part: "estimated max. usage: unknown, due to recursion".
I get it that I do have recursive functions in my script, that prevent from estimating the maximum usage of the stack. My issue is... how the hell do I find what functions could lead to recursive scripts? I have like 20-50k lines of codes scattered in maybe 50 files, and looking for this just won't do.

Has anyone got some magic trick to do the tea, or at least to limit the recursivity level during the compilation?

Thanks.
Reply


Forum Jump:


Users browsing this thread: 1 Guest(s)