Searched refs:fHead (Results 1 - 6 of 6) sorted by relevance

/haiku/src/kits/app/
H A DMessageQueue.cpp21 fHead(NULL),
34 BMessage* message = fHead;
62 fHead = fTail = message;
82 for (BMessage* entry = fHead; entry != NULL; entry = entry->fQueueLink) {
85 if (entry == fHead)
86 fHead = entry->fQueueLink;
125 for (BMessage* message = fHead; message != NULL; message = message->fQueueLink) {
147 for (BMessage* message = fHead; message != NULL; message = message->fQueueLink) {
191 BMessage* head = fHead;
196 fHead
[all...]
/haiku/headers/os/app/
H A DMessageQueue.h49 BMessage* fHead; member in class:BMessageQueue
/haiku/src/add-ons/kernel/file_systems/nfs4/
H A DConnection.cpp213 fHead(NULL),
224 freeaddrinfo(fHead);
233 if (fHead != NULL) {
234 freeaddrinfo(fHead);
235 fHead = NULL;
253 status_t result = getaddrinfo(name, NULL, NULL, &fHead);
254 fCurrent = fHead;
290 if (fHead == NULL) {
H A DConnection.h70 addrinfo* fHead; member in class:AddressResolver
/haiku/src/add-ons/kernel/partitioning_systems/common/
H A DPartitionMap.cpp487 fHead(NULL),
515 while (LogicalPartition* partition = fHead) {
516 fHead = partition->Next();
519 fHead = NULL;
533 const LogicalPartition* otherLogical = other.fHead;
573 for (partition = fHead; index > 0; index--)
592 fHead = fTail = partition;
612 fHead = next;
H A DPartitionMap.h233 LogicalPartition* fHead; member in class:PrimaryPartition

Completed in 91 milliseconds