otter outer loop),
allowing to do
hot_loop = next_hot_loop[loop->num];
if (!hot_loop || loop_depth (hot_loop) < loop_depth (outermost_loop))
return outermost_loop;
and do the linear search in the other uncommon case (eventually the cache
can be exploited to optimize that search as
still pending.
I'm thinking of requiring reliable_p () on the counts (but that will restrict
this to FDO).
Anyway, still on my list to look at - sorry for the delays.
Richard.
>
> [PATCH v7 2/2] Don't move cold code out of loop by checking bb count
>
> https://gcc.gnu.org/pipermai
Gentle ping and is this patch still suitable for stage 3? Thanks.
[PATCH v7 2/2] Don't move cold code out of loop by checking bb count
https://gcc.gnu.org/pipermail/gcc-patches/2021-November/583911.html
On 2021/11/10 11:08, Xionghu Luo via Gcc-patches wrote:
>
>
> On 2021/1
of '_not_
colder
than loop', and 'hotter_than_inner_loop' should be 'colder_than_inner_loop',
then it makes sense if the coldest loop is outside of outermost loop, continue
to
find a colder loop between outermost loop and current loop in
colder_than_inner_loop[loop->num]? Hope I understood you correctl
