RFR: 8357781: Deep recursion in PhaseCFG::set_next_call leads to stack overflow [v2]

[Marc Chevalier]

> There is nothing very wrong here:
> - the graph is not broken
> - the algorithm is correct
> 
> It just happens that the graph is very deep, it has a very long, narrow chain of nodes because of crazy unrolling, because of `LoopUnrollLimit=8192`. This depth simply makes the algorithm recurse deeper than the stack size allows. This kind of graph shape is not quite trivial to reproduce. The proposed reproducer is very easy to change into a non-reproducer, with many kinds of change, even that seem harmless to me.
> 
> The fix is also pretty direct: let's change the recursive traversal, with a worklist-based iterative one. It's not as elegant, but it doesn't overflow.
> 
> How sad stacks are still so bounded...

Marc Chevalier has updated the pull request incrementally with one additional commit since the last revision:

  Address comments

-------------

Changes:
  - all: https://git.openjdk.org/jdk/pull/25448/files
  - new: https://git.openjdk.org/jdk/pull/25448/files/626529d5..bf04a1b7

Webrevs:
 - full: https://webrevs.openjdk.org/?repo=jdk&pr=25448&range=01
 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=25448&range=00-01

  Stats: 5 lines in 2 files changed: 0 ins; 1 del; 4 mod
  Patch: https://git.openjdk.org/jdk/pull/25448.diff
  Fetch: git fetch https://git.openjdk.org/jdk.git pull/25448/head:pull/25448

PR: https://git.openjdk.org/jdk/pull/25448