Struct virtio_driver::virtqueue::VirtqueueLayout
source · pub struct VirtqueueLayout {
pub num_queues: usize,
pub avail_offset: usize,
pub used_offset: usize,
pub req_offset: usize,
pub end_offset: usize,
}Expand description
A description how the memory passed for each virtqueue is split into individual regions.
- The Virtqueue Descriptor Table starts from offset 0
- The Virtqueue Available Ring starts at
avail_offset - The Virtqueue Used Ring starts at
used_offset - Driver-specific per request data that needs to be shared with the device (e.g. request
headers or status bytes) start at
req_offset
Fields§
§num_queues: usize§avail_offset: usize§used_offset: usize§req_offset: usize§end_offset: usizeImplementations§
source§impl VirtqueueLayout
impl VirtqueueLayout
sourcepub fn new<R>(num_queues: usize, queue_size: usize) -> Result<Self, Error>
pub fn new<R>(num_queues: usize, queue_size: usize) -> Result<Self, Error>
Examples found in repository?
src/devices/virtio_blk.rs (line 269)
257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296
pub fn setup_queues(
transport: &mut VirtioBlkTransport,
num_queues: usize,
queue_size: u16,
) -> Result<Vec<Self>, Error> {
if virtio_blk_max_queues(transport)? < num_queues {
return Err(Error::new(
ErrorKind::InvalidInput,
"Too many queues requested",
));
}
let layout = VirtqueueLayout::new::<VirtioBlkReqBuf>(num_queues, queue_size as usize)?;
let queues: Vec<_> = {
// Not actually needless: must drop the borrow on the transport before alloc_queue_mem()
#[allow(clippy::needless_collect)]
let iova_translators: Vec<_> = iter::repeat_with(|| transport.iova_translator())
.take(num_queues)
.collect();
let mem = transport.alloc_queue_mem(&layout)?;
iova_translators
.into_iter()
.enumerate()
.map(|(i, iova_translator)| {
let mem_queue = unsafe {
std::slice::from_raw_parts_mut(
&mut mem[i * layout.end_offset] as *mut u8,
layout.end_offset,
)
};
Virtqueue::new(iova_translator, mem_queue, queue_size)
})
.collect::<Result<_, _>>()?
};
transport.setup_queues(&queues)?;
Ok(queues.into_iter().map(Self::new).collect())
}More examples
src/virtqueue.rs (line 216)
211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256
pub fn new(
iova_translator: Box<dyn IovaTranslator>,
buf: &'a mut [u8],
queue_size: u16,
) -> Result<Self, Error> {
let layout = VirtqueueLayout::new::<R>(1, queue_size as usize)?;
let mem = buf
.get_mut(0..layout.end_offset)
.ok_or_else(|| Error::new(ErrorKind::InvalidInput, "Incorrectly sized queue buffer"))?;
let (mem, req_mem) = mem.split_at_mut(layout.req_offset);
let (mem, used_mem) = mem.split_at_mut(layout.used_offset);
let (desc_mem, avail_mem) = mem.split_at_mut(layout.avail_offset);
let avail = VirtqueueRing::new(avail_mem, queue_size as usize);
let used = VirtqueueRing::new(used_mem, queue_size as usize);
let desc: &mut [VirtqueueDescriptor] = unsafe {
std::slice::from_raw_parts_mut(
desc_mem.as_mut_ptr() as *mut VirtqueueDescriptor,
queue_size as usize,
)
};
for i in 0..queue_size - 1 {
desc[i as usize].next = (i + 1).into();
}
desc[(queue_size - 1) as usize].next = NO_FREE_DESC.into();
let req = req_mem.as_mut_ptr() as *mut R;
if req.align_offset(mem::align_of::<R>()) != 0 {
return Err(Error::new(
ErrorKind::InvalidInput,
"Insufficient memory alignment",
));
}
Ok(Virtqueue {
iova_translator,
queue_size,
desc,
avail,
used,
req,
first_free_desc: 0,
})
}