1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
|
/* $OpenBSD: timer.c,v 1.1 2005/03/30 18:44:49 ho Exp $ */
/*
* Copyright (c) 2005 Håkan Olsson. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*
* This code was written under funding by Multicom Security AB.
*/
#include <sys/types.h>
#include <sys/queue.h>
#include <sys/time.h>
#include <stdlib.h>
#include <string.h>
#include "sasyncd.h"
/*
* All events have a name, an expiration time and a function to be called
* at this time. The queue is always sorted so the next event to happen is
* first in the queue.
*/
struct event {
TAILQ_ENTRY (event) next;
struct timeval expire;
char *name;
void (*fun) (void *);
void *arg;
};
static TAILQ_HEAD (event_head, event) events;
/* Initialize timer event queue. */
void
timer_init(void)
{
TAILQ_INIT(&events);
}
/*
* Return the number of seconds until the next event happens. Used for
* the select() call in the main loop.
*/
void
timer_next_event(struct timeval *tv)
{
struct timeval now;
struct event *e = TAILQ_FIRST(&events);
if (e) {
gettimeofday(&now, 0);
if (timercmp(&now, &e->expire, >=))
timerclear(tv);
else
timersub(&e->expire, &now, tv);
} else {
tv->tv_sec = 60; /* "Best guess". */
tv->tv_usec = 0;
}
}
/*
* Whenever select() times out, we have an event that should happen and this
* routine gets called. Handle and remove all pending events.
*/
void
timer_run(void)
{
struct timeval now;
struct event *e;
gettimeofday(&now, 0);
for (e = TAILQ_FIRST(&events); e && timercmp(&now, &e->expire, >=);
e = TAILQ_FIRST(&events)) {
TAILQ_REMOVE(&events, e, next);
log_msg(4, "timer_run: event \"%s\"",
e->name ? e->name : "<unknown>");
(*e->fun)(e->arg);
if (e->name)
free(e->name);
free(e);
}
}
/* Add a new event. */
int
timer_add(char *name, u_int32_t when, void (*function)(void *), void *arg)
{
struct timeval now, tmp;
struct event *e, *new;
new = (struct event *)calloc(1, sizeof *new);
if (!new) {
log_err("timer_add: calloc (1, %u) failed", sizeof *new);
return -1;
}
new->name = strdup(name); /* We handle failures here. */
new->fun = function;
new->arg = arg;
memset(&tmp, 0, sizeof tmp);
tmp.tv_sec = when;
gettimeofday(&now, 0);
timeradd(&now, &tmp, &new->expire);
log_msg(4, "timer_add: new event \"%s\" (expiring in %us)",
name ? name : "<unknown>", when);
/* Insert the new event in the queue so it's always sorted. */
for (e = TAILQ_FIRST(&events); e; e = TAILQ_NEXT(e, next)) {
if (timercmp(&new->expire, &e->expire, >=))
continue;
TAILQ_INSERT_BEFORE(e, new, next);
return 0;
}
TAILQ_INSERT_TAIL(&events, new, next);
return 0;
}
|
