kernel/util/DoublyLinkedQueue.h

63 				Element *element = fCurrent;
68 				return element;
112 				Element *element = fNext;
115 				return element;
141 	inline void Insert(Element *element);
142 	inline void InsertBefore(Element *before, Element *element);
143 	inline void Add(Element *element);
144 	inline void Remove(Element *element);
158 	inline Element *GetPrevious(Element *element) const;
159 	inline Element *GetNext(Element *element) const;
179 DOUBLY_LINKED_QUEUE_CLASS_NAME::Insert(Element *element)
181 	if (element) {
182 		Link *elLink = sGetLink(element);
186 			sGetLink(fFirst)->previous = element;
187 		fFirst = element;
194 DOUBLY_LINKED_QUEUE_CLASS_NAME::InsertBefore(Element *before, Element *element)
197 		Insert(element);
200 	if (element == NULL)
204 	Link *link = sGetLink(element);
209 		sGetLink(link->previous)->next = element;
210 	beforeLink->previous = element;
213 		fFirst = element;
219 DOUBLY_LINKED_QUEUE_CLASS_NAME::Add(Element *element)
221 	Insert(element);
227 DOUBLY_LINKED_QUEUE_CLASS_NAME::Remove(Element *element)
229 	if (element == NULL)
234 		"queue: %p, element: %p\n", this, element);
237 	Link *elLink = sGetLink(element);
238 	if (element == fFirst)
291 			Element *element = fFirst;
293 			while ((elLink = sGetLink(element))->next) {
294 				element = elLink->next;
309 	Element *element = fFirst;
310 	while (element) {
311 		Link *elLink = sGetLink(element);
312 		element = elLink->next;
324 	Element *element = Head();
325 	Remove(element);
326 	return element;
332 DOUBLY_LINKED_QUEUE_CLASS_NAME::GetPrevious(Element *element) const
335 	if (element)
336 		result = sGetLink(element)->previous;
343 DOUBLY_LINKED_QUEUE_CLASS_NAME::GetNext(Element *element) const
346 	if (element)
347 		result = sGetLink(element)->next;
357 	for (Element* element = First(); element; element = GetNext(element))