PikeAero::CTaskQueue Class Reference

Implements a task queue. The task scheduling sequence is predetermined in the initialize() method. More...

#include <ctaskqueue.h>

Inheritance diagram for PikeAero::CTaskQueue:

[legend]

Collaboration diagram for PikeAero::CTaskQueue:

[legend]

Public Member Functions
	CTaskQueue ()
void	initialize ()
	Create a sequence map of one complete cycle through priorities and task list by task index number into mSequence.
ITask *	next ()
virtual	~CTaskQueue ()
Private Attributes
CMachine::ubit32	mIndex
CByteArray	mSequence

---

Detailed Description

Implements a task queue. The task scheduling sequence is predetermined in the initialize() method.

Author:

Michael Sharkey <mike@pikeaero.com>

Definition at line 34 of file ctaskqueue.h.

---

Constructor & Destructor Documentation

PikeAero::CTaskQueue::CTaskQueue

(

)

Definition at line 26 of file ctaskqueue.cpp.

 : inherited()
 , mIndex(0)
{
}

PikeAero::CTaskQueue::~CTaskQueue

(

)

[virtual]

Definition at line 33 of file ctaskqueue.cpp.

{
}

---

Member Function Documentation

void PikeAero::CTaskQueue::initialize

(

void

)

Create a sequence map of one complete cycle through priorities and task list by task index number into mSequence.

worst case

Definition at line 40 of file ctaskqueue.cpp.

References PikeAero::CObjectList::at(), PikeAero::CMemHeap::compress(), PikeAero::CObjectList::count(), mIndex, mSequence, PikeAero::ITask::priority(), PikeAero::ITask::PriorityHigh, PikeAero::ITask::PriorityLow, PikeAero::CByteArray::resize(), and PikeAero::CByteArray::set().

Referenced by PikeAero::CTaskScheduler::run().

{
    mIndex=0;
    mSequence.resize(count()*(ITask::PriorityHigh+1)); /** worst case */
    for( CMachine::ubit32 priority=(CMachine::ubit32)ITask::PriorityLow; priority <= (CMachine::ubit32)ITask::PriorityHigh; priority++ )
    {
        for( CMachine::ubit32 taskid=0; taskid < count(); taskid++ )
        {
            ITask* task = (ITask*)at(taskid);
            if ( (CMachine::ubit32)task->priority() >= priority )
            {
                mSequence.set( mIndex++, (CMachine::ubit8)taskid );
            }
        }
    }
    mSequence.resize(mIndex);
    CMemHeap::compress();
    mIndex=0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

ITask* PikeAero::CTaskQueue::next

(

)

[inline]

Definition at line 40 of file ctaskqueue.h.

References PikeAero::CByteArray::at(), PikeAero::CObjectList::at(), mIndex, mSequence, and PikeAero::CByteArray::size().

Referenced by PikeAero::CTaskScheduler::run1().

{return (ITask*)at( mSequence.at((++mIndex)>=mSequence.size()?(mIndex=0):mIndex) );}

Here is the call graph for this function:

Here is the caller graph for this function:

---

Field Documentation

CMachine::ubit32 PikeAero::CTaskQueue::mIndex [private]

Definition at line 42 of file ctaskqueue.h.

Referenced by initialize(), and next().

CByteArray PikeAero::CTaskQueue::mSequence [private]

Definition at line 43 of file ctaskqueue.h.

Referenced by initialize(), and next().

---

The documentation for this class was generated from the following files:

• ctaskqueue.h
• ctaskqueue.cpp