x86/nmi: Optimize address compares with better jump algorithm
Get series with b4
b4 am [email protected]Versions newest first
- v1 Latest2 patches 7 repliesIn review
Patches in v1 No applies recorded yet
| # | Subject and files | Size | Replies | Applied |
|---|---|---|---|---|
| 1/2 | x86/nmi: Optimize the check for being in the repeat_nmi codearch/ | +4 | 6 replies | |
| 2/2 | x86/nmi: Fix and optimize the NMI stack check codearch/ | +11 | 1 reply |
Reviews trailers per patch
None of the 2 patches has a Reviewed-by or Acked-by.
| Patch | Linus Torvalds |
|---|---|
| 1/2 | Inspired-by |
| 2/2 | Inspired-by |
Trailers given in replies are filled; those carried in the patches from earlier versions are outlined with dashes.
Cover letter [PATCH 0/2] x86/nmi: Optimize address compares with better jump algorithm
I started working on the x86-32 fentry code and I noticed that I had some old patches in my local tip/x86/core branch. Looking at them, they still seem relevant.
They are from 2014 when I was working at Red Hat. I kept the author having (Red Hat) and since I forward ported them now that I work for VMware, I used (VMware) in my Signed-off-by.
Both these patches are basically doing the same thing but to different parts. One is making a better test of the RIP the other is a better test of the RSP. Each patch describe what they are doing.
Steven Rostedt (Red Hat) (2):
x86/nmi: Optimize the check for being in the repeat_nmi code x86/nmi: Fix and optimize the NMI stack check code
----
arch/x86/entry/entry_64.S | 32 +++++++++++++++----------------- 1 file changed, 15 insertions(+), 17 deletions(-)