aboutsummaryrefslogtreecommitdiffstats
path: root/arch/x86/include/asm/io_bitmap.h
diff options
context:
space:
mode:
authorThomas Gleixner <tglx@linutronix.de>2019-11-11 23:03:22 +0100
committerThomas Gleixner <tglx@linutronix.de>2019-11-16 11:24:02 +0100
commit060aa16fdb7c5078a4159a76e5dc87d6a493af9b (patch)
tree63f2ffbc60ce9e1064ca13bc128efeb7c1e7f6c8 /arch/x86/include/asm/io_bitmap.h
parentx86/ioperm: Move iobitmap data into a struct (diff)
downloadlinux-dev-060aa16fdb7c5078a4159a76e5dc87d6a493af9b.tar.xz
linux-dev-060aa16fdb7c5078a4159a76e5dc87d6a493af9b.zip
x86/ioperm: Add bitmap sequence number
Add a globally unique sequence number which is incremented when ioperm() is changing the I/O bitmap of a task. Store the new sequence number in the io_bitmap structure and compare it with the sequence number of the I/O bitmap which was last loaded on a CPU. Only update the bitmap if the sequence is different. That should further reduce the overhead of I/O bitmap scheduling when there are only a few I/O bitmap users on the system. The 64bit sequence counter is sufficient. A wraparound of the sequence counter assuming an ioperm() call every nanosecond would require about 584 years of uptime. Suggested-by: Linus Torvalds <torvalds@linux-foundation.org> Signed-off-by: Thomas Gleixner <tglx@linutronix.de>
Diffstat (limited to 'arch/x86/include/asm/io_bitmap.h')
-rw-r--r--arch/x86/include/asm/io_bitmap.h1
1 files changed, 1 insertions, 0 deletions
diff --git a/arch/x86/include/asm/io_bitmap.h b/arch/x86/include/asm/io_bitmap.h
index 1a12b9ff5e4e..d63bd5afe671 100644
--- a/arch/x86/include/asm/io_bitmap.h
+++ b/arch/x86/include/asm/io_bitmap.h
@@ -5,6 +5,7 @@
#include <asm/processor.h>
struct io_bitmap {
+ u64 sequence;
/* The maximum number of bytes to copy so all zero bits are covered */
unsigned int max;
unsigned long bitmap[IO_BITMAP_LONGS];