On Thu, 28 Apr 2022, Andre Vieira (lists) wrote:
>
> On 27/04/2022 15:03, Richard Biener wrote:
> > On Wed, 27 Apr 2022, Richard Biener wrote:
> >
> >> The following makes sure to take into account prologue peeling
> >> when trying to narrow down the maximum number of iterations
> >> computed
On 27/04/2022 15:03, Richard Biener wrote:
On Wed, 27 Apr 2022, Richard Biener wrote:
The following makes sure to take into account prologue peeling
when trying to narrow down the maximum number of iterations
computed for the epilogue of a vectorized epilogue.
Bootstrap & regtest running on
for trunk?
Thanks,
Richard.
>From 03f437c9b2d5260888535e0dad570daee694e4b3 Mon Sep 17 00:00:00 2001
From: Richard Biener
Date: Wed, 27 Apr 2022 14:06:12 +0200
Subject: [PATCH] tree-optimization/105219 - bogus max iters for vectorized
epilogue
To: gcc-patches@gcc.gnu.org
The following makes sure to take into account p
The following makes sure to take into account prologue peeling
when trying to narrow down the maximum number of iterations
computed for the epilogue of a vectorized epilogue.
Bootstrap & regtest running on x86_64-unknown-linux-gnu.
I did not verify this solves the original aarch64 testcase yet
