/haiku/headers/private/kernel/util/ |
H A D | DoublyLinkedQueue.h | 136 DoublyLinkedQueue() : fFirst(NULL) {} 139 inline bool IsEmpty() const { return (fFirst == NULL); } 153 inline Element *First() const { return fFirst; } 154 inline Element *Head() const { return fFirst; } 168 Element *fFirst; member in class:DoublyLinkedQueue 184 elLink->next = fFirst; 185 if (fFirst) 186 sGetLink(fFirst)->previous = element; 187 fFirst = element; 212 if (fFirst [all...] |
H A D | SinglyLinkedList.h | 142 SinglyLinkedList() : fFirst(NULL) {} 145 inline bool IsEmpty() const { return (fFirst == NULL); } 157 inline Element* First() const { return fFirst; } 158 inline Element* Head() const { return fFirst; } 170 Element *fFirst; member in class:SinglyLinkedList 184 sGetLink(element)->next = fFirst; 185 fFirst = element; 204 Element* next = fFirst; 215 fFirst = elementLink->next; 229 // ? fFirst [all...] |
H A D | DoublyLinkedList.h | 330 DoublyLinkedList() : fFirst(NULL), fLast(NULL) {} 333 inline bool IsEmpty() const { return (fFirst == NULL); } 348 inline Element* First() const { return fFirst; } 351 inline Element* Head() const { return fFirst; } 383 Element* fFirst; member in class:DoublyLinkedList 399 ASSERT_PRINT(fFirst == NULL ? fLast == NULL : fLast != NULL, 411 fFirst = element; 416 elLink->next = fFirst; 417 if (fFirst) 418 sGetLink(fFirst) [all...] |
H A D | SplayTree.h | 426 fNext = fTree->fFirst; 482 fNext = fTree->fFirst; 493 fFirst(NULL) 506 previousNext = &fFirst; 524 previousNext = &fFirst; 540 previousNext = &fFirst; 604 fFirst = other.fFirst; 614 Node* fFirst; member in class:IteratableSplayTree
|
/haiku/src/apps/activitymonitor/ |
H A D | CircularBuffer.h | 55 fFirst = 0; 73 return &fBuffer[(fFirst + index) % fSize]; 80 index = fFirst + fIn++; 82 index = fFirst++; 94 uint32 fFirst; member in class:CircularBuffer
|
/haiku/src/add-ons/kernel/file_systems/nfs/ |
H A D | RPCPendingCalls.c | 23 calls->fFirst=NULL; 33 while (calls->fFirst) 35 struct PendingCall *next=calls->fFirst->next; 37 SemaphorePoolPut (&calls->fPool,calls->fFirst->sem); 38 PendingCallDestroy (calls->fFirst); 39 free (calls->fFirst); 41 calls->fFirst=next; 61 call->next=calls->fFirst; 62 calls->fFirst=call; 78 current=calls->fFirst; // mmu_ma [all...] |
H A D | RPCPendingCalls.h | 38 struct PendingCall *fFirst; member in struct:RPCPendingCalls
|
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/ |
H A D | SLList.h | 165 SLList() : fFirst(NULL), fLast(NULL) {} 167 : fFirst(NULL), fLast(NULL), fGetLink(getLink) {} 170 inline bool IsEmpty() const { return (fFirst == NULL); } 181 inline Element *GetFirst() const { return fFirst; } 184 inline Element *GetHead() const { return fFirst; } 201 Element *fFirst; member in class:UserlandFSUtil::SLList 237 elLink->next = fFirst; 238 fFirst = element; 268 if (fromList && fromList->fFirst) { 269 if (fFirst) { [all...] |
/haiku/headers/private/fs_shell/ |
H A D | DoublyLinkedList.h | 325 DoublyLinkedList() : fFirst(NULL), fLast(NULL) {} 328 inline bool IsEmpty() const { return (fFirst == NULL); } 343 inline Element *First() const { return fFirst; } 346 inline Element *Head() const { return fFirst; } 370 Element *fFirst; member in class:FSShell::DoublyLinkedList 393 fFirst = element; 399 elLink->next = fFirst; 400 if (fFirst) 401 sGetLink(fFirst)->previous = element; 404 fFirst [all...] |
H A D | SinglyLinkedList.h | 145 SinglyLinkedList() : fFirst(NULL) {} 148 inline bool IsEmpty() const { return (fFirst == NULL); } 156 inline Element* First() const { return fFirst; } 157 inline Element* Head() const { return fFirst; } 169 Element *fFirst; member in class:FSShell::SinglyLinkedList 183 sGetLink(element)->next = fFirst; 184 fFirst = element; 196 Element* next = fFirst; 205 fFirst = elementLink->next; 217 Element* element = fFirst; [all...] |
/haiku/headers/libs/print/libprint/ |
H A D | Preview.h | 141 BButton* fFirst; member in class:PreviewWindow
|
/haiku/src/add-ons/kernel/partitioning_systems/session/ |
H A D | Disc.cpp | 68 list_item* fFirst; member in class:List 310 fFirst(NULL), 328 list_item* item = fFirst; 350 fFirst = fLast = item; 363 list_item* item = fFirst; 369 fFirst = fLast = NULL; 387 list_item* item = fFirst; 401 // item is not fFirst 406 // item must be fFirst 407 fFirst [all...] |
/haiku/src/libs/print/libprint/ |
H A D | Preview.cpp | 795 fFirst = new BButton(bounds, "first", "First page", new BMessage(MSG_FIRST_PAGE)); 796 panel->AddChild(fFirst); 797 fFirst->ResizeToPreferred(); 799 bounds.OffsetBy(fFirst->Bounds().Width() + 10.0, 0.0); 836 fFirst->Bounds().Height()); 995 fFirst->SetEnabled(!fPreview->ShowsFirstPage());
|