diff options
| author | Maciej S. Szmigiero | 2021-12-06 20:54:28 +0100 |
|---|---|---|
| committer | Paolo Bonzini | 2021-12-08 04:24:32 -0500 |
| commit | ed922739c9199bf515a3e7fec3e319ce1edeef2a (patch) | |
| tree | 287fba29b9f4f72147c4db889723274e3e7269f1 /drivers/ptp/ptp_chardev.c | |
| parent | 26b8345abc75a7404716864710930407b7d873f9 (diff) | |
KVM: Use interval tree to do fast hva lookup in memslots
The current memslots implementation only allows quick binary search by gfn,
quick lookup by hva is not possible - the implementation has to do a linear
scan of the whole memslots array, even though the operation being performed
might apply just to a single memslot.
This significantly hurts performance of per-hva operations with higher
memslot counts.
Since hva ranges can overlap between memslots an interval tree is needed
for tracking them.
[sean: handle interval tree updates in kvm_replace_memslot()]
Signed-off-by: Maciej S. Szmigiero <maciej.szmigiero@oracle.com>
Message-Id: <d66b9974becaa9839be9c4e1a5de97b177b4ac20.1638817640.git.maciej.szmigiero@oracle.com>
Diffstat (limited to 'drivers/ptp/ptp_chardev.c')
0 files changed, 0 insertions, 0 deletions