Searched refs:fQueueLen (Results 1 - 5 of 5) sorted by relevance

/haiku/src/system/boot/platform/riscv/
H A Dvirtio.cpp68 for (size_t i = 0; i < fQueueLen; i++) {
101 fQueueLen = fRegs->queueNumMax;
102 fRegs->queueNum = fQueueLen;
105 fDescs = (VirtioDesc*)aligned_malloc(sizeof(VirtioDesc) * fQueueLen, 4096);
106 memset(fDescs, 0, sizeof(VirtioDesc) * fQueueLen);
108 + sizeof(uint16_t) * fQueueLen, 4096);
109 memset(fAvail, 0, sizeof(VirtioAvail) + sizeof(uint16_t) * fQueueLen);
111 + sizeof(VirtioUsedItem) * fQueueLen, 4096);
112 memset(fUsed, 0, sizeof(VirtioUsed) + sizeof(VirtioUsedItem) * fQueueLen);
113 fFreeDescs = new(std::nothrow) uint32_t[(fQueueLen
[all...]
H A Dvirtio.h47 size_t fQueueLen; member in class:VirtioDevice
/haiku/src/add-ons/kernel/busses/virtio/virtio_mmio/
H A DVirtioDevice.cpp50 fQueueLen = fDev->fRegs->queueNumMax;
51 fDescCount = fQueueLen;
52 fDev->fRegs->queueNum = fQueueLen;
60 queueMemSize += ROUNDUP(sizeof(VirtioAvail) + sizeof(uint16) * fQueueLen, B_PAGE_SIZE);
63 queueMemSize += ROUNDUP(sizeof(VirtioUsed) + sizeof(VirtioUsedItem) * fQueueLen, B_PAGE_SIZE);
185 int32_t idx = fAvail->idx & (fQueueLen - 1);
203 int32_t desc = fUsed->ring[fLastUsed & (fQueueLen - 1)].id;
210 *_usedLength = fUsed->ring[fLastUsed & (fQueueLen - 1)].len;
H A DVirtioDevice.h35 size_t fQueueLen; member in struct:VirtioQueue
H A Dvirtio_mmio.cpp622 return (uint16)queue->fQueueLen;

Completed in 41 milliseconds