Skip to main content
Unix & Linux

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

4
  • 1
    Hmmm detecting accidental recursion seems like a reasonable advantage at least, thanks! Commented Oct 13, 2021 at 12:53
  • Edge-case I ran into: When working with Intel Fortran, automatic arrays (i.e. arrays declared with the size parameter being a runtime variable) and temporary arrays (e.g. the result of the expression matmul(A, B)) are stored on the stack, which a colleague benchmarked to have relevant impact on overall performance. Sadly, the implementation does this for arrays of any size, such that we ran into situations where matmul(A,B) was crashing the software under the default 16 MB stack size limit. Point being: Small default, combined with corporate ITs making it hard to change, can be an issue. Commented May 18, 2023 at 6:55
  • 2
    Infinite recursion would always be eventually detected regardless of stack size, it's not like if you set the stack limit beyond a certain amount then you won't be able to detect infinite recursion. Commented Feb 3, 2024 at 15:33
  • If you don't have a hard limit to stack size, you only detect it by accident due to overwriting the heap or something else and causing some other misbehavior. Commented Feb 4, 2024 at 2:00