基本原理
参考了一段别人的代码.修改了更稳健,同时增加单例模式
复用io刷新timerfd
map存申请的fd,key排序,发生的一定是最小的.
代码
timerRunner.cpp
/**
* @file timer_poll.cpp
* @brief
* @author
* @version
* @date 2017-05-05
*/
#include <stdlib.h>
#include "timerRunner.h"
using namespace std;
timer::timer(const timer& ptimer)
{
timer_internal = ptimer.timer_internal;
cb = ptimer.cb;
timer_id = ptimer.timer_id;
repeat = ptimer.repeat;
userdata = ptimer.userdata;
}
timer & timer::operator =(const timer& ptimer)
{
if (this == &ptimer)
{
return *this;
}
timer_internal = ptimer.timer_internal;
cb = ptimer.cb;
timer_id = ptimer.timer_id;
repeat = ptimer.repeat;
userdata = ptimer.userdata;
return *this;
}
int timer::start()
{
struct itimerspec ptime_internal = {
0};
ptime_internal.it_value.tv_sec = (int) timer_internal;
ptime_internal.it_value.tv_nsec = (timer_internal - (int) timer_internal)*1000000000;
if(repeat)
{
ptime_internal.it_interval.tv_sec = ptime_internal.it_value.tv_sec;
ptime_internal.it_interval.tv_nsec = ptime_internal.it_value.tv_nsec;
}
timerfd_settime(timer_id, 0, &ptime_internal, NULL);