1 unstable release

0.1.0 May 12, 2022

#76 in Memory management

Download history 3539/week @ 2022-08-01 3674/week @ 2022-08-08 2182/week @ 2022-08-15 2885/week @ 2022-08-22 1793/week @ 2022-08-29 3612/week @ 2022-09-05 2562/week @ 2022-09-12 2513/week @ 2022-09-19 4245/week @ 2022-09-26 6830/week @ 2022-10-03 2545/week @ 2022-10-10 4791/week @ 2022-10-17 8753/week @ 2022-10-24 5231/week @ 2022-10-31 6574/week @ 2022-11-07 6036/week @ 2022-11-14

26,755 downloads per month

Apache-2.0 OR BSD-3-Clause

73KB
1.5K SLoC

vm-allocator

vm-allocator is a crate designed to provide allocation and release strategies that are needed by the VMM during the lifetime of a virtual machine. Possible resource types that a VMM could allocate using vm-allocator are MMIO addresses, PIO addresses, GSI numbers, device IDs.

This crate exports 2 allocators: one for resources that can be represented as integers, and one for addresses. The reason behind having two separate allocators is the need to add semantic meaning to the address allocator, by specifying configuration parameters such as the alignment that do not make sense in the context of IDs.

The main components of the crate are:

  • IDAllocator - which should be used for all resources that can be reduced to an integer type.
  • AddressAllocator - which should be used to allocate address ranges in different address spaces. This component is a wrapper over IntervalTree that adds semantics to address ranges. More details about the inner presentation of the address allocator can be found in the Design Document.

ID Allocator

Design

This allocator should be used to allocate resources that can be reduced to an integer type like legacy GSI numbers or KVM memory slot IDs. The characteristics of such a resource are represented by the IdAllocator struct.

The struct that defines the IdAllocator contains the end of the interval that is managed, a field that points at the next available ID and a BTreeSet that is used to store the released IDs. The reason for using a BTreeSet is that the average complexity for deletion and insertion is O(log N), offering a better performance when compared to Vector for example. The entries are sorted, so we will always use the first available ID.

Allocation policy

When allocating a new ID we always try to return the smallest one available. To do that we first search in the BTreeSet for any ID that was released and if we cannot find anything there we return the next ID from the range that was never allocated.

The IdAllocator struct implements methods for allocating and releasing IDs.

Usage

Add vm-allocator as a dependency in Cargo.toml

[dependencies]
vm-allocator = "*"

Then add extern crate vm-allocator; to projects crate root. The VMM using this crate should instantiate an IdAllocator object for each resource type they want to manage.

License

This project is licensed under either of

Dependencies

~225–670KB
~16K SLoC