| lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC | |
|
Open Source and information security mailing list archives
| ||
|
Message-ID: <Z9GtcNJie8TRKywZ@thinkpad>
Date: Wed, 12 Mar 2025 11:51:12 -0400
From: Yury Norov <yury.norov@...il.com>
To: "H. Peter Anvin" <hpa@...or.com>
Cc: Kuan-Wei Chiu <visitorckw@...il.com>,
David Laight <david.laight.linux@...il.com>,
Andrew Cooper <andrew.cooper3@...rix.com>,
Laurent.pinchart@...asonboard.com, airlied@...il.com,
akpm@...ux-foundation.org, alistair@...ple.id.au,
andrew+netdev@...n.ch, andrzej.hajda@...el.com,
arend.vanspriel@...adcom.com, awalls@...metrocast.net, bp@...en8.de,
bpf@...r.kernel.org, brcm80211-dev-list.pdl@...adcom.com,
brcm80211@...ts.linux.dev, dave.hansen@...ux.intel.com,
davem@...emloft.net, dmitry.torokhov@...il.com,
dri-devel@...ts.freedesktop.org, eajames@...ux.ibm.com,
edumazet@...gle.com, eleanor15x@...il.com,
gregkh@...uxfoundation.org, hverkuil@...all.nl,
jernej.skrabec@...il.com, jirislaby@...nel.org, jk@...abs.org,
joel@....id.au, johannes@...solutions.net, jonas@...boo.se,
jserv@...s.ncku.edu.tw, kuba@...nel.org, linux-fsi@...ts.ozlabs.org,
linux-input@...r.kernel.org, linux-kernel@...r.kernel.org,
linux-media@...r.kernel.org, linux-mtd@...ts.infradead.org,
linux-serial@...r.kernel.org, linux-wireless@...r.kernel.org,
linux@...musvillemoes.dk, louis.peens@...igine.com,
maarten.lankhorst@...ux.intel.com, mchehab@...nel.org,
mingo@...hat.com, miquel.raynal@...tlin.com, mripard@...nel.org,
neil.armstrong@...aro.org, netdev@...r.kernel.org,
oss-drivers@...igine.com, pabeni@...hat.com,
parthiban.veerasooran@...rochip.com, rfoss@...nel.org,
richard@....at, simona@...ll.ch, tglx@...utronix.de,
tzimmermann@...e.de, vigneshr@...com, x86@...nel.org
Subject: Re: [PATCH v3 00/16] Introduce and use generic parity16/32/64 helper
On Tue, Mar 11, 2025 at 03:24:14PM -0700, H. Peter Anvin wrote:
> On March 11, 2025 3:01:30 PM PDT, Yury Norov <yury.norov@...il.com> wrote:
> >On Sun, Mar 09, 2025 at 11:48:26PM +0800, Kuan-Wei Chiu wrote:
> >> On Fri, Mar 07, 2025 at 12:07:02PM -0800, H. Peter Anvin wrote:
> >> > On March 7, 2025 11:53:10 AM PST, David Laight <david.laight.linux@...il.com> wrote:
> >> > >On Fri, 07 Mar 2025 11:30:35 -0800
> >> > >"H. Peter Anvin" <hpa@...or.com> wrote:
> >> > >
> >> > >> On March 7, 2025 10:49:56 AM PST, Andrew Cooper <andrew.cooper3@...rix.com> wrote:
> >> > >> >> (int)true most definitely is guaranteed to be 1.
> >> > >> >
> >> > >> >That's not technically correct any more.
> >> > >> >
> >> > >> >GCC has introduced hardened bools that intentionally have bit patterns
> >> > >> >other than 0 and 1.
> >> > >> >
> >> > >> >https://gcc.gnu.org/gcc-14/changes.html
> >> > >> >
> >> > >> >~Andrew
> >> > >>
> >> > >> Bit patterns in memory maybe (not that I can see the Linux kernel using them) but
> >> > >> for compiler-generated conversations that's still a given, or the manager isn't C
> >> > >> or anything even remotely like it.
> >> > >>
> >> > >
> >> > >The whole idea of 'bool' is pretty much broken by design.
> >> > >The underlying problem is that values other than 'true' and 'false' can
> >> > >always get into 'bool' variables.
> >> > >
> >> > >Once that has happened it is all fubar.
> >> > >
> >> > >Trying to sanitise a value with (say):
> >> > >int f(bool v)
> >> > >{
> >> > > return (int)v & 1;
> >> > >}
> >> > >just doesn't work (see https://www.godbolt.org/z/MEndP3q9j)
> >> > >
> >> > >I really don't see how using (say) 0xaa and 0x55 helps.
> >> > >What happens if the value is wrong? a trap or exception?, good luck recovering
> >> > >from that.
> >> > >
> >> > > David
> >> >
> >> > Did you just discover GIGO?
> >>
> >> Thanks for all the suggestions.
> >>
> >> I don't have a strong opinion on the naming or return type. I'm still a
> >> bit confused about whether I can assume that casting bool to int always
> >> results in 0 or 1.
> >>
> >> If that's the case, since most people prefer bool over int as the
> >> return type and some are against introducing u1, my current plan is to
> >> use the following in the next version:
> >>
> >> bool parity_odd(u64 val);
> >>
> >> This keeps the bool return type, renames the function for better
> >> clarity, and avoids extra maintenance burden by having just one
> >> function.
> >>
> >> If I can't assume that casting bool to int always results in 0 or 1,
> >> would it be acceptable to keep the return type as int?
> >>
> >> Would this work for everyone?
> >
> >Alright, it's clearly a split opinion. So what I would do myself in
> >such case is to look at existing code and see what people who really
> >need parity invent in their drivers:
> >
> > bool parity_odd
> >static inline int parity8(u8 val) - -
> >static u8 calc_parity(u8 val) - -
> >static int odd_parity(u8 c) - +
> >static int saa711x_odd_parity - +
> >static int max3100_do_parity - -
> >static inline int parity(unsigned x) - -
> >static int bit_parity(u32 pkt) - -
> >static int oa_tc6_get_parity(u32 p) - -
> >static u32 parity32(__le32 data) - -
> >static u32 parity(u32 sample) - -
> >static int get_parity(int number, - -
> > int size)
> >static bool i2cr_check_parity32(u32 v, + -
> > bool parity)
> >static bool i2cr_check_parity64(u64 v) + -
> >static int sw_parity(__u64 t) - -
> >static bool parity(u64 value) + -
> >
> >Now you can refer to that table say that int parity(uXX) is what
> >people want to see in their drivers.
> >
> >Whichever interface you choose, please discuss it's pros and cons.
> >What bloat-o-meter says for each option? What's maintenance burden?
> >Perf test? Look at generated code?
> >
> >I personally for a macro returning boolean, something like I
> >proposed at the very beginning.
> >
> >Thanks,
> >Yury
>
> Also, please at least provide a way for an arch to opt in to using the builtins, which seem to produce as good results or better at least on some architectures like x86 and probably with CPU options that imply fast popcnt is available.
Yeah. And because linux/bitops.h already includes asm/bitops.h
the simplest way would be wrapping generic implementation with
the #ifndef parity, similarly to how we handle find_next_bit case.
So:
1. Kuan-Wei, please don't invent something like ARCH_HAS_PARITY;
2. This may, and probably should, be a separate follow-up series,
likely created by corresponding arch experts.
Thanks,
Yury
Powered by blists - more mailing lists