Searched refs:sGetLink (Results 1 - 8 of 8) sorted by relevance

/haiku/headers/private/kernel/util/
H A DDoublyLinkedQueue.h170 static GetLink sGetLink; member in class:DoublyLinkedQueue
182 Link *elLink = sGetLink(element);
186 sGetLink(fFirst)->previous = element;
203 Link *beforeLink = sGetLink(before);
204 Link *link = sGetLink(element);
209 sGetLink(link->previous)->next = element;
237 Link *elLink = sGetLink(element);
241 sGetLink(elLink->previous)->next = elLink->next;
244 sGetLink(elLink->next)->previous = elLink->previous;
255 Link *aLink = sGetLink(
364 GetLink DOUBLY_LINKED_QUEUE_CLASS_NAME::sGetLink; member in class:DOUBLY_LINKED_QUEUE_CLASS_NAME
[all...]
H A DSinglyLinkedList.h172 static GetLink sGetLink; member in class:SinglyLinkedList
184 sGetLink(element)->next = fFirst;
210 next = sGetLink(next)->next;
213 Link* elementLink = sGetLink(element);
217 sGetLink(last)->next = elementLink->next;
229 // ? fFirst == element : sGetLink(previous)->next == element);
231 Link* elementLink = sGetLink(element);
235 sGetLink(previous)->next = elementLink->next;
257 while (Element* next = sGetLink(tail)->next)
260 sGetLink(tai
313 GetLink SINGLY_LINKED_LIST_CLASS_NAME::sGetLink; member in class:SINGLY_LINKED_LIST_CLASS_NAME
[all...]
H A DMinMaxHeap.h106 static GetLink sGetLink; member in class:MinMaxHeap
225 return sGetLink(element)->fKey;
233 MinMaxHeapLink<Element, Key>* link = sGetLink(element);
260 MinMaxHeapLink<Element, Key>* link = sGetLink(element);
281 MinMaxHeapLink<Element, Key>* link = sGetLink(element);
303 MinMaxHeapLink<Element, Key>* link = sGetLink(element);
357 bool isSmaller = sCompare(link->fKey, sGetLink(tree[parent])->fKey);
359 ASSERT(sGetLink(tree[parent])->fIndex == parent);
360 sGetLink(tree[parent])->fIndex = link->fIndex;
386 bool isSmaller = sCompare(sGetLink(tre
[all...]
H A DDoublyLinkedList.h386 static GetLink sGetLink; member in class:DoublyLinkedList
403 Link* elLink = sGetLink(element);
409 sGetLink(fLast)->next = element;
418 sGetLink(fFirst)->previous = element;
443 Link* beforeLink = sGetLink(before);
444 Link* link = sGetLink(element);
451 sGetLink(link->previous)->next = element;
473 Link* afterLink = sGetLink(after);
474 Link* link = sGetLink(element);
481 sGetLink(lin
677 GetLink DOUBLY_LINKED_LIST_CLASS_NAME::sGetLink; member in class:DOUBLY_LINKED_LIST_CLASS_NAME
[all...]
H A DHeap.h101 static GetLink sGetLink; member in class:Heap
203 return sGetLink(element)->fKey;
211 HeapLink<Element, Key>* link = sGetLink(element);
232 HeapLink<Element, Key>* link = sGetLink(element);
241 sGetLink(lastElement)->fIndex = 0;
242 _MoveDown(sGetLink(lastElement));
259 HeapLink<Element, Key>* link = sGetLink(element);
298 && sCompare(link->fKey, sGetLink(fElements[parent])->fKey)) {
300 sGetLink(fElements[parent])->fIndex = link->fIndex;
324 && sCompare(sGetLink(fElement
353 GetLink HEAP_CLASS_NAME::sGetLink; member in class:HEAP_CLASS_NAME
[all...]
/haiku/headers/private/fs_shell/
H A DDoublyLinkedList.h373 static GetLink sGetLink; member in class:FSShell::DoublyLinkedList
387 Link *elLink = sGetLink(element);
391 sGetLink(fLast)->next = element;
397 Link *elLink = sGetLink(element);
401 sGetLink(fFirst)->previous = element;
421 Link *beforeLink = sGetLink(before);
422 Link *link = sGetLink(element);
427 sGetLink(link->previous)->next = element;
446 Link* afterLink = sGetLink(after);
447 Link* link = sGetLink(elemen
599 GetLink DOUBLY_LINKED_LIST_CLASS_NAME::sGetLink; member in class:FSShell::DOUBLY_LINKED_LIST_CLASS_NAME
[all...]
H A DSinglyLinkedList.h171 static GetLink sGetLink; member in class:FSShell::SinglyLinkedList
183 sGetLink(element)->next = fFirst;
200 next = sGetLink(next)->next;
203 Link* elementLink = sGetLink(element);
207 sGetLink(last)->next = elementLink->next;
219 Link* elLink = sGetLink(element);
243 result = sGetLink(element)->next;
258 // sGetLink
260 GetLink SINGLY_LINKED_LIST_CLASS_NAME::sGetLink; member in class:FSShell::SINGLY_LINKED_LIST_CLASS_NAME
/haiku/src/system/kernel/scheduler/
H A DRunQueue.h81 static GetLink sGetLink; member in class:RunQueue::ConstIterator
115 static GetLink sGetLink; member in class:RunQueue
197 RunQueueLink<Element>* link = sGetLink(fNext);
269 ASSERT(sGetLink(element)->fPriority == priority);
271 ASSERT(sGetLink(element)->fPrevious == NULL);
286 RunQueueLink<Element>* elementLink = sGetLink(element);
297 sGetLink(fHeads[priority])->fPrevious = element;
315 RunQueueLink<Element>* elementLink = sGetLink(element);
326 sGetLink(fTails[priority])->fNext = element;
341 RunQueueLink<Element>* elementLink = sGetLink(elemen
390 GetLink RUN_QUEUE_CLASS_NAME::sGetLink; member in class:RUN_QUEUE_CLASS_NAME
393 GetLink RUN_QUEUE_CLASS_NAME::ConstIterator::sGetLink; member in class:RUN_QUEUE_CLASS_NAME::ConstIterator
[all...]

Completed in 121 milliseconds