306 lines
7.6 KiB
C
306 lines
7.6 KiB
C
/*
|
|
* Copyright (C) 2000-2007 Carsten Haitzler, Geoff Harrison and various contributors
|
|
* Copyright (C) 2006-2022 Kim Woelders
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
* of this software and associated documentation files (the "Software"), to
|
|
* deal in the Software without restriction, including without limitation the
|
|
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
|
* sell copies of the Software, and to permit persons to whom the Software is
|
|
* furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in
|
|
* all copies of the Software, its documentation and marketing & publicity
|
|
* materials, and acknowledgment shall be given in the documentation, materials
|
|
* and software packages that this Software was used.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
* THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
|
|
* IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
|
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
*/
|
|
#include "E.h"
|
|
#include "list.h"
|
|
#include "timers.h"
|
|
|
|
#define DEBUG_TIMERS 0
|
|
#if DEBUG_TIMERS
|
|
#define Dprintf(fmt...) if(EDebug(EDBUG_TYPE_TIMERS))Eprintf(fmt)
|
|
#else
|
|
#define Dprintf(fmt...)
|
|
#endif
|
|
|
|
struct _timer {
|
|
unsigned int in_time;
|
|
unsigned int at_time;
|
|
struct _timer *next;
|
|
int (*func)(void *data);
|
|
void *data;
|
|
char again;
|
|
};
|
|
|
|
static int
|
|
tdiff(unsigned int t1, unsigned int t2)
|
|
{
|
|
return (int)(t1 - t2);
|
|
}
|
|
|
|
static Timer *q_first = NULL;
|
|
|
|
static void
|
|
_TimerSet(Timer *timer)
|
|
{
|
|
Timer *ptr, *pptr;
|
|
|
|
if (EDebug(EDBUG_TYPE_TIMERS) > 1)
|
|
Eprintf("%s %p: func=%p data=%p\n", __func__, timer, timer->func,
|
|
timer->data);
|
|
|
|
/* if there is no queue it becomes the queue */
|
|
if (!q_first)
|
|
{
|
|
q_first = timer;
|
|
timer->next = NULL;
|
|
}
|
|
else
|
|
{
|
|
pptr = NULL;
|
|
for (ptr = q_first; ptr; pptr = ptr, ptr = ptr->next)
|
|
{
|
|
if (tdiff(ptr->at_time, timer->at_time) > 0)
|
|
break;
|
|
}
|
|
if (pptr)
|
|
pptr->next = timer;
|
|
else
|
|
q_first = timer;
|
|
timer->next = ptr;
|
|
}
|
|
}
|
|
|
|
static void
|
|
_TimerDel(Timer *timer)
|
|
{
|
|
if (EDebug(EDBUG_TYPE_TIMERS))
|
|
Eprintf("%s %p: func=%p data=%p\n", __func__, timer, timer->func,
|
|
timer->data);
|
|
Efree(timer);
|
|
}
|
|
|
|
Timer *
|
|
TimerAdd(int dt_ms, int (*func)(void *data), void *data)
|
|
{
|
|
Timer *timer;
|
|
|
|
timer = EMALLOC(Timer, 1);
|
|
if (!timer)
|
|
return NULL;
|
|
|
|
timer->in_time = (unsigned int)dt_ms;
|
|
timer->at_time = GetTimeMs() + dt_ms;
|
|
timer->func = func;
|
|
timer->data = data;
|
|
timer->again = 1;
|
|
|
|
if (EDebug(EDBUG_TYPE_TIMERS))
|
|
Eprintf("%s %p: func=%p data=%p: %8d\n", __func__, timer,
|
|
timer->func, timer->data, dt_ms);
|
|
|
|
_TimerSet(timer); /* Add to timer queue */
|
|
|
|
return timer;
|
|
}
|
|
|
|
void
|
|
TimersRun(unsigned int t_ms)
|
|
{
|
|
Timer *timer, *q_old, *q_new, *q_run;
|
|
|
|
timer = q_first;
|
|
if (!timer)
|
|
return; /* No timers pending */
|
|
|
|
Dprintf("%s - A\n", __func__);
|
|
|
|
q_new = timer; /* q_new is now temporarily the timer queue */
|
|
q_old = timer; /* q_old is the old timer queue */
|
|
q_first = NULL; /* q_first holds timers added during timer processing */
|
|
q_run = NULL; /* q_run holds the last run timer */
|
|
for (; timer; timer = q_new)
|
|
{
|
|
if (tdiff(timer->at_time, t_ms) > 0)
|
|
break;
|
|
|
|
if (EDebug(EDBUG_TYPE_TIMERS))
|
|
Eprintf("%s - run %p: func=%p data=%p: %8d\n", __func__, timer,
|
|
timer->func, timer->data, timer->at_time - t_ms);
|
|
|
|
q_new = timer->next;
|
|
|
|
/* Run this callback */
|
|
timer->again = timer->func(timer->data);
|
|
q_run = timer;
|
|
}
|
|
|
|
if (q_run)
|
|
{
|
|
/* At least one timer has run */
|
|
q_run->next = NULL; /* Terminate expired timer list */
|
|
|
|
/* Re-schedule/remove timers that have run */
|
|
q_run = q_new; /* Swap q_first and q_new ... */
|
|
q_new = q_first; /* q_new are the new added timers */
|
|
q_first = q_run; /* q_first is now the timer queue */
|
|
for (timer = q_old; timer; timer = q_run)
|
|
{
|
|
q_run = timer->next;
|
|
if (timer->again)
|
|
{
|
|
timer->at_time += timer->in_time;
|
|
_TimerSet(timer); /* Add to timer queue */
|
|
}
|
|
else
|
|
{
|
|
_TimerDel(timer);
|
|
}
|
|
}
|
|
|
|
/* Schedule timers that have been added */
|
|
for (timer = q_new; timer; timer = q_run)
|
|
{
|
|
q_run = timer->next;
|
|
_TimerSet(timer); /* Add to timer queue */
|
|
}
|
|
}
|
|
else
|
|
{
|
|
q_first = q_old; /* Restore timer queue */
|
|
}
|
|
|
|
if (EDebug(EDBUG_TYPE_TIMERS) > 1)
|
|
{
|
|
for (timer = q_first; timer; timer = timer->next)
|
|
Eprintf("%s - pend %p: func=%p data=%p: %8d (%d)\n", __func__,
|
|
timer, timer->func, timer->data, timer->at_time - t_ms,
|
|
timer->in_time);
|
|
}
|
|
|
|
Dprintf("%s - B\n", __func__);
|
|
}
|
|
|
|
int
|
|
TimersRunNextIn(unsigned int t_ms)
|
|
{
|
|
Timer *timer;
|
|
int dt;
|
|
|
|
timer = q_first;
|
|
|
|
/* If the next (rescheduled) timer is already expired, set timeout time
|
|
* to 1 ms. This avoids starving the fd's and should maintain the intended
|
|
* (mean) timer rate.
|
|
* The (mean) amount of work done in a timer function should of course not
|
|
* exceed the timeout time. */
|
|
if (timer)
|
|
dt = (int)(timer->at_time - t_ms) > 0 ?
|
|
(int)(timer->at_time - t_ms) : 1;
|
|
else
|
|
dt = 0;
|
|
|
|
if (EDebug(EDBUG_TYPE_TIMERS))
|
|
Eprintf("%s - next in %8d\n", __func__, dt);
|
|
|
|
return dt;
|
|
}
|
|
|
|
void
|
|
TimerDel(Timer *timer)
|
|
{
|
|
Timer *qe, *ptr, *pptr;
|
|
|
|
pptr = NULL;
|
|
for (ptr = q_first; ptr; pptr = ptr, ptr = ptr->next)
|
|
{
|
|
qe = ptr;
|
|
if (qe != timer)
|
|
continue;
|
|
|
|
/* Match - remove it from the queue */
|
|
if (pptr)
|
|
pptr->next = qe->next;
|
|
else
|
|
q_first = qe->next;
|
|
|
|
/* free it */
|
|
_TimerDel(timer);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void
|
|
TimerSetInterval(Timer *timer, int dt_ms)
|
|
{
|
|
timer->in_time = (unsigned int)dt_ms;
|
|
}
|
|
|
|
/*
|
|
* Idlers
|
|
*/
|
|
static LIST_HEAD(idler_list);
|
|
|
|
typedef void (IdlerFunc) (void *data);
|
|
|
|
struct _idler {
|
|
dlist_t list;
|
|
IdlerFunc *func;
|
|
void *data;
|
|
};
|
|
|
|
Idler *
|
|
IdlerAdd(IdlerFunc *func, void *data)
|
|
{
|
|
Idler *id;
|
|
|
|
id = EMALLOC(Idler, 1);
|
|
if (!id)
|
|
return NULL;
|
|
|
|
id->func = func;
|
|
id->data = data;
|
|
|
|
LIST_APPEND(Idler, &idler_list, id);
|
|
|
|
return id;
|
|
}
|
|
|
|
void
|
|
IdlerDel(Idler *id)
|
|
{
|
|
LIST_REMOVE(Idler, &idler_list, id);
|
|
Efree(id);
|
|
}
|
|
|
|
static void
|
|
_IdlerRun(void *_id, void *prm __UNUSED__)
|
|
{
|
|
Idler *id = (Idler *) _id;
|
|
|
|
if (EDebug(EDBUG_TYPE_IDLERS) > 1)
|
|
Eprintf("%s: func=%p\n", __func__, id->func);
|
|
id->func(id->data);
|
|
}
|
|
|
|
void
|
|
IdlersRun(void)
|
|
{
|
|
Idler *id;
|
|
|
|
if (EDebug(EDBUG_TYPE_IDLERS))
|
|
Eprintf("%s B\n", __func__);
|
|
LIST_FOR_EACH(Idler, &idler_list, id) _IdlerRun(id, NULL);
|
|
if (EDebug(EDBUG_TYPE_IDLERS))
|
|
Eprintf("%s E\n", __func__);
|
|
}
|