https://gcc.gnu.org/bugzilla/show_bug.cgi?id=103254
--- Comment #6 from CVS Commits <cvs-commit at gcc dot gnu.org> --- The master branch has been updated by Aldy Hernandez <al...@gcc.gnu.org>: https://gcc.gnu.org/g:8acbd7bef6edbf537e3037174907029b530212f6 commit r12-5514-g8acbd7bef6edbf537e3037174907029b530212f6 Author: Aldy Hernandez <al...@redhat.com> Date: Wed Nov 24 09:43:36 2021 +0100 path solver: Compute ranges in path in gimple order. Andrew's patch for this PR103254 papered over some underlying performance issues in the path solver that I'd like to address. We are currently solving the SSA's defined in the current block in bitmap order, which amounts to random order for all purposes. This is causing unnecessary recursion in gori. This patch changes the order to gimple order, thus solving dependencies before uses. There is no change in threadable paths with this change. Tested on x86-64 & ppc64le Linux. gcc/ChangeLog: PR tree-optimization/103254 * gimple-range-path.cc (path_range_query::compute_ranges_defined): New (path_range_query::compute_ranges_in_block): Move to compute_ranges_defined. * gimple-range-path.h (compute_ranges_defined): New.
