Searched refs:fUsed (Results 1 - 16 of 16) sorted by relevance

/haiku/headers/private/media/
H A DTStack.h16 fUsed(0),
29 if (fUsed >= fMax) {
37 fArray[fUsed++] = value;
43 if (fUsed == 0)
46 *value = fArray[--fUsed];
52 return fUsed;
57 int32 fUsed; member in class:Stack
/haiku/headers/private/fs_shell/
H A DStack.h22 fUsed(0),
34 return fUsed == 0;
40 fUsed = 0;
45 if (fUsed >= fMax) {
53 fArray[fUsed++] = value;
59 if (fUsed == 0)
62 *value = fArray[--fUsed];
73 return fUsed;
78 int32_t fUsed; member in class:FSShell::Stack
/haiku/src/apps/sudoku/
H A DStack.h19 fUsed(0),
31 return fUsed == 0;
37 fUsed = 0;
42 if (fUsed >= fMax) {
50 fArray[fUsed++] = value;
56 if (fUsed == 0)
59 *value = fArray[--fUsed];
70 return fUsed;
75 int32 fUsed; member in class:Stack
/haiku/src/bin/bfs_tools/lib/
H A DStack.h21 fUsed(0),
34 if (fUsed >= fMax)
41 fArray[fUsed++] = value;
47 if (fUsed == 0)
50 *value = fArray[--fUsed];
56 int32 fUsed; member in class:Stack
/haiku/src/add-ons/translators/rtf/
H A DStack.h20 fUsed(0),
32 return fUsed == 0;
38 fUsed = 0;
43 if (fUsed >= fMax) {
51 fArray[fUsed++] = value;
57 if (fUsed == 0)
60 *value = fArray[--fUsed];
66 int32 fUsed; member in class:Stack
/haiku/headers/private/kernel/util/
H A DStack.h21 fUsed(0),
33 return fUsed == 0;
39 fUsed = 0;
44 if (fUsed >= fMax) {
52 fArray[fUsed++] = value;
58 if (fUsed == 0)
61 *value = fArray[--fUsed];
72 return fUsed;
77 int32 fUsed; member in class:Stack
/haiku/src/servers/app/
H A DRegionPool.cpp25 ,fUsed(4)
34 if (fUsed.CountItems() > 0)
57 fUsed.AddItem(region);
81 fUsed.AddItem(region);
100 fUsed.RemoveItem(region);
H A DRegionPool.h30 BList fUsed; member in class:RegionPool
/haiku/src/system/boot/platform/riscv/
H A Dvirtio.cpp110 fUsed = (VirtioUsed*)aligned_malloc(sizeof(VirtioUsed)
112 memset(fUsed, 0, sizeof(VirtioUsed) + sizeof(VirtioUsedItem) * fQueueLen);
122 fRegs->queueUsedLow = (uint32_t)(uint64_t)fUsed;
123 fRegs->queueUsedHi = (uint32_t)((uint64_t)fUsed >> 32);
127 dprintf("fUsed: %p\n", fUsed);
187 if (fUsed->idx == fLastUsed)
193 int32 desc = fUsed->ring[fLastUsed % fQueueLen].id;
208 while (fUsed->idx == fLastUsed) {}
H A Dvirtio.h50 VirtioUsed* volatile fUsed; member in class:VirtioDevice
/haiku/src/add-ons/kernel/busses/virtio/virtio_mmio/
H A DVirtioDevice.cpp88 fUsed = (VirtioUsed*) (queueMem + usedOffset);
93 phys_addr_t usedPhys = (addr_t)fUsed - (addr_t)queueMem + pe.address;
200 if (fUsed->idx == fLastUsed)
203 int32_t desc = fUsed->ring[fLastUsed & (fQueueLen - 1)].id;
210 *_usedLength = fUsed->ring[fLastUsed & (fQueueLen - 1)].len;
258 if (queue->fUsed->idx != queue->fLastUsed
H A DVirtioDevice.h40 volatile VirtioUsed *fUsed; member in struct:VirtioQueue
H A Dvirtio_mmio.cpp614 return queue->fUsed->idx == queue->fLastUsed;
/haiku/src/apps/drivesetup/
H A DDiskView.cpp91 fUsed = 100.0 / ((float)volume.Capacity()
93 if (fUsed < 0)
94 fUsed = 100.0;
177 BRect used(b.LeftTop(), BSize(b.Width() / (100.0 / fUsed), b.Height()));
307 float fUsed; member in class:PartitionView
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DJournal.h71 uint32 fUsed; member in class:Journal
H A DJournal.cpp407 fUsed(0),
674 journal->fUsed -= logEntry->Length();
901 fUsed += logEntry->Length();
1115 kprintf(" used: %" B_PRIu32 "\n", fUsed);

Completed in 187 milliseconds