311 lines
6.6 KiB
C++
311 lines
6.6 KiB
C++
#include "Task.h"
|
||
#include "Time.h"
|
||
|
||
Task::Task()
|
||
{
|
||
Host = NULL;
|
||
|
||
ID = 0;
|
||
Name = NULL;
|
||
Times = 0;
|
||
CpuTime = 0;
|
||
SleepTime = 0;
|
||
Cost = 0;
|
||
CostMs = 0;
|
||
MaxCost = 0;
|
||
Enable = true;
|
||
Event = false;
|
||
Deepth = 0;
|
||
MaxDeepth = 1;
|
||
}
|
||
|
||
Task::~Task()
|
||
{
|
||
if(ID) Host->Remove(ID);
|
||
}
|
||
|
||
bool Task::Execute(ulong now)
|
||
{
|
||
if(Deepth >= MaxDeepth) return false;
|
||
Deepth++;
|
||
|
||
// 如果是事件型任务，这里禁用。任务中可以重新启用
|
||
if(Event)
|
||
Enable = false;
|
||
// 不能通过累加的方式计算下一次时间，因为可能系统时间被调整
|
||
else
|
||
NextTime = now + Period;
|
||
|
||
TimeCost tc;
|
||
SleepTime = 0;
|
||
|
||
Task* cur = Host->Current;
|
||
Host->Current = this;
|
||
Callback(Param);
|
||
Host->Current = cur;
|
||
|
||
// 累加任务执行次数和时间
|
||
Times++;
|
||
int ct = tc.Elapsed();
|
||
if(ct < 0)
|
||
debug_printf("cost = %d \r\n", ct);
|
||
if(ct < 0) ct = -ct;
|
||
//if(ct > 0)
|
||
{
|
||
ct -= SleepTime;
|
||
if(ct > MaxCost) MaxCost = ct;
|
||
CpuTime += ct;
|
||
Cost = CpuTime / Times;
|
||
CostMs = Cost / 1000;
|
||
}
|
||
|
||
#if DEBUG
|
||
if(ct > 500000) debug_printf("Task::Execute 任务 %d [%d] 执行时间过长 %dus 睡眠 %dus\r\n", ID, Times, ct, SleepTime);
|
||
#endif
|
||
|
||
// 如果只是一次性任务，在这里清理
|
||
if(!Event && Period < 0) Host->Remove(ID);
|
||
|
||
Deepth--;
|
||
|
||
return true;
|
||
}
|
||
|
||
// 显示状态
|
||
void Task::ShowStatus()
|
||
{
|
||
debug_printf("Task::%s \t%d [%d] \t平均 %dus ", Name, ID, Times, Cost);
|
||
if(Cost < 1000) debug_printf("\t");
|
||
|
||
debug_printf("\t最大 %dus ", MaxCost);
|
||
if(MaxCost < 1000) debug_printf("\t");
|
||
|
||
debug_printf("\t周期 ");
|
||
if(Period >= 1000)
|
||
debug_printf("%ds", Period / 1000);
|
||
else
|
||
debug_printf("%dms", Period);
|
||
if(!Enable) debug_printf(" 禁用");
|
||
debug_printf("\r\n");
|
||
}
|
||
|
||
// 全局任务调度器
|
||
TaskScheduler* Task::Scheduler()
|
||
{
|
||
static TaskScheduler _sc("Sys");
|
||
|
||
return &_sc;
|
||
}
|
||
|
||
Task* Task::Get(int taskid)
|
||
{
|
||
return (*Scheduler())[taskid];
|
||
}
|
||
|
||
TaskScheduler::TaskScheduler(string name)
|
||
{
|
||
_Tasks = NULL;
|
||
Name = name;
|
||
|
||
_gid = 1;
|
||
|
||
Running = false;
|
||
Current = NULL;
|
||
Count = 0;
|
||
|
||
Cost = 0;
|
||
MaxCost = 0;
|
||
}
|
||
|
||
TaskScheduler::~TaskScheduler()
|
||
{
|
||
Current = NULL;
|
||
//_Tasks.DeleteAll().Clear();
|
||
if(_Tasks) delete _Tasks;
|
||
}
|
||
|
||
void TaskScheduler::Set(IArray<Task>* tasks)
|
||
{
|
||
assert_param2(_Tasks == NULL, "已设置任务数组，禁止覆盖！");
|
||
|
||
_Tasks = tasks;
|
||
}
|
||
|
||
// 创建任务，返回任务编号。dueTime首次调度时间ms，-1表示事件型任务，period调度间隔ms，-1表示仅处理一次
|
||
uint TaskScheduler::Add(Action func, void* param, int dueTime, int period, string name)
|
||
{
|
||
if(!_Tasks) _Tasks = new Array<Task, 0x10>();
|
||
|
||
Task* task = NULL;
|
||
IArray<Task>& ts = *_Tasks;
|
||
for(int i=0; i<ts.Length(); i++)
|
||
{
|
||
if(ts[i].ID == 0)
|
||
{
|
||
task = &ts[i];
|
||
break;
|
||
}
|
||
}
|
||
if(!task)
|
||
{
|
||
debug_printf("TaskScheduler::Add 已达到最大任务数 %d\r\n", ts.Length());
|
||
return 0;
|
||
}
|
||
|
||
task->Host = this;
|
||
task->ID = _gid++;
|
||
task->Name = name;
|
||
task->Callback = func;
|
||
task->Param = param;
|
||
task->Period = period;
|
||
|
||
if(dueTime < 0)
|
||
{
|
||
task->NextTime = dueTime;
|
||
task->Enable = false;
|
||
task->Event = true;
|
||
}
|
||
else
|
||
task->NextTime = Time.Current() + dueTime;
|
||
|
||
Count++;
|
||
|
||
#if DEBUG
|
||
// 输出长整型%ld，无符号长整型%llu
|
||
//debug_printf("%s添加任务%d 0x%08x FirstTime=%lluus Period=%ldus\r\n", Name, task->ID, func, dueTime, period);
|
||
debug_printf("%s::添加%d %s First=%dms Period=%dms\r\n", Name, task->ID, name, dueTime, period);
|
||
#endif
|
||
|
||
return task->ID;
|
||
}
|
||
|
||
void TaskScheduler::Remove(uint taskid)
|
||
{
|
||
if(!_Tasks) return;
|
||
|
||
IArray<Task>& ts = *_Tasks;
|
||
for(int i=0; i<ts.Length(); i++)
|
||
{
|
||
Task& task = ts[i];
|
||
if(task.ID == taskid)
|
||
{
|
||
debug_printf("%s::删除%d %s 0x%08x\r\n", Name, task.ID, task.Name, task.Callback);
|
||
// 首先清零ID，避免delete的时候再次删除
|
||
task.ID = 0;
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
|
||
void TaskScheduler::Start()
|
||
{
|
||
if(Running) return;
|
||
|
||
#if DEBUG
|
||
//Add(ShowTime, NULL, 2000000, 2000000);
|
||
Add(ShowStatus, this, 10000, 30000, "任务状态");
|
||
#endif
|
||
debug_printf("%s::准备就绪 开始循环处理%d个任务！\r\n\r\n", Name, Count);
|
||
|
||
Running = true;
|
||
while(Running)
|
||
{
|
||
Execute(0xFFFFFFFF);
|
||
}
|
||
debug_printf("%s停止调度，共有%d个任务！\r\n", Name, Count);
|
||
}
|
||
|
||
void TaskScheduler::Stop()
|
||
{
|
||
debug_printf("%s停止！\r\n", Name);
|
||
Running = false;
|
||
}
|
||
|
||
// 执行一次循环。指定最大可用时间
|
||
void TaskScheduler::Execute(uint msMax)
|
||
{
|
||
ulong now = Time.Current();
|
||
ulong end = now + msMax;
|
||
ulong min = UInt64_Max; // 最小时间，这个时间就会有任务到来
|
||
|
||
TimeCost tc;
|
||
|
||
IArray<Task>& ts = *_Tasks;
|
||
for(int i=0; i<ts.Length(); i++)
|
||
{
|
||
Task* task = &ts[i];
|
||
if(task->ID == 0 || !task->Enable) continue;
|
||
|
||
if((task->NextTime <= now || task->NextTime < 0)
|
||
// 并且任务的平均耗时要足够调度，才安排执行，避免上层是Sleep时超出预期时间
|
||
&& Time.Current() + task->CostMs <= end)
|
||
{
|
||
task->Execute(now);
|
||
|
||
// 为了确保至少被有效调度一次，需要在被调度任务内判断
|
||
// 如果已经超出最大可用时间，则退出
|
||
if(!msMax || Time.Current() > end) return;
|
||
}
|
||
// 注意Execute内部可能已经释放了任务
|
||
if(task->ID && task->Enable)
|
||
{
|
||
// 如果事件型任务还需要执行，那么就不要做任何等待
|
||
if(task->NextTime < 0)
|
||
min = 0;
|
||
else if((ulong)task->NextTime < min)
|
||
min = (ulong)task->NextTime;
|
||
}
|
||
}
|
||
|
||
int ct = tc.Elapsed();
|
||
if(Cost > 0)
|
||
Cost = (Cost + ct) >> 1;
|
||
else
|
||
Cost = ct;
|
||
if(ct > MaxCost) MaxCost = ct;
|
||
|
||
// 如果有最小时间，睡一会吧
|
||
now = Time.Current(); // 当前时间
|
||
if(min != UInt64_Max && min > now)
|
||
{
|
||
min -= now;
|
||
//debug_printf("任务空闲休眠 %d ms \r\n", (uint)(min/1000));
|
||
// 睡眠时间不能过长，否则可能无法喂狗
|
||
//if(min > 1000) min = 1000;
|
||
Sleeping = true;
|
||
Time.Sleep(min, &Sleeping);
|
||
Sleeping = false;
|
||
}
|
||
}
|
||
|
||
// 显示状态
|
||
void TaskScheduler::ShowStatus(void* param)
|
||
{
|
||
TaskScheduler* host = (TaskScheduler*)param;
|
||
|
||
debug_printf("Task::ShowStatus 平均 %dus 最大 %dus 当前 ", host->Cost, host->MaxCost);
|
||
Time.Now().Show();
|
||
debug_printf(" 启动 ");
|
||
DateTime dt(Time.Current() / 1000);
|
||
dt.Show(true);
|
||
|
||
IArray<Task>& ts = *(host->_Tasks);
|
||
for(int i=0; i<ts.Length(); i++)
|
||
{
|
||
Task& task = ts[i];
|
||
if(task.ID) task.ShowStatus();
|
||
}
|
||
}
|
||
|
||
Task* TaskScheduler::operator[](int taskid)
|
||
{
|
||
IArray<Task>& ts = *_Tasks;
|
||
for(int i=0; i<ts.Length(); i++)
|
||
{
|
||
Task& task = ts[i];
|
||
if(task.ID == taskid) return &task;
|
||
}
|
||
|
||
return NULL;
|
||
}
|