[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <CALCETrWV=yFHaYAkSS-6XT3CPtas=rgWk5rwC7wPpNEky9xJLg@mail.gmail.com>
Date: Thu, 9 Mar 2017 18:42:57 -0800
From: Andy Lutomirski <luto@...capital.net>
To: Steven Rostedt <rostedt@...dmis.org>
Cc: "linux-kernel@...r.kernel.org" <linux-kernel@...r.kernel.org>,
Linus Torvalds <torvalds@...ux-foundation.org>,
Ingo Molnar <mingo@...nel.org>,
Thomas Gleixner <tglx@...utronix.de>,
"H. Peter Anvin" <hpa@...or.com>,
Andy Lutomirski <luto@...nel.org>,
Andrew Morton <akpm@...ux-foundation.org>
Subject: Re: [PATCH 1/2] x86/nmi: Optimize the check for being in the
repeat_nmi code
On Thu, Mar 9, 2017 at 2:42 PM, Steven Rostedt <rostedt@...dmis.org> wrote:
> From: "Steven Rostedt (Red Hat)" <rostedt@...dmis.org>
>
> Linus mentioned that doing two compares can be replaced by a single
> compare. That is, instead of:
>
> movq $repeat_nmi, %rdx
> cmpq 8(%rsp), %rdx
> ja not_in_region
> movq $end_repeat_nmi, %rdx
> cmpq 8(%rsp), %rdx
> ja in_region
>
> we can replace that with:
>
> movq 8(%rsp), %rdx
> subq $repeat_nmi, %rdx
> cmpq $end_repeat_nmi-repeat_nmi, %rdx
> jb in_region
Seems reasonable to me. Good luck ever noticing the speedup :)
--Andy
Powered by blists - more mailing lists