kernel/scheduler/RunQueue.h

90 	inline	void		PushFront(Element* element, unsigned int priority);
91 	inline	void		PushBack(Element* elementt, unsigned int priority);
95 	inline	Element*	GetHead(unsigned int priority) const;
262 	unsigned int priority = PriorityHeap::GetKey(maxPriority);
264 	ASSERT(priority <= MaxPriority);
265 	ASSERT(fHeads[priority] != NULL);
267 	Element* element = fHeads[priority];
269 	ASSERT(sGetLink(element)->fPriority == priority);
270 	ASSERT(fTails[priority] != NULL);
280 	unsigned int priority)
284 	ASSERT(priority <= MaxPriority);
291 	ASSERT((fHeads[priority] == NULL && fTails[priority] == NULL)
292 		|| (fHeads[priority] != NULL && fTails[priority] != NULL));
294 	elementLink->fPriority = priority;
295 	elementLink->fNext = fHeads[priority];
296 	if (fHeads[priority] != NULL)
297 		sGetLink(fHeads[priority])->fPrevious = element;
299 		fTails[priority] = element;
300 		fPriorityHeap.Insert(&fPriorityEntries[priority], priority);
302 	fHeads[priority] = element;
309 	unsigned int priority)
313 	ASSERT(priority <= MaxPriority);
320 	ASSERT((fHeads[priority] == NULL && fTails[priority] == NULL)
321 		|| (fHeads[priority] != NULL && fTails[priority] != NULL));
323 	elementLink->fPriority = priority;
324 	elementLink->fPrevious = fTails[priority];
325 	if (fTails[priority] != NULL)
326 		sGetLink(fTails[priority])->fNext = element;
328 		fHeads[priority] = element;
329 		fPriorityHeap.Insert(&fPriorityEntries[priority], priority);
331 	fTails[priority] = element;
342 	unsigned int priority = elementLink->fPriority;
344 	ASSERT(elementLink->fPrevious != NULL || fHeads[priority] == element);
345 	ASSERT(elementLink->fNext != NULL || fTails[priority] == element);
350 		fHeads[priority] = elementLink->fNext;
354 		fTails[priority] = elementLink->fPrevious;
356 	ASSERT((fHeads[priority] == NULL && fTails[priority] == NULL)
357 		|| (fHeads[priority] != NULL && fTails[priority] != NULL));
359 	if (fHeads[priority] == NULL) {
360 		fPriorityHeap.ModifyKey(&fPriorityEntries[priority], MaxPriority + 1);
361 		ASSERT(fPriorityHeap.PeekRoot() == &fPriorityEntries[priority]);
372 RUN_QUEUE_CLASS_NAME::GetHead(unsigned int priority) const
376 	ASSERT(priority <= MaxPriority);
377 	return fHeads[priority];