aboutsummaryrefslogtreecommitdiff
path: root/libgcc
diff options
context:
space:
mode:
authorAldy Hernandez <aldyh@redhat.com>2021-11-24 09:43:36 +0100
committerAldy Hernandez <aldyh@redhat.com>2021-11-25 11:51:21 +0100
commit8acbd7bef6edbf537e3037174907029b530212f6 (patch)
treeaf3c72a02705b7ba336706efd779b67af58357ce /libgcc
parent94912212d3d1be0b1c490e9b5f45165ef5f30d8a (diff)
downloadgcc-8acbd7bef6edbf537e3037174907029b530212f6.zip
gcc-8acbd7bef6edbf537e3037174907029b530212f6.tar.gz
gcc-8acbd7bef6edbf537e3037174907029b530212f6.tar.bz2
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.
Diffstat (limited to 'libgcc')
0 files changed, 0 insertions, 0 deletions