| /haiku/headers/private/app/ |
| H A D | DirectMessageTarget.h | 27 BMessageQueue* Queue() { return &fQueue; }
33 BMessageQueue fQueue; member in class:BPrivate::BDirectMessageTarget
|
| /haiku/headers/private/shared/ |
| H A D | RWLocker.h | 124 Benaphore fQueue; // queueing semaphore member in class:RWLocker
|
| /haiku/headers/tools/cppunit/ |
| H A D | TestApp.h | 20 BMessageQueue fQueue; member in class:BTestHandler
|
| /haiku/src/add-ons/kernel/file_systems/nfs4/ |
| H A D | WorkQueue.cpp | 71 fQueue.InsertAfter(fQueue.Tail(), entry);
123 WorkQueueEntry* entry = fQueue.RemoveHead();
|
| H A D | WorkQueue.h | 64 DoublyLinkedList<WorkQueueEntry> fQueue; member in class:WorkQueue
|
| /haiku/src/add-ons/kernel/file_systems/packagefs/package/ |
| H A D | CachedDataReader.h | 61 return fQueue;
83 DoublyLinkedList<CacheLineLocker> fQueue; member in class:CachedDataReader::CacheLineLocker
|
| /haiku/src/add-ons/media/media-add-ons/dvb/ |
| H A D | PacketQueue.cpp | 40 : fQueue(new Packet* [max_packets])
55 delete [] fQueue;
63 delete fQueue[fReadIndex];
79 fQueue[fWriteIndex] = packet;
97 *packet = fQueue[fReadIndex];
117 Packet *packet = fQueue[fReadIndex];
137 *packet = new Packet(*fQueue[fReadIndex]);
|
| H A D | PacketQueue.h | 58 Packet **fQueue; member in class:PacketQueue
|
| /haiku/src/add-ons/print/transports/lpr/ |
| H A D | LprSetupDlg.cpp | 85 BTextControl* fQueue; member in class:LprSetupView
114 fQueue = new BTextControl(QUEUE_RECT, "", QUEUE_TEXT, "LPT1_PASSTHRU",
116 AddChild(fQueue);
117 fQueue->SetDivider(width);
136 if (*fServer->Text() && *fQueue->Text()) {
152 fDir->WriteAttr(LPR_QUEUE_NAME, B_STRING_TYPE, 0, fQueue->Text(),
153 strlen(fQueue->Text()) + 1);
|
| H A D | LprTransport.cpp | 32 fQueue[0] = '\0';
61 dir.ReadAttr(LPR_QUEUE_NAME, B_STRING_TYPE, 0, fQueue, sizeof(fQueue));
118 lpr.receiveJob(fQueue);
|
| H A D | LprTransport.h | 30 char fQueue[256]; member in class:LprTransport
|
| /haiku/src/apps/showimage/ |
| H A D | ImageCache.cpp | 145 fQueue.push_front(entry);
165 while (!fQueue.empty()) {
166 QueueEntry* entry = *fQueue.begin();
167 fQueue.pop_front();
192 if (self->fQueue.empty()) {
197 QueueEntry* entry = *self->fQueue.begin();
200 self->fQueue.pop_front();
|
| H A D | ImageCache.h | 87 QueueDeque fQueue; member in class:ImageCache
|
| /haiku/src/kits/app/ |
| H A D | DirectMessageTarget.cpp | 37 fQueue.AddMessage(message);
|
| /haiku/src/kits/shared/ |
| H A D | RWLocker.cpp | 24 fQueue(),
39 fQueue(),
55 delete_sem(fQueue.semaphore);
197 fQueue.semaphore = create_sem(0, queueName.String());
198 fQueue.counter = 0;
228 error = _AcquireBenaphore(fQueue, timeout);
261 _ReleaseBenaphore(fQueue);
353 error = _AcquireBenaphore(fQueue, timeout);
396 _ReleaseBenaphore(fQueue);
|
| /haiku/src/tests/kits/storage/ |
| H A D | TestApp.cpp | 19 fQueue.Lock();
20 fQueue.AddMessage(clone);
21 fQueue.Unlock();
28 return fQueue;
|
| H A D | TestApp.h | 18 BMessageQueue fQueue; member in class:BTestHandler
|
| H A D | MimeTypeTest.cpp | 537 : fQueue(queue) { }
539 fQueue.push(value);
542 std::queue<std::string> &fQueue; member in class:QueueAdapter
|
| /haiku/src/tools/cppunit/ |
| H A D | TestApp.cpp | 20 fQueue.Lock();
21 fQueue.AddMessage(clone);
22 fQueue.Unlock();
30 return fQueue;
|
| /haiku/headers/private/kernel/util/ |
| H A D | DoublyLinkedQueue.h | 38 fQueue(queue)
57 fNext = fQueue->GetNext(fNext);
65 fQueue->Remove(fCurrent);
73 fQueue = other.fQueue;
82 fNext = fQueue->First();
86 Queue *fQueue; member in class:DoublyLinkedQueue::Iterator
95 fQueue(queue)
114 fNext = fQueue->GetNext(fNext);
120 fQueue
131 const Queue *fQueue; member in class:DoublyLinkedQueue::ConstIterator
[all...] |
| /haiku/src/add-ons/kernel/bus_managers/virtio/ |
| H A D | VirtioQueue.cpp | 67 VirtioQueue* fQueue; member in class:TransferDescriptor
79 : fQueue(queue),
|