15.12.2014, 14:02
Hi, i would like to ask you guys what is the source of this compiling output:
I understand that recursion is caused by infinate loops which never ends therefore its unknown, but the thing i dont understand is how i find those loops and how i solve this output to show me some good results.
By the way, Im having lags in the server, I would like someone to tell me if this comiling tells anything about large strings, so i would know where start to reduce them.
pawn Код:
Pawn compiler 3.2.3664 Copyright (c) 1997-2006, ITB CompuPhase
Header size: 33964 bytes
Code size: 5455468 bytes
Data size: 38417372 bytes
Stack/heap size: 16384 bytes; estimated max. usage: unknown, due to recursion
Total requirements: 43923188 bytes
By the way, Im having lags in the server, I would like someone to tell me if this comiling tells anything about large strings, so i would know where start to reduce them.