> Am 17.03.2022 um 18:35 schrieb Andrew MacLeod <amacl...@redhat.com>: > > As discussed in the PR, this patch adjusts rangers cache query to *always* > use dominators to lookup ranges in the cache. > > It use to give up if it encountered a block with outgoing edge ranges. This > patch changes that to continue looking back until a value is found, then > applies any outgoing ranges encountered along the way. > > This prevents us from filling the on-entry cache in blocks which don't really > affect the outcome, and causes significant memory reduction is large > functions at a nominal calculation cost. > > I have tweaked the debug output as well as a couple of other little things > from the original patch attached in the PR. Confirmed that the performance > results are similar, and generated reams of debug output to ensure there are > no issues there. > > Bootstraps on x86_64-pc-linux-gnu with no regressions. OK for trunk? Ok. Thanks, Richard > > Andrew > <943.patch>
Re: [PATCH] PR tree-optimization/102943 - Always use dominators in the cache when available.
Richard Biener via Gcc-patches Thu, 17 Mar 2022 13:36:40 -0700
- [PATCH] PR tree-optimization/102943 - Alway... Andrew MacLeod via Gcc-patches
- Re: [PATCH] PR tree-optimization/10294... Richard Biener via Gcc-patches