diff options
author | Sasha Levin <levinsasha928@gmail.com> | 2011-07-27 17:00:48 +0400 |
---|---|---|
committer | Avi Kivity <avi@redhat.com> | 2011-09-25 20:17:59 +0400 |
commit | 743eeb0b01d2fbf4154bf87bff1ebb6fb18aeb7a (patch) | |
tree | 5392464930f7e77131d65f32ba96ce4665307629 /.gitignore | |
parent | 0d460ffc0956d2dbe12ca9f5f6aa0f8701ea9d73 (diff) | |
download | linux-743eeb0b01d2fbf4154bf87bff1ebb6fb18aeb7a.tar.xz |
KVM: Intelligent device lookup on I/O bus
Currently the method of dealing with an IO operation on a bus (PIO/MMIO)
is to call the read or write callback for each device registered
on the bus until we find a device which handles it.
Since the number of devices on a bus can be significant due to ioeventfds
and coalesced MMIO zones, this leads to a lot of overhead on each IO
operation.
Instead of registering devices, we now register ranges which points to
a device. Lookup is done using an efficient bsearch instead of a linear
search.
Performance test was conducted by comparing exit count per second with
200 ioeventfds created on one byte and the guest is trying to access a
different byte continuously (triggering usermode exits).
Before the patch the guest has achieved 259k exits per second, after the
patch the guest does 274k exits per second.
Cc: Avi Kivity <avi@redhat.com>
Cc: Marcelo Tosatti <mtosatti@redhat.com>
Signed-off-by: Sasha Levin <levinsasha928@gmail.com>
Signed-off-by: Avi Kivity <avi@redhat.com>
Diffstat (limited to '.gitignore')
0 files changed, 0 insertions, 0 deletions