/* Time event structure */
typedef struct aeTimeEvent {
? ? // 標識符
? ? long long id; /* time event identifier. */
? ? // 定時納秒數
? ? monotime when;
? ? // 定時回調函數
? ? aeTimeProc *timeProc;
? ? // 注銷定時器時候的回調函數
? ? aeEventFinalizerProc *finalizerProc;
? ? void *clientData;
? ? struct aeTimeEvent *prev;
? ? struct aeTimeEvent *next;
? ? int refcount; /* refcount to prevent timer events from being
? ?? ??? ? ? * freed in recursive time event calls. */
} aeTimeEvent;

if (aeCreateTimeEvent(server.el, 1, serverCron, NULL, NULL) == AE_ERR) {
? serverPanic("Can't create event loop timers.");
? exit(1);
}

//創(chuàng)建定時器對象
long long aeCreateTimeEvent(aeEventLoop *eventLoop, long long milliseconds,
? ? ? ? aeTimeProc *proc, void *clientData,
? ? ? ? aeEventFinalizerProc *finalizerProc)
{
? ? long long id = eventLoop->timeEventNextId++;
? ? aeTimeEvent *te;

? ? te = zmalloc(sizeof(*te));
? ? if (te == NULL) return AE_ERR;
? ? te->id = id;
? ? te->when = getMonotonicUs() + milliseconds * 1000;
? ? te->timeProc = proc;
? ? te->finalizerProc = finalizerProc;
? ? te->clientData = clientData;
? ? te->prev = NULL;
? ? // 頭插法?
? ? te->next = eventLoop->timeEventHead;
? ? te->refcount = 0;
? ? if (te->next)
? ? ? ? te->next->prev = te;
? ? eventLoop->timeEventHead = te;
? ? return id;
}

?
/* How many microseconds until the first timer should fire.
?* If there are no timers, -1 is returned.
?*
?* Note that's O(N) since time events are unsorted.
?* Possible optimizations (not needed by Redis so far, but...):
?* 1) Insert the event in order, so that the nearest is just the head.
?* ? ?Much better but still insertion or deletion of timers is O(N).
?* 2) Use a skiplist to have this operation as O(1) and insertion as O(log(N)).
?*/
static int64_t usUntilEarliestTimer(aeEventLoop *eventLoop) {
? ? aeTimeEvent *te = eventLoop->timeEventHead;
? ? if (te == NULL) return -1;

? ? aeTimeEvent *earliest = NULL;
? ? while (te) {
? ? ? ? if (!earliest || te->when < earliest->when)
? ? ? ? ? ? earliest = te;
? ? ? ? te = te->next;
? ? }

? ? monotime now = getMonotonicUs();
? ? return (now >= earliest->when) ? 0 : earliest->when - now;
}

?

if (flags & AE_TIME_EVENTS && !(flags & AE_DONT_WAIT))
? usUntilTimer = usUntilEarliestTimer(eventLoop);

if (usUntilTimer >= 0) {
? tv.tv_sec = usUntilTimer / 1000000;
? tv.tv_usec = usUntilTimer % 1000000;
? tvp = &tv;
} else {
? if (flags & AE_DONT_WAIT) {
? ? // 不等待
? ? tv.tv_sec = tv.tv_usec = 0;
? ? tvp = &tv;
? } else {
? ? /* Otherwise we can block */
? ? tvp = NULL; /* wait forever */
? }
}

/* Process time events */
static int processTimeEvents(aeEventLoop *eventLoop) {
? int processed = 0;
? aeTimeEvent *te;
? long long maxId;

? te = eventLoop->timeEventHead;
? maxId = eventLoop->timeEventNextId-1;
? monotime now = getMonotonicUs();
??
? // 刪除定時器
? while(te) {
? ? long long id;
?? ??? ?
? ? // 下一輪中對事件進行刪除
? ? /* Remove events scheduled for deletion. */
? ? if (te->id == AE_DELETED_EVENT_ID) {
? ? ? aeTimeEvent *next = te->next;
? ? ? /* If a reference exists for this timer event,
? ? ? ? ? ? ?* don't free it. This is currently incremented
? ? ? ? ? ? ?* for recursive timerProc calls */
? ? ? if (te->refcount) {
? ? ? ? te = next;
? ? ? ? continue;
? ? ? }
? ? ? if (te->prev)
? ? ? ? te->prev->next = te->next;
? ? ? else
? ? ? ? eventLoop->timeEventHead = te->next;
? ? ? if (te->next)
? ? ? ? te->next->prev = te->prev;
? ? ? if (te->finalizerProc) {
? ? ? ? te->finalizerProc(eventLoop, te->clientData);
? ? ? ? now = getMonotonicUs();
? ? ? }
? ? ? zfree(te);
? ? ? te = next;
? ? ? continue;
? ? }
? ??
? ? if (te->id > maxId) {
? ? ? te = te->next;
? ? ? continue;
? ? }

? ? if (te->when <= now) {
? ? ? int retval;

? ? ? id = te->id;
? ? ? te->refcount++;
? ? ? // timeProc 函數返回值 retVal 為時間事件執(zhí)行的間隔
? ? ? retval = te->timeProc(eventLoop, id, te->clientData);
? ? ? te->refcount--;
? ? ? processed++;
? ? ? now = getMonotonicUs();
? ? ? if (retval != AE_NOMORE) {
? ? ? ? te->when = now + retval * 1000;
? ? ? } else {
? ? ? ? // 如果超時了，那么標記為刪除
? ? ? ? te->id = AE_DELETED_EVENT_ID;
? ? ? }
? ? }
? ? // 執(zhí)行下一個
? ? te = te->next;
? }
? return processed;
}