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

--- Comment #10 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:97258480438db77e52f4b3947fa2c075b09d3fe1

commit r13-5617-g97258480438db77e52f4b3947fa2c075b09d3fe1
Author: Richard Biener <rguent...@suse.de>
Date:   Tue Jan 31 15:45:43 2023 +0100

    middle-end/108500 - replace recursive domtree DFS traversal

    The following replaces the recursive DFS traversal of the dominator
    tree in assign_dfs_numbers with a tree traversal using the fact
    that we have recorded parents.

    Bootstrapped and tested on x86_64-unknown-linux-gnu.

    This makes r13-5325 somewhat obsolete, though not computing the
    DFS numbers at all is beneficial in the cases where we perform
    immediate CFG manipulations.

    OK for trunk and later branch(es)?

    Thanks,
    Richard.

            PR middle-end/108500
            * dominance.cc (assign_dfs_numbers): Replace recursive DFS
            with tree traversal algorithm.

Reply via email to