[Bug tree-optimization/108500] [11/12/13 Regression] -O -finline-small-functions results in "internal compiler error: Segmentation fault" on a very large program (700k function calls)

[cvs-commit at gcc dot gnu.org via Gcc-bugs]

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=108500

--- Comment #8 from CVS Commits <cvs-commit at gcc dot gnu.org> ---
The master branch has been updated by Richard Biener <rgue...@gcc.gnu.org>:

https://gcc.gnu.org/g:f31fa9ea35ebcf221a2abaacba5511225f5d036e

commit r13-5325-gf31fa9ea35ebcf221a2abaacba5511225f5d036e
Author: Richard Biener <rguent...@suse.de>
Date:   Tue Jan 24 10:49:18 2023 +0100

    tree-optimization/108500 - avoid useless fast-query compute in CFG cleanup

    CFG cleanup computes dominators before the loop over blocks looking
    for merging opportunities.  That computes also the fast-query DFS
    numbers but that's a bit pointless since any CFG cleanup will invalidate
    them immediately (they are re-computed before fixing up loops).
    The following avoids this and fixes the SIGSEGV due to the deep
    recursion in assign_dfs_numbers after inlining very many small
    functions.

            PR tree-optimization/108500
            * dominance.h (calculate_dominance_info): Add parameter
            to indicate fast-query compute, defaulted to true.
            * dominance.cc (calculate_dominance_info): Honor
            fast-query compute parameter.
            * tree-cfgcleanup.cc (cleanup_tree_cfg_noloop): Do
            not compute the dominator fast-query DFS numbers.