Quote:
Stack/heap size: 9600 bytes; estimated max. usage: unknown, due to recursion
|
Are you calling a function from the same function? That's known as a "recursive function".
e.g. (C-biased pseudo-code)
Code:
int my_func(int n = 0) {
return n < 5 ? my_func(n + 1) : n;
}
Calling my_func will ultimately return '5', calling itself 5 times (called 6 times in total).
The call stack would look something like this:
my_func(0) > my_func(1) > my_func(2) > my_func(3) > my_func(4) > my_func(5)
And then unwind (returning '5' in each func to its callee):
(5)my_func > (5)my_func > (5)my_func > (5)my_func > (5)my_func > (5)my_func
The stacks purpose is simply to keep track of calls and saved variables over a long amount of time, ensuring that variables available before calling another function are still available afterwards. This is achieved by data generally being added to the stack with a last-in-first-out method.
It shouldn't be a problem. All Pawno seems to be saying is either that it can't predict whether your recursion will ever end or simply that you indeed use recursion. Recursion can be a problem, if the same function calls itself without any condition which would change before the stack gets full. You just need to make sure that all your recursive functions have a good "out" which will always eventually occur and it should run just fine.
