void CRUTopologicalDGIterator::Next()
{
RUASSERT(FALSE == allTasksLinkMap_.IsEmpty());
CRUTask *pTask = GetCurrentTask();
if (NULL == pTask)
{
return; // all the tasks have been already traversed
}
// The tasks that need to be traversed after me
CRUTaskList &refTaskList =
(DIRECT == dir_) ?
pTask->GetTasksThatDependOnMe() :
pTask->GetTasksThatIDependOn();
// For all of these tasks, decrecase the reference count
// Update the "ready" list, if any of the tasks have become ready.
UpdateIterator(refTaskList);
// Select a new current task
if (TRUE == readyTasksList_.IsEmpty())
{
SetCurrentTask(NULL); // The last task has just been traversed
}
else
{
// Retrieve a new task from the "ready" list
SetCurrentTask(readyTasksList_.RemoveHead());
}
}
bool ArrayIterLoop::Update(COMMAND_ARGS)
{
ArrayElement elem;
ArrayKey key;
if (g_ArrayMap.GetNextElement(m_srcID, &m_curKey, &elem, &key))
{
m_curKey = key;
UpdateIterator(&elem);
return true;
}
return false;
}
ArrayIterLoop::ArrayIterLoop(const ForEachContext* context, UInt8 modIndex)
{
m_srcID = context->sourceID;
m_iterID = context->iteratorID;
m_iterVar = context->var;
// clear the iterator var before initializing it
g_ArrayMap.RemoveReference(&m_iterVar->data, modIndex);
g_ArrayMap.AddReference(&m_iterVar->data, context->iteratorID, 0xFF);
ArrayElement elem;
ArrayKey key;
if (g_ArrayMap.GetFirstElement(m_srcID, &elem, &key))
{
m_curKey = key;
UpdateIterator(&elem); // initialize iterator to first element in array
}
}
