diff options
| author | Robin Murphy <robin.murphy@arm.com> | 2017-09-21 18:52:44 +0300 |
|---|---|---|
| committer | Joerg Roedel <jroedel@suse.de> | 2017-09-27 18:09:57 +0300 |
| commit | e60aa7b53845a261dd419652f12ab9f89e668843 (patch) | |
| tree | 4fd8f76916b5ad7b393f6e9c1382cd36443ab4e5 /crypto/lz4.c | |
| parent | 086c83acb70fc6da044c9ca45c1c9780c64545b0 (diff) | |
| download | linux-e60aa7b53845a261dd419652f12ab9f89e668843.tar.xz | |
iommu/iova: Extend rbtree node caching
The cached node mechanism provides a significant performance benefit for
allocations using a 32-bit DMA mask, but in the case of non-PCI devices
or where the 32-bit space is full, the loss of this benefit can be
significant - on large systems there can be many thousands of entries in
the tree, such that walking all the way down to find free space every
time becomes increasingly awful.
Maintain a similar cached node for the whole IOVA space as a superset of
the 32-bit space so that performance can remain much more consistent.
Inspired by work by Zhen Lei <thunder.leizhen@huawei.com>.
Tested-by: Ard Biesheuvel <ard.biesheuvel@linaro.org>
Tested-by: Zhen Lei <thunder.leizhen@huawei.com>
Tested-by: Nate Watterson <nwatters@codeaurora.org>
Signed-off-by: Robin Murphy <robin.murphy@arm.com>
Signed-off-by: Joerg Roedel <jroedel@suse.de>
Diffstat (limited to 'crypto/lz4.c')
0 files changed, 0 insertions, 0 deletions