fUsed
fUsed(0),
return fUsed == 0;
fUsed = 0;
if (fUsed >= fMax) {
fArray[fUsed++] = value;
if (fUsed == 0)
*value = fArray[--fUsed];
return fUsed;
int32_t fUsed;
fUsed(0),
if (fUsed >= fMax) {
fArray[fUsed++] = value;
if (fUsed == 0)
*value = fArray[--fUsed];
return fUsed;
int32 fUsed;
fUsed(0),
return fUsed == 0;
fUsed = 0;
if (fUsed >= fMax) {
fArray[fUsed++] = value;
if (fUsed == 0)
*value = fArray[--fUsed];
return fUsed;
int32 fUsed;
if (fUsed->idx == fLastUsed)
int32_t desc = fUsed->ring[fLastUsed & (fQueueLen - 1)].id;
*_usedLength = fUsed->ring[fLastUsed & (fQueueLen - 1)].len;
if (queue->fUsed->idx != queue->fLastUsed
fUsed = (VirtioUsed*) (queueMem + usedOffset);
phys_addr_t usedPhys = (addr_t)fUsed - (addr_t)queueMem + pe.address;
volatile VirtioUsed *fUsed;
return queue->fUsed->idx == queue->fLastUsed;
kprintf(" used: %" B_PRIu32 "\n", fUsed);
fUsed(0),
journal->fUsed -= logEntry->Length();
fUsed += logEntry->Length();
uint32 fUsed;
BRect used(b.LeftTop(), BSize(b.Width() / (100.0 / fUsed), b.Height()));
float fUsed;
fUsed = 100.0 / ((float)volume.Capacity()
if (fUsed < 0)
fUsed = 100.0;
fUsed(0),
if (fUsed >= fMax)
fArray[fUsed++] = value;
if (fUsed == 0)
*value = fArray[--fUsed];
int32 fUsed;
fUsed.RemoveItem(region);
if (fUsed.CountItems() > 0)
fUsed.AddItem(region);
fUsed.AddItem(region);
BList fUsed;
fUsed = (VirtioUsed*)aligned_malloc(sizeof(VirtioUsed)
memset(fUsed, 0, sizeof(VirtioUsed) + sizeof(VirtioUsedItem) * fQueueLen);
fRegs->queueUsedLow = (uint32_t)(uint64_t)fUsed;
fRegs->queueUsedHi = (uint32_t)((uint64_t)fUsed >> 32);
if (fUsed->idx == fLastUsed)
int32 desc = fUsed->ring[fLastUsed % fQueueLen].id;
while (fUsed->idx == fLastUsed) {}
VirtioUsed* volatile fUsed;
fUsed += allocate;
fUsed += allocate;
if (size > fUsed)
fUsed -= size;
fUsed += amount;
size_t freeLimit = ((fUsed * kFreePercentage) / 100);
size_t fUsed;
fUsed = fFree = 0;
fUsed += allocate;