Call Stack; Limit of the stack register

[Riesengross]

Greetings,

So I'm Building a list, Kind of like a database. My sequence reads data in, and then calls itself if another set of data is present. So it's a recursive sequence.

When no more data is present, the sequence doesn't call itself anymore but just runs through.

Everything works fine, until a critical number of sequences have been called. Then the call stack is simply overflowing.

So my first Question is: What's the Limit fo the call stack Register? Where can I find the Limit.

and my second Question is, is it possible to increase the number of stacks you can have in the call stack Register?

Regards, Matthias

P.S. I'm only interested in the call stack Register, please no alternative Solutions, only where's the Limit & is it possible to increase it

[~jiggawax~]

It's 499 in TestStand 2019 32-bit.  Verified by trial.  I don't know how to change it.  I would argue if you are going this deep you might want to rethink your architecture. 

BTW - don't run in a new thread

I also think it depends on a whole bunch of other variables.  Memory size, locals and parameters, steps, etc...