Home
last modified time | relevance | path

Searched hist:fb88707dd39bd1d5ec4a058776de9ee99bcc7b72 (Results 1 – 3 of 3) sorted by relevance

/openbmc/linux/include/kvm/
H A Darm_hypercalls.hdiff fb88707dd39bd1d5ec4a058776de9ee99bcc7b72 Tue Apr 04 10:40:44 CDT 2023 Oliver Upton <oliver.upton@linux.dev> KVM: arm64: Use a maple tree to represent the SMCCC filter

Maple tree is an efficient B-tree implementation that is intended for
storing non-overlapping intervals. Such a data structure is a good fit
for the SMCCC filter as it is desirable to sparsely allocate the 32 bit
function ID space.

To that end, add a maple tree to kvm_arch and correctly init/teardown
along with the VM. Wire in a test against the hypercall filter for HVCs
which does nothing until the controls are exposed to userspace.

Signed-off-by: Oliver Upton <oliver.upton@linux.dev>
Signed-off-by: Marc Zyngier <maz@kernel.org>
Link: https://lore.kernel.org/r/20230404154050.2270077-8-oliver.upton@linux.dev
/openbmc/linux/arch/arm64/kvm/
H A Dhypercalls.cdiff fb88707dd39bd1d5ec4a058776de9ee99bcc7b72 Tue Apr 04 10:40:44 CDT 2023 Oliver Upton <oliver.upton@linux.dev> KVM: arm64: Use a maple tree to represent the SMCCC filter

Maple tree is an efficient B-tree implementation that is intended for
storing non-overlapping intervals. Such a data structure is a good fit
for the SMCCC filter as it is desirable to sparsely allocate the 32 bit
function ID space.

To that end, add a maple tree to kvm_arch and correctly init/teardown
along with the VM. Wire in a test against the hypercall filter for HVCs
which does nothing until the controls are exposed to userspace.

Signed-off-by: Oliver Upton <oliver.upton@linux.dev>
Signed-off-by: Marc Zyngier <maz@kernel.org>
Link: https://lore.kernel.org/r/20230404154050.2270077-8-oliver.upton@linux.dev
/openbmc/linux/arch/arm64/include/asm/
H A Dkvm_host.hdiff fb88707dd39bd1d5ec4a058776de9ee99bcc7b72 Tue Apr 04 10:40:44 CDT 2023 Oliver Upton <oliver.upton@linux.dev> KVM: arm64: Use a maple tree to represent the SMCCC filter

Maple tree is an efficient B-tree implementation that is intended for
storing non-overlapping intervals. Such a data structure is a good fit
for the SMCCC filter as it is desirable to sparsely allocate the 32 bit
function ID space.

To that end, add a maple tree to kvm_arch and correctly init/teardown
along with the VM. Wire in a test against the hypercall filter for HVCs
which does nothing until the controls are exposed to userspace.

Signed-off-by: Oliver Upton <oliver.upton@linux.dev>
Signed-off-by: Marc Zyngier <maz@kernel.org>
Link: https://lore.kernel.org/r/20230404154050.2270077-8-oliver.upton@linux.dev