linux-kernel - Re: [PATCH 10/12] unwind: Simplify unwind_user_next

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

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Message-ID: <20251022112032.130218cd@gandalf.local.home>
Date: Wed, 22 Oct 2025 11:20:32 -0400
From: Steven Rostedt <rostedt@...dmis.org>
To: Peter Zijlstra <peterz@...radead.org>
Cc: jpoimboe@...nel.org, rostedt@...nel.org, linux-kernel@...r.kernel.org
Subject: Re: [PATCH 10/12] unwind: Simplify unwind_user_next_fp() alignment
 check

On Mon, 20 Oct 2025 12:28:14 +0200
Peter Zijlstra <peterz@...radead.org> wrote:

> On Wed, Oct 01, 2025 at 11:55:24AM -0400, Steven Rostedt wrote:
> > On Wed, 24 Sep 2025 09:59:58 +0200
> > Peter Zijlstra <peterz@...radead.org> wrote:
> > 
> > I would add a change log. Something like:
> > 
> >   sizeof(long) is 4 or 8. Where 4 = 1 << 2 and 8 = 1 << 3.
> >   Calculating shift to be 2 or 3 and then passing that variable into
> >   (1 << shift) is the same as just using sizeof(long).  
> 
> I've made it: "2^log_2(n) == n". I find it very hard to spend that many
> words on something this trivial :-)

What you don't like Common Core Math[1]?

-- Steve

[1] https://3010tangents.wordpress.com/2015/03/03/common-core/