Re: [PATCH v2 07/13] asm-generic: unaligned always use struct helpers
From: Linus Torvalds
Date: Tue May 18 2021 - 12:12:30 EST
On Tue, May 18, 2021 at 5:42 AM Arnd Bergmann <arnd@xxxxxxxxxx> wrote:
> To be on the safe side, we could pass -fno-tree-loop-vectorize along
> with -O3 on the affected gcc versions, or use a bigger hammer
> (not use -O3 at all, always set -fno-tree-loop-vectorize, ...).
I personally think -O3 in general is unsafe.
It has historically been horribly buggy. It's gotten better, but this
case clearly shows that "gotten better" really isn't that high of a
Very few projects use -O3, which is obviously part of why it's buggy.
But the other part of why it's buggy is that vectorization is simply
very complicated, and honestly, judging by the last report the gcc
people don't care about being careful. They literally are ok with
knowingly generating an off-by-one range check, because "it's
With that kind of mentality, I'm not personally all that inclined to
say "sure, use -O3". We know it has bugs even for the well-defined
> -O3 is set for the lz4 and zstd compression helpers and for wireguard.
I'm actually surprised wireguard would use -O3. Yes, performance is
important. But for wireguard, correctness is certainly important too.
Maybe Jason isn't aware of just how bad gcc -O3 has historically been?
And -O3 has often generated _slower_ code, in addition to the bugs.
It's not like it's a situation where "-O3 is obviously better than
-O2". There's a reason -O2 is the default.
And that tends to be even more true in the kernel than in many user
space programs (ie smaller loops, generally much higher I$ miss rates
Jason? How big of a deal is that -O3 for wireguard wrt the normal -O2?
There are known buggy gcc versions that aren't ancient.
Of the other cases, that xor-neon.c case actually makes sense. For
that file, it literally exists _only_ to get a vectorized version of
the trivial xor_8regs loop. It's one of the (very very few) cases of
vectorization we actually want. And in that case, we might even want
to make things easier - and more explicit - for the compiler by making
the xor_8regs loops use "restrict" pointers.
That neon case actually wants and needs that tree-vectorization to
DTRT. But maybe it doesn't need the actual _loop_ vectorization? The
xor_8regs code is literally using hand-unrolled loops already, exactly
to make it as simple as possible for the compiler (but the lack of
"restrict" pointers means that it's not all that simple after all, and
I assume the compiler generates conditionals for the NEON case?
lz4 is questionable - yes, upstream lh4 seems to use -O3 (good), but
it also very much uses unaligned accesses, which is where the gcc bug
hits. I doubt that it really needs or wants the loop vectorization.
zstd looks very similar to lz4.
End result: at a minimum, I'd suggest using
"-fno-tree-loop-vectorize", although somebody should check that NEON
And I still think that using O3 for anything halfway complicated
should be considered odd and need some strong numbers to enable.